Approximate coverage in wireless sensor networks
Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review
Author(s)
Detail(s)
Original language | English |
---|---|
Title of host publication | Proceedings - The IEEE Conference on Local Computer Networks - 30th Anniversary, LCN 2005 |
Pages | 68-75 |
Volume | 2005 |
Publication status | Published - 2005 |
Externally published | Yes |
Publication series
Name | Proceedings - Conference on Local Computer Networks, LCN |
---|---|
Volume | 2005 |
Conference
Title | IEEE Conference on Local Computer Networks - 30th Anniversary, LCN 2005 |
---|---|
Place | Australia |
City | Sydney |
Period | 15 - 17 November 2005 |
Link(s)
Abstract
Recent advances in microelectronic technology have made it possible to construct compact and inexpensive wireless sensors. Sensor networks have received significant attention due to their potential applications from civil to military domains. Since sensors in sensor networks are equipped with energy-limited batteries, energy conservation in such networks is of paramount importance in order to prolong the network lifetime. Sensing coverage and sensor connectivity in sensor networks are two fundamental issues, which have been extensively addressed in the literature, and most existing work on sensing coverage has focused on the (connected) full coverage problem that aims to cover the entire monitored region using the minimum number of sensors. However, in some application scenarios, full coverage is either impossible or unnecessary and a partial coverage with a certain degree guarantee is acceptable. In this paper, we study the connected coverage problem with a given coverage guarantee. We first introduce the partial coverage concept and analyze its properties for the first time in order to prolong the network lifetime. Due to NP-hardness of the concerned problem, we then present a heuristic algorithm which takes into account the partial coverage and sensor connectivity simultaneously. We finally conduct extensive experiments by simulations to evaluate the performance of the proposed algorithm. © 2005 IEEE.
Bibliographic Note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].
Citation Format(s)
Approximate coverage in wireless sensor networks. / Liu, Yuzhen; Liang, Weifa.
Proceedings - The IEEE Conference on Local Computer Networks - 30th Anniversary, LCN 2005. Vol. 2005 2005. p. 68-75 1550842 (Proceedings - Conference on Local Computer Networks, LCN; Vol. 2005).
Proceedings - The IEEE Conference on Local Computer Networks - 30th Anniversary, LCN 2005. Vol. 2005 2005. p. 68-75 1550842 (Proceedings - Conference on Local Computer Networks, LCN; Vol. 2005).
Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review