Minimum-Latency Beaconing Schedule in Multihop Wireless Networks

P. Wan, X. Xu, L. Wang, X. Jia, E. K. Park
2009 IEEE INFOCOM 2009 - The 28th Conference on Computer Communications  
Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when the interference radius is equal to the transmission radius. All prior works assume that the interference radius is equal to the transmission radius, and the best-known approximation ratio for MLBS under this special interference model is 7. In this paper, we present a new approximation algorithm called strip coloring for
more » ... strip coloring for MLBS under the general protocol interference model. Its approximation ratio is at most 5 when the interference radius is equal to transmission radius, and is between 3 and 6 in general. All the prior works on MLBS [1], [2], [4], [10], [11], [13], [14], [15], [16] implicitly assumed that ρ = 1. When ρ = 1, the interference topology is the square of a unit-disk graph representing the communication topology. Sen and Huson [13] proved that minimum coloring of a square of a unit-disk graph This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE INFOCOM 2009 proceedings. 978-1-4244-3513-5/09/$25.00 ©2009 IEEE 2340 Authorized licensed use limited to: CityU. Downloaded on July 22, 2009 at 11:55 from IEEE Xplore. Restrictions apply.
doi:10.1109/infcom.2009.5062160 dblp:conf/infocom/WanXWJP09 fatcat:6tupo4rrnrayzmpuuiqooyqepu