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

https://doi.org/10.1016/j.jda.2006.03.022Get rights and content
Under an Elsevier user license
open archive

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.

MSC

94A40
68M10
68Q22
68Q25

Keywords

Wireless broadcast
Communication complexity
Radio networks

Cited by (0)