Abstract.
We 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 expected time \( {\user1{\mathcal{O}}}{\left( {D\;\log {\left( {n/D} \right)} + \log ^{2} n} \right)} \) in n-node radio networks of diameter D, which is optimal, as it matches the lower bounds of Alon et al. [1] and Kushilevitz and Mansour [16]. Our algorithm improves the best previously known randomized broadcasting algorithm of Bar-Yehuda, Goldreich and Itai [3], running in expected time \( {\user1{\mathcal{O}}}{\left( {D\;\log n + \log ^{2} n} \right)} \). (In fact, our result holds also in the setting of n-node directed radio networks of radius D.) For deterministic broadcasting, we show the lower bound \(\Omega (n \frac{\log n}{\log (n/D)})\) on broadcasting time in n-node radio networks of diameter D. This implies previously known lower bounds of Bar-Yehuda, Goldreich and Itai [3] and Bruschi and Del Pinto [5], and is sharper than any of them in many cases. We also give an algorithm working in time \( {\user1{\mathcal{O}}}{\left( {n\log n} \right)} \), thus shrinking - for the first time - the gap between the upper and the lower bound on deterministic broadcasting time to a logarithmic factor.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
N. Alon, A. Bar-Noy, N. Linial and D. Peleg, A lower bound for radio broadcast, Journal of Computer and System Sciences 43 (1991), 290-298
B. Awerbuch, A new distributed depth-first-search algorithm, Information Processing Letters 20 (1985), 147-150
R. Bar-Yehuda, O. Goldreich and A. Itai, On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization, Journal of Computer and System Sciences 45 (1992), 104-126
S. Basagni, D. Bruschi and I. Chlamtac, A mobility-transparent deterministic broadcast mechanism for ad hoc networks, IEEE/ACM Trans. on Networking 7 (1999), 799-807
D. Bruschi and M. Del Pinto, Lower bounds for the broadcast problem in mobile radio networks, Distributed Computing 10 (1997), 129-135
I. Chlamtac and O. Weinstein, The wave expansion approach to broadcasting in multihop radio networks, IEEE Trans. on Communications 39 (1991), 426-433
B. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc and W. Rytter, Deterministic broadcasting in unknown radio networks, Distributed Computing 15 (2002), 27-38.
B. Chlebus, L. Gasieniec, A. Östlin and J.M. Robson, Deterministic radio broadcasting, Proc. 27th Int. Coll. on Automata, Languages and Programming (ICALP'2000), 717-728
M. Chrobak, L. Gasieniec and W. Rytter, Fast broadcasting and gossiping in radio networks, Journal of Algorithms 43 (2002), 177-189
A.E.F. Clementi, A. Monti and R. Silvestri, Selective families, superimposed codes, and broadcasting on unknown radio networks, Proc. 12th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA'2001), 709-718
A. Czumaj and W. Rytter, Broadcasting algorithms in radio networks with unknown topology, Proc. 44th Ann.Symposium on Foundations of Computer Science (FOCS'2003), 492-501
I. Gaber and Y. Mansour, Centralized broadcast in multihop radio networks, Journal of Algorithms 46(1) (2003), 1-20
D. Kowalski and A. Pelc, Time of deterministic broadcasting in radio networks with local knowledge, SIAM Journal on Computing 33 (2004), 870-891
D. Kowalski and A. Pelc, Faster deterministic broadcasting in ad hoc radio networks, SIAM Journal on Discrete Mathematics 18 (2004), 332-346
D. Kowalski and A. Pelc, Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism, Theoretical Computer Science 333 (2005), 355-371
E. Kushilevitz and Y. Mansour, An \(\Omega(D \log (N/D))\) lower bound for broadcast in radio networks, SIAM Journal on Computing 27 (1998), 702-712
Author information
Authors and Affiliations
Corresponding author
Additional information
Received: 1 August 2003, Accepted: 18 March 2005, Published online: 15 June 2005
Dariusz R. Kowalski: This work was done during the stay of Dariusz Kowalski at the Research Chair in Distributed Computing of the Université du Québec en Outaouais, as a postdoctoral fellow. Research supported in part by KBN grant 4T11C04425.
Andrzej Pelc: Research of Andrzej Pelc was supported in part by NSERC discovery grant and by the Research Chair in Distributed Computing of the Université du Québec en Outaouais.
Rights and permissions
About this article
Cite this article
Kowalski, D.R., Pelc, A. Broadcasting in undirected ad hoc radio networks. Distrib. Comput. 18, 43–57 (2005). https://doi.org/10.1007/s00446-005-0126-7
Issue Date:
DOI: https://doi.org/10.1007/s00446-005-0126-7