Name
Abstract | ||
|---|---|---|
Energy efficiency is an important issue in the study of wireless sensor networks. Given a homogeneous set of sensors with unit lifetime and a set of target points, find an active/sleeping schedule for sensors to maximize the lifetime of k-coverage, i.e., the time period during which every target point is covered by at least k active sensors. This is a well known problem in wireless sensor networks concerning with energy efficiency. When k = 1, it is called the maximum lifetime coverage problem which has been proved to have a polynomial-time (4 + epsilon)-approximation. When k >= 2, it is the maximum lifetime fault-tolerant coverage problem. Previous to this work, only in the case k = 2, a polynomial-time (6 + epsilon)-approximation is found. In this paper, we will make a significant progress by showing that for any positive integer k, there exists a polynomial-time (4 + epsilon)-approximation, and for k = 1, 2, the performance ratio can be improved to (3 + epsilon). |
Year | Venue | Field |
|---|---|---|
2015 | 2015 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (INFOCOM) | Integer,Topology,Key distribution in wireless sensor networks,Mathematical optimization,Efficient energy use,Computer science,Performance ratio,Homogeneous,Computer network,Fault tolerance,Wireless sensor network |
DocType | ISSN | Citations |
Conference | 0743-166X | 2 |
PageRank | References | Authors |
0.37 | 16 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| James K. Willson | 1 | 6 | 1.49 |
| Zhao Zhang | 2 | 706 | 102.46 |
| Weili Wu | 3 | 2093 | 170.29 |
| Ding-Zhu Du | 4 | 258 | 36.90 |