Optimization scheme for sensor coverage scheduling with bandwidth constraints

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

Research output: Contribution to journalArticle

21 Citations (Scopus)

Abstract

Wireless Sensor Network has attracted a lot of attentions due to its broad applications in recent years and also introduces many challenges. 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 (Cheng et al. in INFOCOM' 05, 2005).

Original languageEnglish (US)
Pages (from-to)63-75
Number of pages13
JournalOptimization Letters
Volume3
Issue number1
DOIs
StatePublished - Jan 2009

Fingerprint

Network Lifetime
Coverage
Scheduling
Bandwidth
Sensor
Optimization
Trade-offs
Wireless Sensor Networks
Cover
Model
Linear programming
Theoretical Analysis
Maximise
Transform
Model-based
Optimization Problem
Minimise
Numerical Simulation
Scenarios
Target

ASJC Scopus subject areas

  • Control and Optimization

Cite this

Optimization scheme for sensor coverage scheduling with bandwidth constraints. / Wang, Chen; Thai, My T.; Li, Yingshu; Wang, Feng; Wu, Weili.

In: Optimization Letters, Vol. 3, No. 1, 01.2009, p. 63-75.

Research output: Contribution to journalArticle

Wang, Chen ; Thai, My T. ; Li, Yingshu ; Wang, Feng ; Wu, Weili. / Optimization scheme for sensor coverage scheduling with bandwidth constraints. In: Optimization Letters. 2009 ; Vol. 3, No. 1. pp. 63-75.
@article{d89f006f95814045b1180ef5926d3b3b,
title = "Optimization scheme for sensor coverage scheduling with bandwidth constraints",
abstract = "Wireless Sensor Network has attracted a lot of attentions due to its broad applications in recent years and also introduces many challenges. 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 (Cheng et al. in INFOCOM' 05, 2005).",
author = "Chen Wang and Thai, {My T.} and Yingshu Li and Feng Wang and Weili Wu",
year = "2009",
month = "1",
doi = "10.1007/s11590-008-0091-8",
language = "English (US)",
volume = "3",
pages = "63--75",
journal = "Optimization Letters",
issn = "1862-4472",
publisher = "Springer Verlag",
number = "1",

}

TY - JOUR

T1 - Optimization scheme for sensor coverage scheduling with bandwidth constraints

AU - Wang, Chen

AU - Thai, My T.

AU - Li, Yingshu

AU - Wang, Feng

AU - Wu, Weili

PY - 2009/1

Y1 - 2009/1

N2 - Wireless Sensor Network has attracted a lot of attentions due to its broad applications in recent years and also introduces many challenges. 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 (Cheng et al. in INFOCOM' 05, 2005).

AB - Wireless Sensor Network has attracted a lot of attentions due to its broad applications in recent years and also introduces many challenges. 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 (Cheng et al. in INFOCOM' 05, 2005).

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

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

U2 - 10.1007/s11590-008-0091-8

DO - 10.1007/s11590-008-0091-8

M3 - Article

AN - SCOPUS:67650498463

VL - 3

SP - 63

EP - 75

JO - Optimization Letters

JF - Optimization Letters

SN - 1862-4472

IS - 1

ER -