Minimum coverage breach and maximum network lifetime in wireless sensor networks

Chen Wang, My T. Thai, Yingshu Li, Feng Wang, Weili Wu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

32 Citations (Scopus)

Abstract

Network lifetime is a critical issue in Wireless Sensor Networks. It is possible to extend network lifetime by organizing the sensors into a number of sensor covers. However, with the limited bandwidth, coverage breach (i.e, targets that are not covered) can occur if the number of available time-slots/channels is less than the number of sensors in a sensor cover. In this paper, we study a joint optimization problem in which the objective is to minimize the coverage breach as well as to maximize the network lifetime. We show a "trade-off" scheme by presenting two strongly related models, which aim to tradeoffs between the two conflicting objectives. The main approach of our models is organizing sensors into non-disjoint sets, which is different from the current most popular approach and can gain longer network lifetime as well as less coverage breach. We proposed two algorithms for the first model based on linear programming and greedy techniques, respectively. Then we transform these algorithms to solve the second model by revealing the strong connection between the models. Through numerical simulation, we showed the good performance of our algorithms and the pictures of the tradeoff scheme in variant scenarios, which coincide with theoretical analysis very well. It is also showed that our algorithms could obtain less breach rate than the one proposed in [2].

Original languageEnglish (US)
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
Pages1118-1123
Number of pages6
DOIs
StatePublished - 2007
Event50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007 - Washington, DC, United States
Duration: Nov 26 2007Nov 30 2007

Other

Other50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007
CountryUnited States
CityWashington, DC
Period11/26/0711/30/07

Fingerprint

Wireless sensor networks
Sensors
Linear programming
Bandwidth
Computer simulation

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Wang, C., Thai, M. T., Li, Y., Wang, F., & Wu, W. (2007). Minimum coverage breach and maximum network lifetime in wireless sensor networks. In GLOBECOM - IEEE Global Telecommunications Conference (pp. 1118-1123). [4411125] https://doi.org/10.1109/GLOCOM.2007.215

Minimum coverage breach and maximum network lifetime in wireless sensor networks. / Wang, Chen; Thai, My T.; Li, Yingshu; Wang, Feng; Wu, Weili.

GLOBECOM - IEEE Global Telecommunications Conference. 2007. p. 1118-1123 4411125.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Wang, C, Thai, MT, Li, Y, Wang, F & Wu, W 2007, Minimum coverage breach and maximum network lifetime in wireless sensor networks. in GLOBECOM - IEEE Global Telecommunications Conference., 4411125, pp. 1118-1123, 50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007, Washington, DC, United States, 11/26/07. https://doi.org/10.1109/GLOCOM.2007.215
Wang C, Thai MT, Li Y, Wang F, Wu W. Minimum coverage breach and maximum network lifetime in wireless sensor networks. In GLOBECOM - IEEE Global Telecommunications Conference. 2007. p. 1118-1123. 4411125 https://doi.org/10.1109/GLOCOM.2007.215
Wang, Chen ; Thai, My T. ; Li, Yingshu ; Wang, Feng ; Wu, Weili. / Minimum coverage breach and maximum network lifetime in wireless sensor networks. GLOBECOM - IEEE Global Telecommunications Conference. 2007. pp. 1118-1123
@inproceedings{802a5fccf3954c2c955fcf51246ca371,
title = "Minimum coverage breach and maximum network lifetime in wireless sensor networks",
abstract = "Network lifetime is a critical issue in Wireless Sensor Networks. It is possible to extend network lifetime by organizing the sensors into a number of sensor covers. However, with the limited bandwidth, coverage breach (i.e, targets that are not covered) can occur if the number of available time-slots/channels is less than the number of sensors in a sensor cover. In this paper, we study a joint optimization problem in which the objective is to minimize the coverage breach as well as to maximize the network lifetime. We show a {"}trade-off{"} scheme by presenting two strongly related models, which aim to tradeoffs between the two conflicting objectives. The main approach of our models is organizing sensors into non-disjoint sets, which is different from the current most popular approach and can gain longer network lifetime as well as less coverage breach. We proposed two algorithms for the first model based on linear programming and greedy techniques, respectively. Then we transform these algorithms to solve the second model by revealing the strong connection between the models. Through numerical simulation, we showed the good performance of our algorithms and the pictures of the tradeoff scheme in variant scenarios, which coincide with theoretical analysis very well. It is also showed that our algorithms could obtain less breach rate than the one proposed in [2].",
author = "Chen Wang and Thai, {My T.} and Yingshu Li and Feng Wang and Weili Wu",
year = "2007",
doi = "10.1109/GLOCOM.2007.215",
language = "English (US)",
isbn = "1424410436",
pages = "1118--1123",
booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - Minimum coverage breach and maximum network lifetime in wireless sensor networks

AU - Wang, Chen

AU - Thai, My T.

AU - Li, Yingshu

AU - Wang, Feng

AU - Wu, Weili

PY - 2007

Y1 - 2007

N2 - Network lifetime is a critical issue in Wireless Sensor Networks. It is possible to extend network lifetime by organizing the sensors into a number of sensor covers. However, with the limited bandwidth, coverage breach (i.e, targets that are not covered) can occur if the number of available time-slots/channels is less than the number of sensors in a sensor cover. In this paper, we study a joint optimization problem in which the objective is to minimize the coverage breach as well as to maximize the network lifetime. We show a "trade-off" scheme by presenting two strongly related models, which aim to tradeoffs between the two conflicting objectives. The main approach of our models is organizing sensors into non-disjoint sets, which is different from the current most popular approach and can gain longer network lifetime as well as less coverage breach. We proposed two algorithms for the first model based on linear programming and greedy techniques, respectively. Then we transform these algorithms to solve the second model by revealing the strong connection between the models. Through numerical simulation, we showed the good performance of our algorithms and the pictures of the tradeoff scheme in variant scenarios, which coincide with theoretical analysis very well. It is also showed that our algorithms could obtain less breach rate than the one proposed in [2].

AB - Network lifetime is a critical issue in Wireless Sensor Networks. It is possible to extend network lifetime by organizing the sensors into a number of sensor covers. However, with the limited bandwidth, coverage breach (i.e, targets that are not covered) can occur if the number of available time-slots/channels is less than the number of sensors in a sensor cover. In this paper, we study a joint optimization problem in which the objective is to minimize the coverage breach as well as to maximize the network lifetime. We show a "trade-off" scheme by presenting two strongly related models, which aim to tradeoffs between the two conflicting objectives. The main approach of our models is organizing sensors into non-disjoint sets, which is different from the current most popular approach and can gain longer network lifetime as well as less coverage breach. We proposed two algorithms for the first model based on linear programming and greedy techniques, respectively. Then we transform these algorithms to solve the second model by revealing the strong connection between the models. Through numerical simulation, we showed the good performance of our algorithms and the pictures of the tradeoff scheme in variant scenarios, which coincide with theoretical analysis very well. It is also showed that our algorithms could obtain less breach rate than the one proposed in [2].

UR - http://www.scopus.com/inward/record.url?scp=39349111125&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=39349111125&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2007.215

DO - 10.1109/GLOCOM.2007.215

M3 - Conference contribution

AN - SCOPUS:39349111125

SN - 1424410436

SN - 9781424410439

SP - 1118

EP - 1123

BT - GLOBECOM - IEEE Global Telecommunications Conference

ER -