Constant-approximation for target coverage problem in wireless sensor networks

Ling Ding, Weili Wu, James Willson, Lidong Wu, Zaixin Lu, Wonjun Lee

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

41 Citations (Scopus)

Abstract

When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the field? This is a well-known problem, called Maximum Lifetime Coverage Problem (MLCP), which has been studied extensively in the literature. It is a long-standing open problem whether MLCP has a polynomial-time constant-approximation. The best-known approximation algorithm has performance ratio 1 + ln n where n is the number of sensors in the network, which was given by Berman et. al [1]. In their work, MLCP is reduced to Minimum Weight Sensor Coverage Problem (MWSCP) which is to find the minimum total weight of sensors to cover a given area or a given set of targets with a given set of weighted sensors. In this paper, we present a polynomial-time (4 + ε)-approximation algorithm for MWSCP and hence we obtain a polynomial-time (4+ξ)-approximation algorithm for MLCP, where ε > 0, ξ > 0.

Original languageEnglish
Title of host publicationProceedings - IEEE INFOCOM
Pages1584-1592
Number of pages9
DOIs
Publication statusPublished - 2012 Jun 4
EventIEEE Conference on Computer Communications, INFOCOM 2012 - Orlando, FL, United States
Duration: 2012 Mar 252012 Mar 30

Other

OtherIEEE Conference on Computer Communications, INFOCOM 2012
CountryUnited States
CityOrlando, FL
Period12/3/2512/3/30

Fingerprint

Wireless sensor networks
Sensors
Approximation algorithms
Polynomials

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Ding, L., Wu, W., Willson, J., Wu, L., Lu, Z., & Lee, W. (2012). Constant-approximation for target coverage problem in wireless sensor networks. In Proceedings - IEEE INFOCOM (pp. 1584-1592). [6195527] https://doi.org/10.1109/INFCOM.2012.6195527

Constant-approximation for target coverage problem in wireless sensor networks. / Ding, Ling; Wu, Weili; Willson, James; Wu, Lidong; Lu, Zaixin; Lee, Wonjun.

Proceedings - IEEE INFOCOM. 2012. p. 1584-1592 6195527.

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

Ding, L, Wu, W, Willson, J, Wu, L, Lu, Z & Lee, W 2012, Constant-approximation for target coverage problem in wireless sensor networks. in Proceedings - IEEE INFOCOM., 6195527, pp. 1584-1592, IEEE Conference on Computer Communications, INFOCOM 2012, Orlando, FL, United States, 12/3/25. https://doi.org/10.1109/INFCOM.2012.6195527
Ding L, Wu W, Willson J, Wu L, Lu Z, Lee W. Constant-approximation for target coverage problem in wireless sensor networks. In Proceedings - IEEE INFOCOM. 2012. p. 1584-1592. 6195527 https://doi.org/10.1109/INFCOM.2012.6195527
Ding, Ling ; Wu, Weili ; Willson, James ; Wu, Lidong ; Lu, Zaixin ; Lee, Wonjun. / Constant-approximation for target coverage problem in wireless sensor networks. Proceedings - IEEE INFOCOM. 2012. pp. 1584-1592
@inproceedings{cdb6e3cda4be4176b60854411799c29b,
title = "Constant-approximation for target coverage problem in wireless sensor networks",
abstract = "When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the field? This is a well-known problem, called Maximum Lifetime Coverage Problem (MLCP), which has been studied extensively in the literature. It is a long-standing open problem whether MLCP has a polynomial-time constant-approximation. The best-known approximation algorithm has performance ratio 1 + ln n where n is the number of sensors in the network, which was given by Berman et. al [1]. In their work, MLCP is reduced to Minimum Weight Sensor Coverage Problem (MWSCP) which is to find the minimum total weight of sensors to cover a given area or a given set of targets with a given set of weighted sensors. In this paper, we present a polynomial-time (4 + ε)-approximation algorithm for MWSCP and hence we obtain a polynomial-time (4+ξ)-approximation algorithm for MLCP, where ε > 0, ξ > 0.",
author = "Ling Ding and Weili Wu and James Willson and Lidong Wu and Zaixin Lu and Wonjun Lee",
year = "2012",
month = "6",
day = "4",
doi = "10.1109/INFCOM.2012.6195527",
language = "English",
isbn = "9781467307758",
pages = "1584--1592",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - Constant-approximation for target coverage problem in wireless sensor networks

AU - Ding, Ling

AU - Wu, Weili

AU - Willson, James

AU - Wu, Lidong

AU - Lu, Zaixin

AU - Lee, Wonjun

PY - 2012/6/4

Y1 - 2012/6/4

N2 - When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the field? This is a well-known problem, called Maximum Lifetime Coverage Problem (MLCP), which has been studied extensively in the literature. It is a long-standing open problem whether MLCP has a polynomial-time constant-approximation. The best-known approximation algorithm has performance ratio 1 + ln n where n is the number of sensors in the network, which was given by Berman et. al [1]. In their work, MLCP is reduced to Minimum Weight Sensor Coverage Problem (MWSCP) which is to find the minimum total weight of sensors to cover a given area or a given set of targets with a given set of weighted sensors. In this paper, we present a polynomial-time (4 + ε)-approximation algorithm for MWSCP and hence we obtain a polynomial-time (4+ξ)-approximation algorithm for MLCP, where ε > 0, ξ > 0.

AB - When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the field? This is a well-known problem, called Maximum Lifetime Coverage Problem (MLCP), which has been studied extensively in the literature. It is a long-standing open problem whether MLCP has a polynomial-time constant-approximation. The best-known approximation algorithm has performance ratio 1 + ln n where n is the number of sensors in the network, which was given by Berman et. al [1]. In their work, MLCP is reduced to Minimum Weight Sensor Coverage Problem (MWSCP) which is to find the minimum total weight of sensors to cover a given area or a given set of targets with a given set of weighted sensors. In this paper, we present a polynomial-time (4 + ε)-approximation algorithm for MWSCP and hence we obtain a polynomial-time (4+ξ)-approximation algorithm for MLCP, where ε > 0, ξ > 0.

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

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

U2 - 10.1109/INFCOM.2012.6195527

DO - 10.1109/INFCOM.2012.6195527

M3 - Conference contribution

AN - SCOPUS:84861618557

SN - 9781467307758

SP - 1584

EP - 1592

BT - Proceedings - IEEE INFOCOM

ER -