Artur Czumaj
Peter Davies
Abstract
We study two fundamental communication primitives: broadcasting and leader election in the classical model of multi-hop radio networks with unknown topology and without collision detection mechanisms. It has been known for almost 20 years that in undirected networks with n nodes and diameter D, randomized broadcasting requires Ω(D log n/D + log2 n) rounds, assuming that uninformed nodes are not allowed to communicate (until they are informed). Only very recently, Haeupler and Wajc (PODC'2016) showed that this bound can be improved for the model with spontaneous transmissions, providing an O(D log n log log n/log D + logO(1) n)-time broadcasting algorithm. In this article, we give a new and faster algorithm that completes broadcasting in O(D log n/log D + logO(1) n) time, succeeding with high probability. This yields the first optimal O(D)-time broadcasting algorithm whenever n is polynomial in D.
Furthermore, our approach can be applied to design a new leader election algorithm that matches the performance of our broadcasting algorithm. Previously, all fast randomized leader election algorithms have used broadcasting as a subroutine and their complexity has been asymptotically strictly larger than the complexity of broadcasting. In particular, the fastest previously known randomized leader election algorithm of Ghaffari and Haeupler (SODA'2013) requires O(D log n/D min {log log n, log n/D} + logO(1) n)-time, succeeding with high probability. Our new algorithm again requires O(D log n/log D + logO(1) n) time, also succeeding with high probability.
- Noga Alon, Amotz Bar-Noy, Nathan Linial, and David Peleg. 1991. A lower bound for radio broadcast. J. Comput. Syst. Sci. 43, 2 (Oct. 1991), 290--298.Google Scholar
Digital Library
- Reuven Bar-Yehuda, Oded Goldreich, and Alon Itai. 1991. Efficient emulation of single-hop radio network with collision on multi-hop radio network with no collision detection. Distrib. Comput. 5, 1 (Sep. 1991), 67--71.Google ScholarDigital Library
- Reuven Bar-Yehuda, Oded Goldreich, and Alon Itai. 1992. On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. J. Comput. Syst. Sci. 45, 1 (Aug. 1992), 104--126.Google ScholarCross Ref
- Bogdan S. Chlebus, Leszek Gąsieniec, Alan Gibbons, Andrzej Pelc, and Wojciech Rytter. 2002. Deterministic broadcasting in unknown radio networks. Distrib. Comput. 15, 1 (January 2002), 27--38.Google ScholarDigital Library
- Bogdan S. Chlebus, Dariusz R. Kowalski, and Andrzej Pelc. 2012. Electing a leader in multi-hop radio networks. In Proceedings of the 16th International Conference on Principles of Distributed Systems (OPODIS’12), Lecture Notes in Computer Science, Vol. 7702. Springer, Berlin, 106--120.Google ScholarCross Ref
- Andrea E. F. Clementi, Angelo Monti, and Riccardo Silvestri. 2003. Distributed broadcasting in radio networks of unknown topology. Theor. Comput. Sci. 302, 1--3 (Apr. 2003), 337--364.Google ScholarDigital Library
- Artur. Czumaj and Peter Davies. 2018. Deterministic communication in radio networks. SIAM J. Comput. 47, 1 (2018), 218--240.Google ScholarCross Ref
- Artur Czumaj and Peter Davies. 2019. Leader election in multi-hop radio networks. Theoretical Computer Science 792 (2019), 2--11. Special issue in honor of the 70th birthday of Prof. Wojciech Rytter.Google ScholarDigital Library
- Artur Czumaj and Wojciech Rytter. 2003. Broadcasting algorithms in radio networks with unknown topology. J. Algor. 60, 2 (Aug. 2003), 115--143.Google Scholar
- Mohsen Ghaffari and Bernhard Haeupler. 2013. Near optimal leader election in multi-hop radio networks. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’13). SIAM, Philadelphia, PA, 748--766.Google ScholarCross Ref
- Mohsen Ghaffari, Bernhard Haeupler, and Majid Khabbazian. 2015. Randomized broadcast in radio networks with collision detection. Distrib. Comput. 28, 6 (Dec. 2015), 407--422.Google ScholarDigital Library
- Bernhard Haeupler and David Wajc. 2016. A faster distributed radio broadcast primitive. In Proceedings of the 35th Annual ACM Symposium on Principles of Distributed Computing (PODC’16). ACM Press, New York, NY, 361--370.Google ScholarDigital Library
- Dariusz R. Kowalski. 2005. On selection problem in radio networks. In Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC’05). ACM Press, New York, NY, 158--166.Google ScholarDigital Library
- Dariusz R. Kowalski and Andrzej Pelc. 2005. Broadcasting in undirected ad hoc radio networks. Distrib. Comput. 18, 1 (Jul. 2005), 43--57.Google ScholarDigital Library
- Eyal Kushilevitz and Yishay Mansour. 1998. An Ω(D log (N/D)) lower bound for broadcast in radio networks. SIAM J. Comput. 27, 3 (1998), 702--712.Google ScholarDigital Library
- Gary L. Miller, Richard Peng, and Shen Chen Xu. 2013. Parallel graph decompositions using random shifts. In Proceedings of the 25th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA’13). ACM Press, New York, NY, 196--203.Google ScholarDigital Library
- David Peleg. 2007. Time-efficient broadcasting in radio networks: A review. In Proceedings of the 4th International Conference on Distributed Computing and Internet Technology (ICDCIT’07), Lecture Notes in Computer Science, Vol. 4882. Springer, Berlin, 1--18.Google ScholarCross Ref
Index Terms
- Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks
Recommendations
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks
PODC '17: Proceedings of the ACM Symposium on Principles of Distributed ComputingWe study two fundamental communication primitives: broadcasting and leader election in the classical model of multi-hop radio networks with unknown topology and without collision detection mechanisms. It has been known for almost 20 years that in ...
Broadcasting in undirected ad hoc radio networks
Special issue: PODC 02We consider distributed broadcasting in radio networks, modeled as undirected graphs, whose nodes have no information on the topology of the network, nor even on their immediate neighborhood. For randomized broadcasting, we give an algorithm working in ...
Sublinear bounds for randomized leader election
This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O ( 1 ) rounds and (with high probability) uses only O ( n log 3 / 2 n ) ...
Comments