Minimum-latency beaconing schedule in multihop wireless networks
Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45) › 32_Refereed conference paper (with ISBN/ISSN) › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Title of host publication | Proceedings - IEEE INFOCOM |
| Pages | 2340-2346 |
| Publication status | Published - 2009 |
Publication series
| Name | |
|---|---|
| ISSN (Print) | 0743-166X |
Conference
| Title | 28th Conference on Computer Communications (IEEE INFOCOM 2009) |
|---|---|
| Place | Brazil |
| City | Rio de Janeiro |
| Period | 19 - 25 April 2009 |
Link(s)
Abstract
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. © 2009 IEEE.
Citation Format(s)
Minimum-latency beaconing schedule in multihop wireless networks. / Wan, Peng-Jun; Xu, Xiaohua; Wang, Lixin et al.
Proceedings - IEEE INFOCOM. 2009. p. 2340-2346 5062160.Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45) › 32_Refereed conference paper (with ISBN/ISSN) › peer-review
