Faster communication in known topology radio networks

Leszek Ga̧sieniec, David Peleg, Qin Xin

Research output: Contribution to journalArticlepeer-review

39 Scopus citations


This paper concerns the communication primitives of broadcasting (one-to-all communication) and gossiping (all-to-all communication) in known topology radio networks, i.e., where for each primitive the schedule of transmissions is precomputed in advance based on full knowledge about the size and the topology of the network. The first part of the paper examines the two communication primitives in arbitrary graphs. In particular, for the broadcast task we deliver two new results: a deterministic efficient algorithm for computing a radio schedule of length D + O(log3 n), and a randomized algorithm for computing a radio schedule of length D + O(log2 n). These results improve on the best currently known D + O(log4 n) time schedule due to Elkin and Kortsarz (Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 222-231, 2005). Later we propose a new (efficiently computable) deterministic schedule that uses 2D + Δlog n + O(log 3 n) time units to complete the gossiping task in any radio network with size n, diameter D and max-degree Δ. Our new schedule improves and simplifies the currently best known gossiping schedule, requiring time O(D+ i+2√DΔlogi+1n), for any network with the diameter D = Ω(log i+4 n), where i is an arbitrary integer constant i > 0, see Ga̧sieniec et al. (Proceedings of the 11th International Colloquium on Structural Information and Communication Complexity, vol. 3104, pp. 173-184, 2004). The second part of the paper focuses on radio communication in planar graphs, devising a new broadcasting schedule using fewer than 3D time slots. This result improves, for small values of D, on the currently best known D + O(log3 n) time schedule proposed by Elkin and Kortsarz (Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 222-231, 2005). Our new algorithm should be also seen as a separation result between planar and general graphs with small diameter due to the polylogarithmic inapproximability result for general graphs by Elkin and Kortsarz (Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, vol. 3122, pp. 105-116, 2004; J. Algorithms 52(1), 8-25, 2004).

Original languageEnglish (US)
Pages (from-to)289-300
Number of pages12
JournalDistributed Computing
Issue number4
StatePublished - Mar 2007
Externally publishedYes


  • Broadcasting
  • Gossiping
  • Radio networks

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computational Theory and Mathematics


Dive into the research topics of 'Faster communication in known topology radio networks'. Together they form a unique fingerprint.

Cite this