On randomized broadcasting and gossiping in radio networks

Abstract

This paper has two parts. In the first part we give an alternative (and much simpler) proof for the best known lower bound of Ω(Dlog (N/D)) time-steps for randomized broadcasting in radio networks with unknown topology. In the second part we give an O(N log3N)-time randomized algorithm for gossiping in such radio networks. This is an improvement over the fastest previously known algorithm that works in time O(N log4 N).