article

Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism

Authors:

Dariusz R. Kowalski,

Andrzej PelcAuthors Info & Claims

Theoretical Computer Science, Volume 333, Issue 3

Pages 355 - 371

https://doi.org/10.1016/j.tcs.2004.04.017

Published: 03 March 2005 Publication History

Abstract

We consider the time of broadcasting in ad hoc radio networks modeled as undirected graphs. In such networks, every node knows only its own label and a linear bound on the number of nodes but is unaware of the topology of the network, or even of its own neighborhood. Our aim is to study to what extent the availability of two important characteristics of a broadcasting algorithm influences optimal broadcasting time. These characteristics are adaptiveness and randomization. Our contribution is establishing upper and lower bounds on optimal broadcasting time for three classes of algorithms: adaptive deterministic, oblivious randomized and oblivious deterministic. In two cases we present tight bounds, and in one case a small gap remains. We show that for deterministic adaptive algorithms time Ω(n) is required even for n-node networks of constant diameter. This lower bound is strongest possible, since linear time algorithms are known, and hence establishes optimal time Θ(n) for this class. For oblivious randomized algorithms we show an upper bound O(n min{D, log n}) and a lower bound Ω(n) on optimal expected broadcasting time in n-node networks of diameter D. Finally, for oblivious deterministic algorithms we show matching upper and lower bounds Θ(n min{D, √n}) on optimal broadcasting time. Our results imply that enforcing obliviousness has at least as strong negative impact on broadcasting time as enforcing determinism, and that algorithms having both these features are strictly less efficient than those having only one of them.

References

[1]

{1} N. Alon, A. Bar-Noy, N. Linial, D. Peleg, A lower bound for radio broadcast, J. Comput. System Sci. 43 (1991) 290-298.]]

Digital Library

[2]

{2} B. Awerbuch, A new distributed depth-first-search algorithm, Inform. Process. Lett. 20 (1985) 147-150.]]

[3]

{3} R. Bar-Yehuda, O. Goldreich, A. Itai, On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization, J. Comput. System Sci. 45 (1992) 104-126.]]

Digital Library

[4]

{4} R. Bar-Yehuda, O. Goldreich, A. Itai, Errata regarding On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization, available from http://www.wisdom.weizmann.ac.il/~oded/p_bgi.html.]]

[5]

{5} D. Bruschi, M. Del Pinto, Lower bounds for the broadcast problem in mobile radio networks, Distributed Comput. 10 (1997) 129-135.]]

Digital Library

[6]

{6} I. Chlamtac, O. Weinstein, The wave expansion approach to broadcasting in multihop radio networks, IEEE Trans. Comm. 39 (1991) 426-433.]]

[7]

{7} B.S. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc, W. Rytter, Deterministic broadcasting in unknown radio networks, Distributed Comput. 15 (2002) 27-38.]]

Digital Library

[8]

{8} B.S. Chlebus, L. Gasieniec, A. Lingas, A. Pagourtzis, Oblivious gossiping in ad-hoc radio networks, in: Proc. of Fifth Internat. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM'2001), 2001, pp. 44-51.]]

[9]

{9} B.S. Chlebus, L. Gasieniec, A. Östlin, J.M. Robson, Deterministic radio broadcasting, in: Proc. of 27th Int. Coll. on Automata, Languages and Programming (ICALP'2000), Lecture Notes in Computer Science, Vol. 1853, 2000, pp. 717-728.]]

[10]

{10} M. Chrobak, L. Gasieniec, W. Rytter, Fast broadcasting and gossiping in radio networks, in: Proc. of 41st Symp. on Foundations of Computer Science (FOCS'2000), 2000, pp. 575-581.]]

[11]

{11} A.E.F. Clementi, A. Monti, R. Silvestri, Selective families, superimposed codes, and broadcasting on unknown radio networks, in: Proc. of 12th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'2001) 2001, pp. 709-718.]]

[12]

{12} A.E.F. Clementi, A. Monti, R. Silvestri, Round robin is optimal for fault-tolerant broadcasting on wireless networks, in: Proc. of Ninth Annual European Symp. on Algorithms (ESA'2001), 2001, pp. 452-463.]]

[13]

{13} A. Czumaj, W. Rytter, Broadcasting algorithms in radio networks with unknown topology, in: Proc. of 44th Ann. Symp. on Foundations of Computer Science (FOCS'2003), 2003, pp. 492-501.]]

[14]

{14} G. De Marco, A. Pelc, Faster broadcasting in unknown radio networks, Inform. Process. Lett. 79 (2001) 53-56.]]

Digital Library

[15]

{15} P. Erdös, P. Frankl, Z. Füredi, Families of finite sets in which no set is covered by the union of r others, Israel J. Math. 51 (1985) 79-89.]]

[16]

{16} I. Gaber, Y. Mansour, Broadcast in radio networks, in: Proc. of Sixth Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'1995) 1995, pp. 577-585.]]

Digital Library

[17]

{17} W.H. Kautz, R.R.C. Singleton, Nonrandom binary superimposed codes, IEEE Trans. Information Theory 10 (1964) 363-377.]]

[18]

{18} D. Kowalski, A. Pelc, Deterministic broadcasting time in radio networks of unknown topology, in: Proc. of 43rd Ann. IEEE Symp. on Foundations of Computer Science (FOCS'2002), 2002, pp. 63-72.]]

[19]

{19} D. Kowalski, A. Pelc, Faster deterministic broadcasting in ad hoc radio networks, in: Proc. of 20th Ann. Symp. on Theoretical Aspects of Computer Science (STACS'2003), Lecture Notes in Computer Science, Vol. 2607, 2003, pp. 109-120.]]

[20]

{20} D. Kowalski, A. Pelc, Broadcasting in undirected ad hoc radio networks, in: Proc. of 22nd ACM Symp. on Principles of Distributed Computing (PODC'2003) pp. 73-82.]]

[21]

{21} E. Kushilevitz, Y. Mansour, An Ω(D log(N/D)) lower bound for broadcast in radio networks, SIAM J. Comput. 27 (1998) 702-712.]]

Digital Library

Cited By

Ellen FGorain BMiller APelc A(2021)Constant-Length Labeling Schemes for Deterministic Radio BroadcastACM Transactions on Parallel Computing10.1145/34706338:3(1-17)Online publication date: 20-Sep-2021
https://dl.acm.org/doi/10.1145/3470633
Ellen FGorain BMiller APelc AScheideler CBerenbrink P(2019)Constant-Length Labeling Schemes for Deterministic Radio BroadcastThe 31st ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3323165.3323194(171-178)Online publication date: 17-Jun-2019
https://dl.acm.org/doi/10.1145/3323165.3323194
Almeida PBaquero CFarach-Colton MJesus PMosteiro M(2017)Fault-tolerant aggregationDistributed Computing10.1007/s00446-016-0288-530:4(281-291)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.1007/s00446-016-0288-5
Show More Cited By

Index Terms

Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism

Recommendations

Fast broadcasting and gossiping in radio networks
FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer Science

We establish an O(n log/sup 2/n) upper bound on the time for deterministic distributed broadcasting in multi-hop radio networks with unknown topology. This nearly matches the known lower bound of /spl Omega/(n log n). The fastest previously known ...
Broadcasting in undirected ad hoc radio networks
PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computing

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 ...
Broadcasting in undirected ad hoc radio networks
Special issue: PODC 02

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 ...

Comments

Information & Contributors

Information

Published In

cover image Theoretical Computer Science

Theoretical Computer Science Volume 333, Issue 3

Foundations of software science and computation structures

3 March 2005

123 pages

ISSN:0304-3975

Issue’s Table of Contents

Publisher

Elsevier Science Publishers Ltd.

United Kingdom

Publication History

Published: 03 March 2005

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ellen FGorain BMiller APelc A(2021)Constant-Length Labeling Schemes for Deterministic Radio BroadcastACM Transactions on Parallel Computing10.1145/34706338:3(1-17)Online publication date: 20-Sep-2021
https://dl.acm.org/doi/10.1145/3470633
Ellen FGorain BMiller APelc AScheideler CBerenbrink P(2019)Constant-Length Labeling Schemes for Deterministic Radio BroadcastThe 31st ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3323165.3323194(171-178)Online publication date: 17-Jun-2019
https://dl.acm.org/doi/10.1145/3323165.3323194
Almeida PBaquero CFarach-Colton MJesus PMosteiro M(2017)Fault-tolerant aggregationDistributed Computing10.1007/s00446-016-0288-530:4(281-291)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.1007/s00446-016-0288-5
Farach-Colton MMosteiro M(2015)Initializing Sensor Networks of Non-uniform Density in the Weak Sensor ModelAlgorithmica10.1007/s00453-014-9905-573:1(87-114)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.1007/s00453-014-9905-5
Farach-Colton MFernández Anta AMosteiro M(2013)Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound)Theoretical Computer Science10.1016/j.tcs.2012.11.030472(60-80)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1016/j.tcs.2012.11.030
Prakash RSasson YMohsin MCavin DSchiper A(2011)The impact of mobility on the time complexity for deterministic broadcasting in radio networksInternational Journal of Ad Hoc and Ubiquitous Computing10.1504/IJAHUC.2011.0423518:3(174-188)Online publication date: 1-Sep-2011
https://dl.acm.org/doi/10.1504/IJAHUC.2011.042351
Almeida PBaquero CFarach-Colton MJesus PMosteiro M(2011)Fault-Tolerant aggregationProceedings of the 15th international conference on Principles of Distributed Systems10.1007/978-3-642-25873-2_35(513-527)Online publication date: 13-Dec-2011
https://dl.acm.org/doi/10.1007/978-3-642-25873-2_35
Anta AMilani AMosteiro MZaks S(2010)Opportunistic information dissemination in mobile ad-hoc networksProceedings of the 24th international conference on Distributed computing10.5555/1888781.1888827(374-388)Online publication date: 13-Sep-2010
https://dl.acm.org/doi/10.5555/1888781.1888827
Gilbert SKowalski D(2010)Trusted computing for fault-prone wireless networksProceedings of the 24th international conference on Distributed computing10.5555/1888781.1888826(359-373)Online publication date: 13-Sep-2010
https://dl.acm.org/doi/10.5555/1888781.1888826
Kuhn FLynch NNewport COshman RRicha ARicha AGuerraoui R(2010)Broadcasting in unreliable radio networksProceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing10.1145/1835698.1835779(336-345)Online publication date: 25-Jul-2010
https://dl.acm.org/doi/10.1145/1835698.1835779
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents