### 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 language | English |
---|---|

Title of host publication | Proceedings - IEEE INFOCOM |

Pages | 1584-1592 |

Number of pages | 9 |

DOIs | |

Publication status | Published - 2012 Jun 4 |

Event | IEEE Conference on Computer Communications, INFOCOM 2012 - Orlando, FL, United States Duration: 2012 Mar 25 → 2012 Mar 30 |

### Other

Other | IEEE Conference on Computer Communications, INFOCOM 2012 |
---|---|

Country | United States |

City | Orlando, FL |

Period | 12/3/25 → 12/3/30 |

### ASJC Scopus subject areas

- Computer Science(all)
- Electrical and Electronic Engineering

## Fingerprint Dive into the research topics of 'Constant-approximation for target coverage problem in wireless sensor networks'. Together they form a unique fingerprint.

## Cite this

*Proceedings - IEEE INFOCOM*(pp. 1584-1592). [6195527] https://doi.org/10.1109/INFCOM.2012.6195527