article

An improved algorithm for radio broadcast

Authors:

Guy KortsarzAuthors Info & Claims

ACM Transactions on Algorithms (TALG), Volume 3, Issue 1

Article No.: 8, Pages 1 - 21

https://doi.org/10.1145/1186810.1186818

Published: 02 February 2007 Publication History

Abstract

We show that for every radio network G = (V, E) and source s ∈ V, there exists a radio broadcast schedule for G of length Rad(G, s) + O(√Rad(G, s) ⋅log² n) = O(Rad(G, s) + log⁴ n), where Rad(G, s) is the radius of the radio network G with respect to the source s. This result improves the previously best-known upper bound of O(Rad(G, s) + log⁵ n) due to Gaber and Mansour [1995].

For graphs with small genus, particularly for planar graphs, we provide an even better upper bound of Rad(G, S) + O(√Rad(G,s) ⋅ log n + log³ n) = O(Rad(G, s) + log³ n).

References

[1]

Alon, N., Bar-Noy, A., Linial, N., and Peleg, D. 1991. A lower bound for radio broadcast. J. Comput. Syst. Sci. 43, 290--298.

Digital Library

[2]

Awerbuch, B., Berger, B., Cowen, L., and Peleg, D. 1992. Fast network decomposition. In Proceedings of the 11th ACM Symposium on Principles of Distributed Computing. 161--173.

Digital Library

[3]

Bar-Yehuda, R., Goldreich, O., and Itai, A. 1991. Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection. Distrib. Comput. 2, 5, 67--72.

Digital Library

[4]

Bar-Yehuda, R., Goldreich, O., and Itai, A. 1992. On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. J. Comput. Syst. Sci. 1, 45, 104--126.

Digital Library

[5]

Chlamtac, I., and Kutten, S. 1985. A spatial-reuse TDMA/FDMA for mobile multihop radio networks. In Proceedings of the IEEE INFOCOM Conference. 389--394.

[6]

Chlamtac, I., and Weinstein. 1987. The wave expansion approach to broadcasting in multihop radio networks. In Proceedings of the IEEE INFOCOM Conference. 874--881.

[7]

Chlebus, B., Gasieniec, L., Gibbons, A., Pelc, A., and Rytter, W. 2002. Deterministic broadcasting in ad hoc radio networks. Distrib. Comput. 1, 15, 27--38.

Digital Library

[8]

Chrobak, M., Gasieniec, L., and Rytter, W. 2000. Fast broadcasting and gossiping in radio networks. In Proceedings of the 41st Symposium on Foundations of Computer Science. 575--581.

Digital Library

[9]

Clementi, A. F., Monti, A., and Silvestri, R. 2003. Distributed broadcast in radio networks of unknown topology. Theor. Comput. Sci. 3, 302, 337--364.

Digital Library

[10]

Czumaj, A., and Rytter, W. 2003. Broadcasting algorithms in radio networks with unknown topology. In Proceedings of the 44th Symposium on Foundations of Computer Science. 492--501.

Digital Library

[11]

Elkin, M., and Kortsarz, G. 2004. Polylogarithmic additive inapproximability of the radio broadcast problem. SIAM J. Discrete Mod. 19, 4, 881--899.

Digital Library

[12]

Gaber, I., and Mansour, Y. 1995. Broadcast in radio networks. In Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms. 577--585.

Digital Library

[13]

Indyk, P. 2002. Explicit constructions of selectors and related combinatorial structures, with applications. In Proceedings of the 15th Symposium on Discrete Algorithms. 697--704.

Digital Library

[14]

Kowalski, D., and Pelc, A. 2002. Deterministic broadcasting time in radio networks of unknown topology. In Proceedings of the 43th Symposium on Foundations of Computer Science. 63--72.

Digital Library

[15]

Kowalski, D., and Pelc, A. 2003. Broadcasting in undirected ad hoc radio networks. In Proceedings of the 16th ACM Symposium on Principles of Distributed Computing. 73--82.

Digital Library

[16]

Kowalski, D., and Pelc, A. 2004. Centralized deterministic broadcasting in undirected multi-hop radio network. In Approximation, Randomization, and Combinatorial Optimization. Springer-Verlag. 171--182.

[17]

Kushilevitz, E., and Mansour, Y. 1998. An ω(d log(n/d)) lower bound for broadcast in radio networks. SIAM J. Comput. 27, 3, 702--712.

Digital Library

[18]

Linial, N., and Saks, M. 1991. Decomposing graphs into regions of small diameter. In Proceedings of the 2nd ACM-SIAM Symposium on Discrete Algorithms. 320--330.

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
Miller APelc AYadav RScheideler CSpear M(2020)Deterministic Leader Election in Anonymous Radio NetworksProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3350755.3400276(407-417)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1145/3350755.3400276
Ellen FGilbert SScheideler CSpear M(2020)Constant-Length Labelling Schemes for Faster Deterministic Radio BroadcastProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3350755.3400238(213-222)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1145/3350755.3400238
Show More Cited By

Index Terms

An improved algorithm for radio broadcast
1. Mathematics of computing
  1. Discrete mathematics
    1. Combinatorics
      1. Combinatorial algorithms
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Improved schedule for radio broadcast
SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms

We show that for every radio network G = (V, E) and source s ε V, there exists a radio broadcast schedule for G of length Rad(G, s) + O(√ Rad(G, s). log² n) = O(Rad(G, s) + log⁴ n), where Rad(G, s) is the radius of the radio network G with respect to ...
A Faster Distributed Radio Broadcast Primitive: Extended Abstract
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing

We present a faster distributed broadcasting primitive for the classical radio network model.

The most basic distributed radio network broadcasting primitive - called Decay - dates back to a PODC'87 result of Bar-Yehuda, Goldreich, and Itai. In any ...
Randomized broadcast in radio networks with collision detection
PODC '13: Proceedings of the 2013 ACM symposium on Principles of distributed computing

We present a randomized distributed algorithm that in radio networks with collision detection broadcasts a single message in O(D + log⁶ n) rounds, with high probability. This time complexity is most interesting because of its optimal additive dependence ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Algorithms

ACM Transactions on Algorithms Volume 3, Issue 1

February 2007

178 pages

ISSN:1549-6325

EISSN:1549-6333

DOI:10.1145/1186810

Issue’s Table of Contents

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 February 2007

Published in TALG Volume 3, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tag

Radio broadcast

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
524
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)1

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
Miller APelc AYadav RScheideler CSpear M(2020)Deterministic Leader Election in Anonymous Radio NetworksProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3350755.3400276(407-417)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1145/3350755.3400276
Ellen FGilbert SScheideler CSpear M(2020)Constant-Length Labelling Schemes for Faster Deterministic Radio BroadcastProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3350755.3400238(213-222)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1145/3350755.3400238
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
GalăýÍk FGąsieniec LLingas A(2013)Efficient broadcasting in radio networks with long-range interferenceDistributed Computing10.1007/s00446-012-0176-626:1(59-74)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1007/s00446-012-0176-6
Czumaj AElsässer RGąsieniec LSauerwald TWang X(2013)Fast message dissemination in random geometric networksDistributed Computing10.1007/s00446-011-0154-426:1(1-24)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1007/s00446-011-0154-4
Chlebus BKowalski DRadzik T(2009)Many-to-Many Communication in Radio NetworksAlgorithmica10.1007/s00453-007-9123-554:1(118-139)Online publication date: 13-Apr-2009
https://dl.acm.org/doi/10.1007/s00453-007-9123-5
Gąsieniec L(2009)On efficient gossiping in radio networksProceedings of the 16th international conference on Structural Information and Communication Complexity10.1007/978-3-642-11476-2_2(2-14)Online publication date: 25-May-2009
https://dl.acm.org/doi/10.1007/978-3-642-11476-2_2
Elsässer RGąsieniec LSauerwald T(2008)On Radio Broadcasting in Random Geometric GraphsProceedings of the 22nd international symposium on Distributed Computing10.1007/978-3-540-87779-0_15(212-226)Online publication date: 22-Sep-2008
https://dl.acm.org/doi/10.1007/978-3-540-87779-0_15

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 Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents