28
1
v1v2 (latest)

An Optimal Randomized Broadcasting Algorithm in Radio Networks with Collision Detection

Abstract

We present a randomized distributed algorithm that in radio networks with collision detection broadcasts a single message in O(D+log2n)O(D+\log^2 n) time slots, with high probability. In view of the lower-bound Ω(D+log2n)\Omega(D+\log^2 n), our algorithm is optimal in the considered model answering the decades-old question of Alon, Bar-Noy, Linial and Peleg [JCSS 1991].

View on arXiv
Comments on this paper