Abstract
We study oblivious deterministic gossip algorithms for multi-channel radio networks with a malicious adversary. In a multi-channel network, each of the n processes in the system must choose, in each round, one of the c channels of the system on which to participate. Assuming the adversary can disrupt one channel per round, preventing communication on that channel, we establish a tight bound of \(\max\left(\Theta\left(\frac{(1-\epsilon)n}{c-1} + \log_c{n}\right), \Theta\left(\frac{n(1-\epsilon)}{\epsilon c^2}\right)\right)\) on the number of rounds needed to solve the ε-gossip problem, a parameterized generalization of the all-to-all gossip problem that requires (1 − ε)n of the “rumors” to be successfully disseminated. Underlying our lower bound proof lies an interesting connection between ε-gossip and extremal graph theory. Specifically, we make use of Turán’s theorem, a seminal result in extremal combinatorics, to reason about an adversary’s optimal strategy for disrupting an algorithm of a given duration. We then show how to generalize our upper bound to cope with an adversary that can simultaneously disrupt t < c channels. Our generalization makes use of selectors: a combinatorial tool that guarantees that any subset of processes will be “selected” by some set in the selector. We prove this generalized algorithm optimal if a maximum number of values is to be gossiped. We conclude by extending our algorithm to tolerate traditional Byzantine corruption faults.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Koo, C.Y.: Broadcast in radio networks tolerating byzantine adversarial behaviour. In: PODC. Proceedings of the 23rd Symposium on Principles of Distributed Computing, pp. 275–282 (2004)
Bhandari, V., Vaidya, N.H.: On reliable broadcast in a radio network. In: PODC. Proceedings of the 24th Symposium on Principles of Distributed Computing, pp. 138–147 (2005)
Bhandari, V., Vaidya, N.H.: On reliable broadcast in a radio network: A simplified characterization. Technical report, University of Illinois at Urbana-Champaign (May 2005)
Pelc, A., Peleg, D.: Feasibility and complexity of broadcasting with random transmission failures. In: PODC. Proceedings of the 24th Symposium on Principles of Distributed Computing, pp. 334–341 (2005)
Bhandari, V., Vaidya, N.H.: Reliable broadcast in wireless networks with probabilistic failures. In: Infocom. Proceedings of the 26th Conference on Computer Communications, pp. 715–723 (2007)
Gilbert, S., Guerraoui, R., Newport, C.: Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks. In: Shvartsman, A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 215–229. Springer, Heidelberg (2006)
Koo, C.Y., Bhandari, V., Katz, J., Vaidya, N.H.: Reliable broadcast in radio networks: The bounded collision case. In: PODC. Proceedings of the 25th Symposium on Principles of Distributed Computing, pp. 258–264 (2006)
Kyasanur, P., Vaidya, N.H.: Capacity of multi-channel wireless networks: Impact of number of channels and interfaces. In: Mobicom. Proceedings of the 11th Annual International Conference on Mobile Computing and Networking, pp. 43–57 (2005)
Bhandari, V., Vaidya, N.H.: Connectivity and capacity of multi-channel wireless networks with channel switching constraints. Technical report, University of Illinois at Urbana-Champaign (January 2007)
Mitola, J.: Cognitive Radio: An Integrated Agent Architecture for Software Defined Radio. PhD thesis, Royal Institute of Technology, Sweden (2000)
Krishnamurthy, S., Chandrasekaran, R., Mittal, N., Venkatesan, S.: Brief announcement: Synchronous distributed algorithms for node discovery and configuration in multi-channel cognitive radio networks. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 572–574. Springer, Heidelberg (2006)
Krishnamurthy, S., Thoppian, M., Kuppa, S., Chanrasekaran, R., Venkatesan, S., Mittal, N., Prakash, R.: Time-efficient layer-2 auto-configuration for cognitive radios. In: PDCS. Procedings of the International Conference on Parallel and Distributed Systems, pp. 459–464 (2005)
Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. Journal of Computer and System Sciences 43(2), 290–298 (1992)
Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization. Journal of Computer and System Sciences 45(1), 104–126 (1992)
Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: FOCS. Proceedings of the 44th Symposium on Foundations of Computer Science, pp. 492–501 (2003)
Kowalski, D.R., Pelc, A.: Time of deterministic broadcasting in radio networks with local knowledge. SIAM Journal on Computing 33(4), 870–891 (2004)
Diks, K., Pelc, A.: Almost safe gossiping in bounded degree networks. SIAM Journal on Discrete Mathematics 5(3), 338–344 (1992)
Kranakis, E., Krizanc, D., Pelc, A.: Fault-tolerant broadcasting in radio networks. Journal of Algorithms 39(1), 47–67 (2001)
Turán, P.: On an extremal problem in graph theory. Matematicko Fizicki Lapok 48 (1941)
Komlos, J., Greenberg, A.: An asymptotically fast non-adaptive algorithm for conflict resolution in multiple access channels. Transactions on Information Theory 31(2), 302–306 (1985)
Bonis, A.D., Gasieniec, L., Vaccaro, U.: Optimal two-stage algorithms for group testing problems. SIAM Journal on Computing 34(5), 1253–1270 (2005)
Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: SODA. Proceedings of the 13th Symposium on Discrete Algorithms, pp. 697–704 (2002)
de Caen, D.: Extension of a theorem of Moon and Moser on complete subgraphs. Ars Combinatoria 16, 5–10 (1983)
Sidorenko, A.F.: What we know and what we do not know about Turán numbers. Graphs and Combinatorics 11(2), 179–199 (1995)
Miller, M.J., Vaidya, N.H.: Leveraging channel diversity for key establishment in wireless sensor networks. Technical report, U. of Illinois at Urbana-Champaign (December 2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dolev, S., Gilbert, S., Guerraoui, R., Newport, C. (2007). Gossiping in a Multi-channel Radio Network. In: Pelc, A. (eds) Distributed Computing. DISC 2007. Lecture Notes in Computer Science, vol 4731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75142-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-75142-7_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75141-0
Online ISBN: 978-3-540-75142-7
eBook Packages: Computer ScienceComputer Science (R0)