This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
41st Annual Symposium on Foundations of Computer Science
Fast broadcasting and gossiping in radio networks
Redondo Beach, California
November 12-November 14
ISBN: 0-7695-0850-2
M. Chrobak, Dept. of Comput. Sci., California Univ., Riverside, CA, USA
L. Gasieniec, Dept. of Comput. Sci., California Univ., Riverside, CA, USA
W. Rytter, Dept. of Comput. Sci., California Univ., Riverside, CA, USA
We establish an O(n log/sup 2/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 /spl Omega/(n log n). The fastest previously known algorithm for this problem works in time O(n/sup 3/2/). Using our broadcasting algorithm, we develop an O(n/sup 3/2/log/sup 2/n) algorithm for gossiping in the same network model.
Index Terms:
radio networks; radio broadcasting; network topology; communication complexity; deterministic algorithms; fast broadcasting algorithm; gossiping; multi-hop radio networks; upper bound; time complexity; deterministic distributed broadcasting; network topology; lower bound
Citation:
M. Chrobak, L. Gasieniec, W. Rytter, "Fast broadcasting and gossiping in radio networks," focs, pp.575, 41st Annual Symposium on Foundations of Computer Science, 2000
Usage of this product signifies your acceptance of the Terms of Use.