Time Efficient Radio Broadcasting in Planar Graphs

Abstract-- We study the communication primitive of broadcasting (one-to-all communication) in known topology radio networks, 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. We show that radio broadcasting can be completed in D + O(log n) time units in planar graphs of size n, and with diameter D. This improves the currently best known D +O(log3 n) time schedule proposed by Elkin and Kortsarz in [16] [SODA'05], and 3D time schedule due to G asieniec, Peleg and Xin in [23] [PODC'05]. In this paper, we also explore broadcasting in radio networks in the presence of edge failures.

• Type: Journal
• Year: 2008
• Where: JNW
• Authors: Fredrik Manne, Qin Xin
• Keywords: Broadcasting, JNW 2008, Time Schedule, Topology Radio Networks