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

Authors:
Eyal Kushilevitz;Yishay Mansour
Affiliations:
-;-
Venue:
SIAM Journal on Computing
Year:
1998

Citing 0
Cited 97

A mobility-transparent deterministic broadcast mechanism for ad hoc networks

IEEE/ACM Transactions on Networking (TON)
Oblivious gossiping in ad-hoc radio networks

DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
The do-all problem in broadcast networks

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Broadcasting in radio networks

Handbook of wireless networks and mobile computing
Fast broadcasting and gossiping in radio networks

Journal of Algorithms
On adaptive deterministic gossiping in ad hoc radio networks

Information Processing Letters
The impact of information on broadcasting time in linear radio networks

Theoretical Computer Science
Gossiping with Bounded Size Messages in ad hoc Radio Networks

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Deterministic Radio Broadcasting

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Faster Deterministic Broadcasting in Ad Hoc Radio Networks

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A Randomized Algorithm for Gossiping in Radio Networks

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
On Randomized Broadcasting and Gossiping in Radio Networks

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Deterministic Communication in Radio Networks with Large Labels

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Centralized broadcast in multihop radio networks

Journal of Algorithms
Distributed broadcast in radio networks of unknown topology

Theoretical Computer Science
Broadcasting in undirected ad hoc radio networks

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Deterministic broadcasting in ad hoc radio networks

Distributed Computing
The wake-up problem in multi-hop radio networks

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Tight bounds for FEC-based reliable multicast

Information and Computation
A better wake-up in radio networks

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
What cannot be computed locally!

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Initializing newly deployed ad hoc and sensor networks

Proceedings of the 10th annual international conference on Mobile computing and networking
Improved schedule for radio broadcast

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Maximal independent sets in radio networks

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
On selection problem in radio networks

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A mobility-management mechanism for broadcasting in unknown mobile ad hoc networks

PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Combination can be hard: approximability of the unique coverage problem

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Fast distributed algorithm for convergecast in ad hoc geometric radio networks

Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Deterministic Broadcast and Gossiping Algorithms for Ad hoc Networks

The Journal of Supercomputing
Broadcasting in undirected ad hoc radio networks

Distributed Computing - Special issue: PODC 02
Adversarial queuing on the multiple-access channel

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Broadcasting algorithms in radio networks with unknown topology

Journal of Algorithms
An improved algorithm for radio broadcast

ACM Transactions on Algorithms (TALG)
Optimal Initialization and Gossiping Algorithms for Random Radio Networks

IEEE Transactions on Parallel and Distributed Systems
Toward Broadcast Reliability in Mobile Ad Hoc Networks with Double Coverage

IEEE Transactions on Mobile Computing
Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism

Theoretical Computer Science - Foundations of software science and computation structures
Broadcasting in geometric radio networks

Journal of Discrete Algorithms
Quasi-optimal energy-efficient leader election algorithms in radio networks

Information and Computation
On the communication complexity of Bar-Yehuda, Goldreich and Itai's randomized broadcasting algorithm

Journal of Discrete Algorithms
Acknowledged broadcasting and gossiping in ad hoc radio networks

Theoretical Computer Science
Energy efficient randomised communication in unknown AdHoc networks

Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Broadcasting in udg radio networks with unknown topology

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Communication in dynamic radio networks

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Centralized asynchronous broadcast in radio networks

Theoretical Computer Science
Time efficient centralized gossiping in radio networks

Theoretical Computer Science
Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks

Journal of Parallel and Distributed Computing
On the effect of the deployment setting on broadcasting in Euclidean radio networks

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Fast Radio Broadcasting with Advice

SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Broadcasting in UDG Radio Networks with Missing and Inaccurate Information

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Acknowledged broadcasting in ad hoc radio networks

Information Processing Letters
Impact of Information on the Complexity of Asynchronous Radio Broadcasting

OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Broadcasting in dynamic radio networks

Journal of Computer and System Sciences
Energy efficient randomised communication in unknown AdHoc networks

Theoretical Computer Science
Optimal deterministic broadcasting in known topology radio networks

Distributed Computing
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Fast radio broadcasting with advice

Theoretical Computer Science
Sensor network gossiping or how to break the broadcast lower bound

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Deterministic communication in the weak sensor model

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Time-efficient broadcasting in radio networks: a review

ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Efficient k-shot broadcasting in radio networks

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Consensus and mutual exclusion in a multiple access channel

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Broadcasting in unreliable radio networks

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Analysis and design of a novel randomized broadcast algorithm for scalable wireless networks in the interference channels

IEEE Transactions on Wireless Communications
Contention resolution in multiple-access channels: k-selection in radio networks

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony

DISC'10 Proceedings of the 24th international conference on Distributed computing
Deterministic recurrent communication and synchronization in restricted sensor networks

ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Improved lower bound for deterministic broadcasting in radio networks

Theoretical Computer Science
Time-efficient randomized multiple-message broadcast in radio networks

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Interference-aware broadcast scheduling in wireless networks

Ad Hoc Networks
Time-optimal information exchange on multiple channels

FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Adversarial Queuing on the Multiple Access Channel

ACM Transactions on Algorithms (TALG)
Unbounded contention resolution in multiple-access channels

DISC'11 Proceedings of the 25th international conference on Distributed computing
Leveraging channel diversity to gain efficiency and robustness for wireless broadcast

DISC'11 Proceedings of the 25th international conference on Distributed computing
On many-to-many communication in packet radio networks

OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Low-Latency broadcast scheduling in ad hoc networks

WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Broadcast and gossiping algorithms for mobile ad hoc networks based on breadth-first traversal

IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Deterministic recurrent communication in restricted Sensor Networks

Theoretical Computer Science
Distributed k-clustering algorithms for random wireless multihop networks

ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
Almost optimal explicit selectors

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Waking up anonymous ad hoc radio networks

DISC'05 Proceedings of the 19th international conference on Distributed Computing
On efficient gossiping in radio networks

SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Lower bounds for clear transmissions in radio networks

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Opportunistic information dissemination in mobile ad-hoc networks: adaptiveness vs. obliviousness and randomization vs. determinism

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Performance analysis of broadcast in mobile ad hoc networks with synchronized and non-synchronized reception

Computer Communications
Deterministic multi-channel information exchange

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Dynamic contention resolution in multiple-access channels

WWIC'12 Proceedings of the 10th international conference on Wired/Wireless Internet Communication
Distributed multiple-message broadcast in wireless ad-hoc networks under the SINR model

SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Initializing sensor networks of non-uniform density in the weak sensor model

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Distributed backbone structure for algorithms in the SINR model of wireless networks

DISC'12 Proceedings of the 26th international conference on Distributed Computing
Efficient symmetry breaking in multi-channel radio networks

DISC'12 Proceedings of the 26th international conference on Distributed Computing
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound)

Theoretical Computer Science
The cost of radio network broadcast for different models of unreliable links

Proceedings of the 2013 ACM symposium on Principles of distributed computing
Brief announcement: a shorter and stronger proof of an Ω(d log(n/d)) lower bound for broadcast in radio networks

Proceedings of the 2013 ACM symposium on Principles of distributed computing
Efficient algorithms for neighbor discovery in wireless networks

IEEE/ACM Transactions on Networking (TON)
Distributed deterministic broadcasting in uniform-power ad hoc wireless networks

FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.01

Visualization

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.