Subscribe

Redondo Beach, California

Nov. 12, 2000 to Nov. 14, 2000

ISBN: 0-7695-0850-2

pp: 575

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

ABSTRACT

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*, 2000, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 2000, pp. 575, doi:10.1109/SFCS.2000.892325