We present a randomized distributed algorithm that in radio networks with collision detection broadcasts a single message in O(D +log 2 n) time slots, with high probability 1 . In view of the lower-bound Ω(D + log 2 n), our algorithm is optimal in the considered model answering the decades-old question of Alon, Bar-Noy, Linial and Peleg in [2] .
(In fact, a most recent result suggests an O(D + log 2 n) algorithm REF .)
An Optimal Randomized Broadcasting Algorithm in Radio Networks with Collision Detection
ArXiv
ArXiv
Computer Science