Journal
IEEE-ACM TRANSACTIONS ON NETWORKING
Volume 24, Issue 6, Pages 3620-3633Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TNET.2016.2531688
Keywords
Approximation algorithm; maximum lifetime; uniform sensing range; multi-cover; weight
Categories
Funding
- Xingjiang Talent Youth Project [2013711011]
- Specialized Research Fund for the Doctoral Program of Higher Education, China [20126501110001]
- National Natural Science Foundation of China [11531011, 11571319, 61222201, 61472272]
Ask authors/readers for more resources
Energy efficiency is an important issue in the study of wireless sensor networks. Given a set of targets and a set of sensors with bounded lifetime, the maximum lifetime k-coverage problem is to schedule active/sleeping status of sensors to maximize the time period during which every target is covered by at least k active sensors. Previously, it was known that when the sensing ranges are uniform, this problem has a polynomial-time (4+epsilon)-approximation for k = 1 and (6+epsilon)-approximation for k = 2. In this paper, we make significant progress by showing that for any positive integer k, there exists a polynomial-time (3 + epsilon)-approximation.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available