Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks
- 28 January 2021
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 68 (2), 1-22
- https://doi.org/10.1145/3446383
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 + log 2 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 + log O (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 + log O (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 } + log O (1) n )-time, succeeding with high probability. Our new algorithm again requires O ( D log n /log D + log O (1) n ) time, also succeeding with high probability.Keywords
Funding Information
- Centre for Discrete Mathematics and its Applications
This publication has 17 references indexed in Scilit:
- Near Optimal Leader Election in Multi-Hop Radio NetworksPublished by Society for Industrial & Applied Mathematics (SIAM) ,2013
- Time-Efficient Broadcasting in Radio Networks: A ReviewPublished by Springer Science and Business Media LLC ,2007
- Broadcasting algorithms in radio networks with unknown topologyJournal of Algorithms, 2006
- Broadcasting in undirected ad hoc radio networksDistributed Computing, 2005
- Distributed broadcast in radio networks of unknown topologyTheoretical Computer Science, 2003
- Deterministic broadcasting in ad hoc radio networksDistributed Computing, 2002
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio NetworksSIAM Journal on Computing, 1998
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomizationJournal of Computer and System Sciences, 1992
- A lower bound for radio broadcastJournal of Computer and System Sciences, 1991
- Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detectionDistributed Computing, 1991