research-article

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

Authors:

Ding-Zhu DuAuthors Info & Claims

IEEE/ACM Transactions on Networking (TON), Volume 24, Issue 6

Pages 3620 - 3633

https://doi.org/10.1109/TNET.2016.2531688

Published: 01 December 2016 Publication History

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+\varepsilon \) -approximation for \(k=1\) and \(6+\varepsilon \) -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+\varepsilon \) -approximation.

References

[1]

C. Ambühl, T. Erlebach, M. Mihalák, and M. Nunkesser, "Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs," in Proc. 9th Int. Workshop APPROX, vol. 4110. 2006, pp. 3-14.

[2]

P. Balister, Z. Zheng, S. Kumar, and P. Sinha, "Trap coverage: Allowing coverage holes of bounded diameter in wireless sensor networks," in Proc. IEEE INFOCOM, Apr. 2009, pp. 136-144.

[3]

N. Bansal and K. Pruhs, "Weighted geometric set multi-cover via quasi-uniform sampling," in Proc. 20th Annu. ESA, vol. 7501. 2012, pp. 145-156.

[4]

P. Berman, G. Calinescu, C. Shah, and A. Zelikovsky, "Power efficient monitoring management in sensor networks," in Proc. IEEE Wireless Commun. Netw. Conf. (WCNC), Atlanta, GA, USA, Mar. 2004, pp. 2329-2334.

[5]

H. Brönnimann and M. T. Goodrich, "Almost optimal set covers in finite VC-dimension," Discrete Comput. Geometry, vol. 14, no. 4, pp. 263-279, 1995.

[6]

M. Cardei et al., "Wireless sensor networks with energy efficient organization," J. Interconnection Netw., vol. 3, pp. 213-229, Sep./Dec. 2002.

[7]

M. Cardei and D.-Z. Du, "Improving wireless sensor network lifetime through power aware organization," Wireless Netw., vol. 11, no. 3, pp. 333-340, 2005.

[8]

M. Cardei, M. Thai, Y. Li, and W. Wu, "Energy-efficient target coverage in wireless sensor networks," in Proc. IEEE INFOCOM, Mar. 2005, pp. 1976-1984.

[9]

M. Cardei and J. Wu, "Coverage in wireless sensor networks," in Handbook of Sensor Networks, M. Ilyas and I. Mahgoub, Eds. Boca Raton, FL, USA: CRC Press, 2004.

[10]

M. Cardei, "Coverage problems in sensor networks," in Handbook of Combinatorial Optimization, 2nd ed., P. M. Pardalos, D.-Z. Du, and R. L. Graham, Eds. New York, NY, USA: Springer, 2013.

[11]

C. Chekuri, K. L. Clarkson, and S. Har-Peled, "On the set multicover problem in geometric settings," ACM Trans. Algorithms, vol. 9, no. 1, 2012, Art. no. 9.

[12]

J. Chen, J. Li, S. He, T. He, Y. Gu, and Y. Sun, "On energy-efficient trap coverage in wireless sensor networks," ACM Trans. Sensor Netw., vol. 10, no. 1, 2013, Art. no. 2.

[13]

J. Chen, J. Li, and T. H. Lai, "Trapping mobile targets in wireless sensor networks: An energy-efficient perspective," IEEE Trans. Veh. Technol., vol. 62, no. 7, pp. 3287-3300, Sep. 2013.

[14]

M. X. Cheng, L. Ruan, and W. Wu, "Achieving minimum coverage breach under bandwidth constraints in wireless sensor networks," in Proc. 24th Annu. Joint Conf. IEEE INFOCOM, Mar. 2005, pp. 2638-2645.

[15]

V. Chvátal, "A greedy heuristic for the set-covering problem," Math. Oper. Res., vol. 4, no. 3, pp. 233-235, 1979.

[16]

K. L. Clarkson and K. Varadarajan, "Improved approximation algorithms for geometric set cover," Discrete Comput. Geometry, vol. 37, no. 1, pp. 43-58, Jan. 2007.

[17]

D. Dai and C. Yu, "A (5 + ε)-approximation algorithm for minimum weighted dominating set in unit disk graph," Theor. Comput. Sci., vol. 410, nos. 8-10, pp. 756-765, Mar. 2009.

[18]

A. Dhawan, C. T. Vu, A. Zelikovsky, Y. Li, and S. K. Prasad, "Maximum lifetime of sensor networks with adjustable sensing range," in Proc. SNPD, Las Vegas, NV, USA, Jun. 2006, pp. 285-289.

[19]

L. Ding et al., "Constant-approximation for target coverage problem in wireless sensor networks," in Proc. IEEE INFOCOM, Mar. 2012, pp. 1584-1592.

[20]

D.-Z. Du, K.-I. Ko, and X. Hu, Design and Analysis of Approximation Algorithms. New York, NY, USA: Springer, 2012.

[21]

H. Du, P. M. Pardalos, W. Wu, and L. Wu, "Maximum lifetime connected coverage with two active-phase sensors," J. Global Optim., vol. 56, no. 2, pp. 559-568, Jun. 2013.

[22]

T. Erlebach and M. Mihalák, "A (4+ε)-approximation for the minimum-weight dominating set problem in unit disk graphs," in Approximation and Online Algorithms (Lecture Notes in Computer Science), vol. 5893. New York, NY, USA: Springer, 2010, pp. 135-146.

[23]

T. Erlebach, T. Grant, and F. Kammer, "Maximising lifetime for fault-tolerant target coverage in sensor networks," Sustain. Comput., Inf. Syst., vol. 1, no. 3, pp. 213-225, Sep. 2011.

[24]

U. Feige, "A threshold of ln n for approximating set cover," J. ACM, vol. 45, no. 4, pp. 634-652, 1998.

[25]

N. Garg and J. Könemann, "Faster and simpler algorithms for multicommodity flow and other fractional packing problems," in Proc. 39th Annu. Symp. FOCS, Nov. 1998, pp. 300-309.

[26]

M. Gibson and I. A. Pirwani, "Algorithms for dominating set in disk graphs: Breaking the log n barrier," in Proc. 18th ESA, vol. 6346, 2010, pp. 243-254.

[27]

D. S. Hochbaum and W. Maass, "Approximation schemes for covering and packing problems in image processing and VLSI," J. ACM, vol. 32, no. 1, pp. 130-136, 1985.

[28]

Approximation Algorithms for NP-Hard Problems, D. S. Hochbaum, Ed. Boston, MA, USA: PWS Publishing Company, 1997.

[29]

Y. Huang, X. Gao, Z. Zhang, and W. Wu, "A better constant-factor approximation for weighted dominating set in unit disk graph," J. Combinat. Optim., vol. 18, no. 2, pp. 174-194, 2009.

[30]

D. S. Johnson, "Approximation algorithms for combinatorial problems," J. Comput. Syst. Sci., vol. 9, no. 3, pp. 256-278, 1974.

[31]

L. Lovász, "On the ratio of optimal integral and fractional covers," Discrete Math., vol. 13, no. 4, pp. 383-390, 1975.

[32]

S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. B. Srivastava, "Coverage problems in wireless ad-hoc sensor networks," in Proc. IEEE INFOCOM, 2001, pp. 1380-1387.

[33]

N. H. Mustafa and S. Ray, "PTAS for geometric hitting set problems via local search," in Proc. 25th Annu. SCG, New York, NY, USA, 2009, pp. 17-22.

[34]

N. H. Mustafa and S. Ray, "Improved results on geometric hitting set problems," Discrete Comput. Geometry, vol. 44, no. 4, pp. 883-895, 2010.

[35]

P. Sanders and D. Schieferdecker, "Lifetime maximization of monitoring sensor networks," Algorithms for Sensor Systems (Lecture Notes in Computer Science), vol. 6451. New York, NY, USA: Springer, 2010, pp. 134-147.

[36]

P. Slavik, "A tight analysis of the greedy algorithm for set cover," J. Algorithms, vol. 25, no. 2, pp. 237-254, 1997.

[37]

K. Varadarajan, "Weighted geometric set cover via quasi-uniform sampling," in Proc. 42nd ACM STOC, Cambridge, MA, USA, 2010, pp. 641-648.

[38]

P.-J. Wan, X. Xu, and Z. Wang, "Wireless coverage with disparate ranges," in Proc. 12th ACM Int. Symp. MobiHoc, Paris, France, 2011, Art. no. 11.

[39]

B. Wang, "Coverage problems in sensor networks: A survey," ACM Comput. Surv., vol. 43, no. 4, 2011, Art. no. 32.

[40]

B. Wang, H. Xu, W. Liu, and H. Liang, "A novel node placement for long belt coverage in wireless networks," IEEE Trans. Comput., vol. 62, no. 12, pp. 2341-2353, Dec. 2013.

[41]

B. Wang, H. Xu, W. Liu, and L. T. Yang, "The optimal node placement for long belt coverage in wireless networks," IEEE Trans. Comput., vol. 64, no. 2, pp. 587-592, Feb. 2015.

[42]

L. Wu et al., "Approximations for minimum connected sensor cover," in Proc. IEEE INFOCOM, Apr. 2013, pp. 1187-1194.

[43]

F. Zou et al., "New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs," Theor. Comput. Sci., vol. 412, no. 3, pp. 198-208, 2011.

Cited By

Varposhti M(2024)Distributed homology-based algorithm for solving Set k-Cover problem in heterogeneous directional sensor networksThe Journal of Supercomputing10.1007/s11227-023-05721-280:5(6946-6964)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1007/s11227-023-05721-2
Pavithra RArivudainambi D(2023)Coverage-Aware Sensor Deployment and Scheduling in Target-Based Wireless Sensor NetworkWireless Personal Communications: An International Journal10.1007/s11277-023-10292-9130:1(421-448)Online publication date: 31-Mar-2023
https://dl.acm.org/doi/10.1007/s11277-023-10292-9
Zhang ZLiang WDu HLiu S(2022)Constant Approximation for the Lifetime Scheduling Problem of p-Percent CoverageINFORMS Journal on Computing10.1287/ijoc.2022.120134:5(2675-2685)Online publication date: 1-Sep-2022
https://dl.acm.org/doi/10.1287/ijoc.2022.1201
Show More Cited By

Approximating Maximum Lifetime $k$ -Coverage Through Minimizing Weighted $k$ -Cover in Homogeneous Wireless Sensor Networks
1. Mathematics of computing
  1. Mathematical analysis
    1. Functional analysis
2. Networks
  1. Network types

Recommendations

Optimally Approximating the Coverage Lifetime of Wireless Sensor Networks

We address a classical problem concerning energy efficiency in sensor networks. In particular, we consider the problem of maximizing the lifetime of coverage of targets in a wireless sensor network with battery-limited sensors. We first show that the ...
Maximizing the wireless sensor networks lifetime through energy efficient connected coverage

Wireless Sensor Network (WSN) is an emerging technology that is gaining much importance owing to its immense contribution in various day-to-day applications. A sensor is battery-operated, unattended low-cost device with limited computing, communication ...
Maximum lifetime scheduling for target coverage in wireless sensor networks
IWCMC '10: Proceedings of the 6th International Wireless Communications and Mobile Computing Conference

The best way to conserve energy in wireless sensor networks is to change the radio interface state to sleep mode. The sensors in sleep mode conserve energy, whereas the sensors in active mode use their energy to continue to monitor the target. How ...

Comments

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking

IEEE/ACM Transactions on Networking Volume 24, Issue 6

December 2016

635 pages

ISSN:1063-6692

Issue’s Table of Contents

Copyright © 2016.

Publisher

IEEE Press

Publication History

Published: 01 December 2016

Published in TON Volume 24, Issue 6

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
52
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Varposhti M(2024)Distributed homology-based algorithm for solving Set k-Cover problem in heterogeneous directional sensor networksThe Journal of Supercomputing10.1007/s11227-023-05721-280:5(6946-6964)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1007/s11227-023-05721-2
Pavithra RArivudainambi D(2023)Coverage-Aware Sensor Deployment and Scheduling in Target-Based Wireless Sensor NetworkWireless Personal Communications: An International Journal10.1007/s11277-023-10292-9130:1(421-448)Online publication date: 31-Mar-2023
https://dl.acm.org/doi/10.1007/s11277-023-10292-9
Zhang ZLiang WDu HLiu S(2022)Constant Approximation for the Lifetime Scheduling Problem of p-Percent CoverageINFORMS Journal on Computing10.1287/ijoc.2022.120134:5(2675-2685)Online publication date: 1-Sep-2022
https://dl.acm.org/doi/10.1287/ijoc.2022.1201
Lei YQu MLei CKong ZTian JWang S(2022)Two FCA-Based Methods for Reducing Energy Consumption of Sensor Nodes in Wireless Sensor NetworksScientific Programming10.1155/2022/85204472022Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1155/2022/8520447
Ran YHuang XZhang ZDu D(2021)Approximation algorithm for minimum power partial multi-coverage in wireless sensor networksJournal of Global Optimization10.1007/s10898-021-01033-y80:3(661-677)Online publication date: 19-May-2021
https://dl.acm.org/doi/10.1007/s10898-021-01033-y
Pegatoquet ALe TMagno M(2019)A Wake-Up Radio-Based MAC Protocol for Autonomous Wireless Sensor NetworksIEEE/ACM Transactions on Networking10.1109/TNET.2018.288079727:1(56-70)Online publication date: 1-Feb-2019
https://dl.acm.org/doi/10.1109/TNET.2018.2880797
Zhou JZhang ZTang SHuang XDu D(2018)Breaking the Oln n BarrierINFORMS Journal on Computing10.5555/3233127.323312830:2(225-235)Online publication date: 1-May-2018
https://dl.acm.org/doi/10.5555/3233127.3233128

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents