Broadcasting algorithms in radio networks with unknown topology

In this paper we present new randomized and deterministic algorithms for the classical problem of broadcasting in radio networks with unknown topology. We consider directed n-node radio networks with specified eccentricity D (maximum distance from the source node to any other node). Bar-Yehuda et al. presented an algorithm that for any n-node radio network with eccentricity D completes the broadcasting in time, with high probability. This result is almost optimal, since as it has been shown by Kushilevitz and Mansour and Alon et al., every randomized algorithm requires Ω(Dlog(n/D)+log²n) expected time to complete broadcasting.Our first main result closes the gap between the lower and upper bound: we describe an optimal randomized broadcasting algorithm whose running time complexity is , with high probability. In particular, we obtain a randomized algorithm that completes broadcasting in any n-node radio network in time , with high probability.The main source of our improvement is a better “selecting sequence” used by the algorithm that brings some stronger property and improves the broadcasting time. Two types of “selecting sequences” are considered: randomized and deterministic ones. The algorithm with a randomized sequence is easier (more intuitive) to analyze but both randomized and deterministic sequences give algorithms of the same asymptotic complexity.Next, we demonstrate how to apply our approach to deterministic broadcasting, and describe a deterministic oblivious algorithm that completes broadcasting in time , which improves upon best known algorithms in this case. The fastest previously known algorithm had the broadcasting time of , it was non-oblivious and significantly more complicated; our algorithm can be seen as a natural extension of our randomized algorithm. In this part of the paper we assume that each node knows the eccentricity D.Finally, we show how our randomized broadcasting algorithm can be used to improve the randomized complexity of the gossiping problem.