Sciweavers

Share
INFOCOM
2009
IEEE

Minimum-Latency Beaconing Schedule in Multihop Wireless Networks

10 years 9 months ago
Minimum-Latency Beaconing Schedule in Multihop Wireless Networks
— 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 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.
Peng-Jun Wan, Xiao-Hua Xu, Lixin Wang, Xiaohua Jia
Added 24 May 2010
Updated 24 May 2010
Type Conference
Year 2009
Where INFOCOM
Authors Peng-Jun Wan, Xiao-Hua Xu, Lixin Wang, Xiaohua Jia, E. K. Park
Comments (0)
books