Fast Broadcasting and Gossiping in Radio Networks (2000)
by
Marek Chrobak
,
Leszek Gasieniec
,
Wojciech Rytter
| Citations: | 66 - 6 self |
BibTeX
@MISC{Chrobak00fastbroadcasting,
author = {Marek Chrobak and Leszek Gasieniec and Wojciech Rytter},
title = {Fast Broadcasting and Gossiping in Radio Networks},
year = {2000}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We establish an O(n log² n) upper bound on the time for deterministic distributed broadcasting in multi-hop radio networks with unknown topology. This nearly matches the known lower bound of n log n). The fastest previously known algorithm for this problem works in time O(n 3=2 ). Using our broadcasting algorithm, we develop an O(n 3=2 log 2 n) algorithm for gossiping in the same network model.
