We establish an O(n log2 n) upper bound on the time for determineistic 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 tome O(n3/2). Using our broadcasting algorithm, we develop an O(n3/2 log2 n) algorithm for gossiping in the same network model.
ASJC Scopus subject areas
- Control and Optimization
- Computational Mathematics
- Computational Theory and Mathematics