Improved schedule for radio broadcast

Authors:
Michael Elkin;Guy Kortsarz
Affiliations:
Ben-Gurion University of the Negev, Beer-Sheva, Israel;Rutgers University, Camden, NY
Venue:
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2005

Citing 14
Cited 25

A lower bound for radio broadcast

Journal of Computer and System Sciences
Decomposing graphs into regions of small diameter

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Fast network decomposition

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization

Journal of Computer and System Sciences
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks

SIAM Journal on Computing
Broadcast in radio networks

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Explicit constructions of selectors and related combinatorial structures, with applications

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Deterministic Broadcasting Time in Radio Networks of Unknown Topology

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Fast broadcasting and gossiping in radio networks

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
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
Broadcasting Algorithms in Radio Networks with Unknown Topology

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Deterministic broadcasting in ad hoc radio networks

Distributed Computing
Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection

Distributed Computing

Radio communication in random graphs

Journal of Computer and System Sciences - Special issue on network algorithms 2005
Deterministic M2M multicast in radio networks

Theoretical Computer Science
Broadcasting in geometric radio networks

Journal of Discrete Algorithms
Broadcasting in udg radio networks with unknown topology

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Time efficient centralized gossiping in radio networks

Theoretical Computer Science
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
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
Note: A note on the lower bound of centralized radio broadcasting for planar reachability graphs

Discrete Applied Mathematics
Optimal deterministic broadcasting in known topology radio networks

Distributed Computing
Efficient broadcasting in known topology radio networks with long-range interference

Proceedings of the 28th ACM symposium on Principles of distributed computing
Fast radio broadcasting with advice

Theoretical Computer Science
Time-efficient broadcasting in radio networks: a review

ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Latency-optimal communication in wireless mesh networks

APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Efficient k-shot broadcasting in radio networks

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Minimum-latency gossiping in multi-hop wireless mesh networks

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Improved lower bound for deterministic broadcasting in radio networks

Theoretical Computer Science
Optimal gossiping with unit size messages in known topology radio networks

CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Waking up anonymous ad hoc radio networks

DISC'05 Proceedings of the 19th international conference on Distributed Computing
Faster centralized communication in radio networks

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Almost optimal distributed M2M multicasting in wireless mesh networks

Theoretical Computer Science
Energy and time efficient broadcasting in known topology radio networks

DISC'07 Proceedings of the 21st international conference on Distributed Computing
Information dissemination in unknown radio networks with large labels

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

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). log2 n) = O(Rad(G, s) + log4 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)+log5 n) due to Gaber and Mansour [12].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 + log3 n) = O(Rad(G, s) + log3 n).