On Randomized Broadcasting and Gossiping in Radio Networks

Authors:
Ding Liu;Manoj Prabhakaran
Affiliations:
-;-
Venue:
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Year:
2002

Citing 15
Cited 21

A lower bound for radio broadcast

Journal of Computer and System Sciences
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
Computation in noisy radio networks

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Deterministic broadcasting in unknown radio networks

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Selective families, superimposed codes, and broadcasting on unknown radio networks

SODA '01 Proceedings of the twelfth 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 Radio Broadcasting

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A Randomized Algorithm for Gossiping in Radio Networks

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
The Impact of Knowledge on Broadcasting Time in Radio Networks

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Fast broadcasting and gossiping in radio networks

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Lower bounds for the broadcast problem in mobile 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
Probabilistic computations: Toward a unified measure of complexity

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science

Faster communication in known topology radio networks

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
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
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Robust Computation of Aggregates in Wireless Sensor Networks: Distributed Randomized Algorithms and Analysis

IEEE Transactions on Parallel and Distributed Systems
Broadcasting algorithms in radio networks with unknown topology

Journal of Algorithms
Optimal Initialization and Gossiping Algorithms for Random Radio Networks

IEEE Transactions on Parallel and Distributed Systems
Deterministic M2M multicast in 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
Time efficient centralized gossiping in radio networks

Theoretical Computer Science
Energy efficient randomised communication in unknown AdHoc networks

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
Minimum-latency gossiping in multi-hop wireless mesh networks

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
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
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
Deterministic recurrent communication in restricted Sensor Networks

Theoretical Computer Science
On efficient gossiping in radio networks

SIROCCO'09 Proceedings of the 16th 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
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound)

Theoretical Computer Science
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
Information dissemination in unknown radio networks with large labels

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper has two parts. In the first part we give an alternative (and much simpler) proof for the best known lower bound of 驴(Dlog (N/D)) time-steps for randomized broadcasting in radio networks with unknown topology. In the second part we give an O(N log3N)- time randomized algorithm for gossiping in such radio networks. This is an improvement over the fastest previously known algorithm that works in time O(N log4 N).