Advertisement

A General Framework on Connected Sensor Cover in Homogenous Dense Sensor Networks

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 295)

Abstract

In a wireless sensor network, sensors are often deployed in a redundant and random fashion. However, if all the sensors are in an active mode, the lifetime of the network will be very limited. Selecting sufficient but not redundant sensors to meet the requirements (coverage and connectivity) of the network while the remaining sensors switch to the sleep mode is an efficient way to reduce energy consumption and prolong the lifetime of the network. This is called the connected sensor cover problem. In this paper, we present two approximation algorithms to construct such a connected sensor cover to satisfy the coverage and connectivity. Simulation results show that the performance of the two algorithms outperform the best-known algorithm.

Keywords

Wireless sensor networks Connected sensor cover Coverage Connectivity 

Notes

Acknowledgments

This work was financially supported by National Natural Science Foundation of China with Grant No. 61100191 and 11071271, and Shenzhen Strategic Emerging Industries Program with Grant Nos. ZDSY20120613125016389 and JCYJ20120613151201451, and Natural Scientific Research Innovation Foundation in Harbin Institute of Technology under project HIT.NSFIR.2011128.

References

  1. 1.
    Agre J, Clare L (2000) An integrated architecture for cooperative sensing networks. IEEE Trans Comput 33(5):106–108Google Scholar
  2. 2.
    Bonnet P, Gehrke J, Seshadri P (2001) Toward sensor database systems. Springer-Verlag, Lecture Notes in Computer ScienceGoogle Scholar
  3. 3.
    Govindan R, Hellerstein J, Hong W, Madden S, Franklin M, Shenker S (2002) The sensor network as a database. In: Technical Representative, Computer Science Department University, Southern California, Los AngelesGoogle Scholar
  4. 4.
    Pottie G, Kaiser W (2000) Wireless integrated sensor networks. Commun ACM 43(5):5158CrossRefGoogle Scholar
  5. 5.
    Akyildiz IF, Su W, Sankarasubramaniam Y, Cayirci E (2002) Wireless sensor networks: a survey. Comput Netw 38(4):393–422CrossRefGoogle Scholar
  6. 6.
    Tian D, Georganas ND (2005) Connectivity maintenance and coverage preservation in wireless sensor networks. Ad Hoc Netw 3(6):744–761Google Scholar
  7. 7.
    Funke S, Kesselman A, Kuhn F, Zvi L, Michael S (2007) Improved approximation algorithms for connected sensor cover. Wireless Netw 13(2):153–164Google Scholar
  8. 8.
    Ajoy K (2006) Datta, Maria Gradinariu, PreethiLinga, Philippe Raipin-Parvedy. Self-* distributed query region covering in sensor networks. J Aerosp Comput Inf Commun 3(8):437–452CrossRefGoogle Scholar
  9. 9.
    Javad A-T (2013) An adaptive energy-efficient area coverage algorithm forwireless sensor networks. Ad Hoc Netw 11(6):1655–1666Google Scholar
  10. 10.
    Zhou Z, Das S, Gupta H (2005) Fault tolerant connected sensor cover with variable sensing and transmission ranges. In: Proceedings of the Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (SECON), pp 594–604Google Scholar
  11. 11.
    Gupta H, Zhou Z, Quinyi G (2006) Connected sensor cover: self-organization of sensor networks for efficient query execution. IEEE/ACM Trans Networking 14(1):55–67Google Scholar
  12. 12.
    Sai Z, Ming XY, Fei Z, Qi JX, HongWei D, Ying Y (2009) A distributed approximation algorithm for minimal connected cover set problem in sensor networks. WRI international conference on communications and mobile computing, pp 556–562Google Scholar
  13. 13.
    Zhou Z, Das SR, Gupta H (2009) Variable radii connected sensor cover in sensor networks. ACM Trans Sens Netw 5(1):8:1–36Google Scholar
  14. 14.
    Jamali M, Bakhshivand N, Easmaeilpour M, Salami D (2010) An energy-efficient algorithm for connected target coverage problem in wireless sensor networks. In: 3rd IEEE international conference on computer science and information technology, 9–11 July 2010, pp 249–254Google Scholar
  15. 15.
    Shimokawa T, Fujiwara A (2012) Centralized algorithms for the connected target coverage in wireless sensor networks. In: 3rd international conference on networking and computing, 5–7 December 2012, pp 307–310Google Scholar
  16. 16.
    Fethi J (2013) A Lagrangean-based heuristics for the target covering problem in wireless sensor network. Appl Math Model 37(10–11):6780–6785Google Scholar
  17. 17.
    Shen W, Wu Q (2011) Exploring redundancy in sensor deployment to maximize network lifetime and coverage. In: 8th annual IEEE communications society conference on sensors, mesh and Ad Hoc communications and networks, pp 557–565Google Scholar
  18. 18.
    Tahiry R, David S-R (2011) Connectivity preservation and coverage schemes for wireless senor networks. IEEE Trans Autom Control 56(10):2418–2428Google Scholar
  19. 19.
    Luo W, Wang J, Guo J, Chen J (2013) Parameterized complexity of max-lifetime target coverage in wireless sensor networks. Theoret Comput Sci. http://dx.doi.org/10.1016/j.tcs.2013.06.008
  20. 20.
    Du H, Panos PM, Wu W, Wu L (2013) Maximum lifetime connected coverage with two active-phase sensors. J Global Optim 56(2):559–568Google Scholar
  21. 21.
    Wu L, Du H, Wu W, Li D, Lv J, Lee W (2013) Approximations for Minimum Connected Sensor Cover. IEEE INFOCOMGoogle Scholar
  22. 22.
    Anil Kumar VS, Arya S, Ramesh H (2000) Hardness of set cover with intersection 1. Lecture notes in computer science 1853, Springer-Verlag, pp 624–635Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  1. 1.Harbin Institute of Technology Shenzhen Graduate SchoolShenzhenChina

Personalised recommendations