Faster communication in known topology radio networks

Leszek Gasieniec, David Peleg, Qin Xin

Research output: Contribution to conferencePaperpeer-review

81 Scopus citations


This paper concerns the communication primitives of broad-casting (one-to-all communication) and gossiping (all-to-all communication) in radio networks with known topology, i.e., where for each primitive the schedule of transmissions is precomputed 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 general graphs. In particular, it proposes a new (efficiently computable) deterministic schedule that uses O(D + Δ log n) time units to complete the gossiping task in any radio network with size n, diameter D and max-degree A. Our new schedule improves and simplifies the currently best known gossiping schedule, requiring time O(D + i+2√DΔ logi+1 n), for any network with the diameter D = Ω(logi+4n), where i is an arbitrary integer constant i ≥ 0, see [17]. 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 [12]. 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 currently best known D + O(log3 n) time schedule proposed by Elkin and Kortsarz in [12]. Our new algorithm should be also seen as the separation result between the planar and the general graphs with a small diameter due to the polylogarithmic inapproximability result in general graphs due to Elkin and Kortsarz, see [11].

Original languageEnglish
Number of pages9
StatePublished - 2005
Externally publishedYes
Event24th Annual ACM Symposium on Principles of Distributed Computing, PODC 2005 - Las Vegas, NV, United States
Duration: 17 Jul 200520 Jul 2005


Conference24th Annual ACM Symposium on Principles of Distributed Computing, PODC 2005
Country/TerritoryUnited States
CityLas Vegas, NV


  • Algorithms
  • Broadcasting
  • Gossiping
  • Planar graphs
  • Radio networks


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

Cite this