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

Authors:
Tomasz Tyrakowski;Zbigniew Palka
Affiliations:
Department of Mathematics and Computer Science, Adam Mickiewicz University, Umultowska 87, 61-614 Poznań, Poland;Department of Mathematics and Computer Science, Adam Mickiewicz University, Umultowska 87, 61-614 Poznań, Poland
Venue:
Journal of Discrete Algorithms
Year:
2007

Citing 16
Cited 1

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
Error Control and Energy Consumption in Communications for Nomadic Computing

IEEE Transactions on Computers - Special issue on mobile computing
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks

SIAM Journal on Computing
A performance comparison of multi-hop wireless ad hoc network routing protocols

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Selective families, superimposed codes, and broadcasting on unknown radio networks

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Flooding for reliable multicast in multi-hop ad hoc networks

Wireless Networks
Comparison of broadcasting techniques for mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Fast broadcasting and gossiping in radio networks

Journal of Algorithms
Deterministic Broadcasting Time in Radio Networks of Unknown Topology

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
The Impact of Knowledge on Broadcasting Time in Radio Networks

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Energy-Efficient Adaptive Wireless Network Design

ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
Energy-conserving protocols for wireless data networks

Energy-conserving protocols for wireless data networks
Deterministic broadcasting in ad hoc radio networks

Distributed Computing
Faster Deterministic Broadcasting in Ad Hoc Radio Networks

SIAM Journal on Discrete Mathematics
Lower bounds for the broadcast problem in mobile radio networks

Distributed Computing

Silence-based communication

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

The algorithm by Bar-Yehuda, Goldreich and Itai is one of the best known randomized broadcast algorithms for radio networks. Its probability of success and time complexity are nearly optimal. We propose a modification of this algorithm, which decreases the communication complexity, preserving other properties. Moreover, we show that the local communication complexity of the modified algorithm is deterministic.