Title :
Fast broadcasting and gossiping in radio networks
Author :
Chrobak, Marek ; Gasieniec, Leszek ; Rytter, Wojciech
Author_Institution :
Dept. of Comput. Sci., California Univ., Riverside, CA, USA
Abstract :
We establish an O(n log2n) 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(n3/2). Using our broadcasting algorithm, we develop an O(n3/2log2n) algorithm for gossiping in the same network model
Keywords :
communication complexity; deterministic algorithms; network topology; radio broadcasting; radio networks; deterministic distributed broadcasting; fast broadcasting algorithm; gossiping; lower bound; multi-hop radio networks; network topology; time complexity; upper bound; Communication networks; Computer science; Intelligent networks; Network topology; Radio broadcasting; Radio network; Radio networks; Radio transmitters; Spread spectrum communication; Upper bound;
Conference_Titel :
Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on
Conference_Location :
Redondo Beach, CA
Print_ISBN :
0-7695-0850-2
DOI :
10.1109/SFCS.2000.892325
