Abstract
Some sensor network applications require k-coverage to ensure the quality of surveillance. Meanwhile, energy is another primary concern for sensor networks. In this paper, we investigate the Sensor Scheduling for k-Coverage (SSC) problem which requires to efficiently schedule the sensors, such that the monitored area can be k-covered throughout the whole network lifetime with the purpose of maximizing network lifetime. The SSC problem is NP-hard and we propose two heuristic algorithms under different scenarios. In addition, we develop a guideline for users to better design a sensor deployment plan to save energy by employing a density control scheme. Simulation results are presented to evaluate our proposed algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abrams Z, Goel A, Plotkin S (2004) Set K-cover algorithms for energy efficient monitoring in wireless sensor networks. In: Proceedings of third international symposium on information
Akyildiz IF, Su W, Sankarasubramaniam Y, Cayirci E (2002) Wireless sensor networks: a survey. Comput Netw 38:393-422
Cardei M, Du D-Z (2005) Improving wireless sensor network lifetime through power aware organization. ACM Wirel Netw 11(3):333–340
Cardei M, Wu J (2004) Energy-efficient coverage problems in wireless ad hoc sensor networks. J Comput Commun Sensor Netw
Cardei M, Thai M, Li Y, Wu W (2005a) Energy-efficient target coverage in wireless sensor networks. In: IEEE INFOCOM 2005, Miami, USA, March 2005
Cardei M, Wu J, Lu N, Pervaiz MO (2005b) Maximum network lifetime with adjustable range. In: IEEE international conference on wireless and mobile computing, networking and communications (WiMob’05), August 2005
Cheng MX, Ruan L, Wu W (2005) Achieving minimum coverage breach under bandwidth constraints in wireless sensor networks. In: Proceedings of the 24th conference of the IEEE communications society (INFOCOM)
Gupta H, Das S, Gu Q (2003) Connected sensor cover: self-organization of sensor networks for efficient query execution. In: MobiHoc ’03, Annapolis, MD, June 1–3, 2003
Huang Q (2003) Solving an open sensor exposure problem using variational calculus. Technical Report WUCS-03-1, Washington University, Department of Computer Science and Engineering, St. Louis, MO
Huang C, Tseng Y (2003) The coverage problem in a wireless sensor network. In: WSNA’03, San Diego, CA, September 2003
Jiang J, Dou W (2004) A coverage-preserving density control algorithm for wireless sensor. In: Proceedings of 3rd international conference, ADHOC-NOW 2004, Vancouver, Canada, July 22–24, 2004
Jie Wu, Yang S (2004) Coverage issue in sensor networks with adjustable ranges. In: Proceedings of the 2004 international conference on parallel processing workshops
Kumar S, Lai TH, Balogh J (2004) On k-coverage in a mostly sleeping sensor network. In: Proceeding of the 10th international conference on mobile computing and networking, Philadelphia, PA, pp 144–158
Li X, Wan P, Frieder O (2003) Coverage in wireless ad hoc sensor networks. IEEE Trans Comput 52(6):753–763
Meguerdichian S, Koushanfar E, Potkonjak M, Snvastava M (2001) Coverage problems in wireless ad-hoc sensor networks. In: IEEE Infocom, pp 1380–1387
Mehta DP, Lopez MA, Lin L (2003) Optimal coverage paths in ad-hoc sensor networks. IEEE Int Conf Commun 1:507–511
Wang X, Xing G, Zhang Y, Lu C, Pless R, Gill C (2003) Integrated coverage and connectivity configuration in wireless sensor networks. SenSys’03, Los Angeles, CA, November 2003
Yan T, He T, Stankovic JA (2003) Differentiated surveillance for sensor networks. In: Proceedings of ACM SenSys03, November 2003, pp 51–62
Zhou Z, Das S, Gupta H (2004) Connected k-coverage problem in sensor networks. In: Proceedings of the international conference on computer communications and networks (ICCCN)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, Y., Gao, S. Designing k-coverage schedules in wireless sensor networks. J Comb Optim 15, 127–146 (2008). https://doi.org/10.1007/s10878-007-9072-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-007-9072-6