Processing math: 100%
Approximating Maximum Lifetime <span class="MathJax_Preview">k</span><script type="math/tex" id="MathJax-Element-1">k</script> -Coverage Through Minimizing Weighted <span class="MathJax_Preview">k</span><script type="math/tex" id="MathJax-Element-2">k</script> -Cover in Homogeneous Wireless Sensor Networks | IEEE Journals & Magazine | IEEE Xplore

Approximating Maximum Lifetime k -Coverage Through Minimizing Weighted k -Cover in Homogeneous Wireless Sensor Networks


Abstract:

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 ...Show More

Abstract:

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+ε)-approximation for k = 1 and (6+ε)-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 + ε)-approximation.
Published in: IEEE/ACM Transactions on Networking ( Volume: 24, Issue: 6, December 2016)
Page(s): 3620 - 3633
Date of Publication: 04 March 2016

ISSN Information:

Funding Agency:


Contact IEEE to Subscribe

References

References is not available for this document.