article

An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks

Authors:

Eyal Kushilevitz,

Yishay MansourAuthors Info & Claims

SIAM Journal on Computing, Volume 27, Issue 3

Pages 702 - 712

https://doi.org/10.1137/S0097539794279109

Published: 01 June 1998 Publication History

Publisher Site

Abstract

We show that for any randomized broadcast protocol for radio networks, there exists a network in which the expected time to broadcast a message is $\Omega(D\log (N/D))$, where D is the diameter of the network and N is the number of nodes. This implies a tight lower bound of $\Omega(D\log N)$ for any $D \le N^{1-\varepsilon}$, where $\varepsilon > 0$ is any constant.

Cited By

View all

Chang YDuan RJiang S(2023)Near-Optimal Time–Energy Tradeoffs for Deterministic Leader ElectionACM Transactions on Algorithms10.1145/361442919:4(1-23)Online publication date: 26-Sep-2023
https://dl.acm.org/doi/10.1145/3614429
Davies POshman RNolin AHalldorsson MBalliu A(2023)Uniting General-Graph and Geometric-Based Radio Networks via Independence Number ParametrizationProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594595(290-299)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594595
Kowalski DMosteiro MZaki K(2023)Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance ModelTheory of Computing Systems10.1007/s00224-023-10131-167:4(825-854)Online publication date: 10-Jul-2023
https://dl.acm.org/doi/10.1007/s00224-023-10131-1
Show More Cited By

Index Terms

An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks

Recommendations

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 ...
Randomized broadcast in radio networks with collision detection

We present a randomized distributed algorithm that in radio networks with collision detection broadcasts a single message in $$O(D + \log ^6 n)$$O(D+log6n) rounds, with high probability. This time complexity is most interesting because of its optimal ...
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 ...

Comments

Information & Contributors

Information

Published In

SIAM Journal on Computing Volume 27, Issue 3

June 1998

311 pages

ISSN:0097-5397

Editor:
Mihalis Yannakakis
Bell Labs

Issue’s Table of Contents

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 June 1998

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

136
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chang YDuan RJiang S(2023)Near-Optimal Time–Energy Tradeoffs for Deterministic Leader ElectionACM Transactions on Algorithms10.1145/361442919:4(1-23)Online publication date: 26-Sep-2023
https://dl.acm.org/doi/10.1145/3614429
Davies POshman RNolin AHalldorsson MBalliu A(2023)Uniting General-Graph and Geometric-Based Radio Networks via Independence Number ParametrizationProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594595(290-299)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594595
Kowalski DMosteiro MZaki K(2023)Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance ModelTheory of Computing Systems10.1007/s00224-023-10131-167:4(825-854)Online publication date: 10-Jul-2023
https://dl.acm.org/doi/10.1007/s00224-023-10131-1
Miller APelc AYadav R(2022)Deterministic Leader Election in Anonymous Radio NetworksACM Transactions on Algorithms10.1145/352717118:3(1-33)Online publication date: 11-Oct-2022
https://dl.acm.org/doi/10.1145/3527171
Neely M(2022)Repeated Games, Optimal Channel Capture, and Open Problems for Slotted Multiple Access2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton)10.1109/Allerton49937.2022.9929420(1-8)Online publication date: 27-Sep-2022
https://dl.acm.org/doi/10.1109/Allerton49937.2022.9929420
Chlebus BKowalski DVaya S(2022)Distributed bare-bones communication in wireless networksDistributed Computing10.1007/s00446-021-00413-735:1(59-80)Online publication date: 1-Feb-2022
https://dl.acm.org/doi/10.1007/s00446-021-00413-7
Nanahji K(2022)Exactly Optimal Deterministic Radio Broadcasting with Collision DetectionStructural Information and Communication Complexity10.1007/978-3-031-09993-9_13(234-252)Online publication date: 27-Jun-2022
https://dl.acm.org/doi/10.1007/978-3-031-09993-9_13
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
Halldórsson MTonoyan T(2021)Sparse Backbone and Optimal Distributed SINR AlgorithmsACM Transactions on Algorithms10.1145/345293717:2(1-34)Online publication date: 6-Jun-2021
https://dl.acm.org/doi/10.1145/3452937
Czumaj ADavies P(2021)Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio NetworksJournal of the ACM10.1145/344638368:2(1-22)Online publication date: 28-Jan-2021
https://dl.acm.org/doi/10.1145/3446383
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Randomized broadcast in radio networks with collision detection

Randomized broadcast in radio networks with collision detection

A Faster Distributed Radio Broadcast Primitive: Extended Abstract

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations