@inproceedings{9a73d10e28644cca84253ae404165750,
title = "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).",
author = "Ding Liu and Manoj Prabhakaran",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 8th Annual International Conference on Computing and Combinatorics, COCOON 2002 ; Conference date: 15-08-2002 Through 17-08-2002",
year = "2002",
doi = "10.1007/3-540-45655-4\_37",
language = "English (US)",
isbn = "354043996X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "340--349",
editor = "Ibarra, \{Oscar H.\} and Louxin Zhang",
booktitle = "Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings",
address = "Germany",
}