Skip to main content
SpringerLink
Log in

Connected sensor cover and related problems

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

Given a target region Ω and a set of n homogeneous sensors, we study the problem of finding a minimum subset of sensors such that they induce a connected graph and cover Ω. We present a new method to replace the target region Ω by a set of target points, \(\mathcal {P}\). In addition, we will give a new analysis for some existing approximation algorithms of the above minimum connected sensor cover problem. The new analysis will give better approximation performance ratios.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Alam SMN, Haas ZJ (2006) Coverage and connectivity in three-dimensional networks. MobiCom’06

  2. Berman P, Calinescu G, Shah C, Zelikovsky A (2005) Efficient energy management in sensor networks. In: Xiao Y, Pan Y (eds) Ad hoc and sensor networks, wireless networks and mobile computing. Nova Science Publishers, p 2

  3. Berman P, Calinescu G, Shah C, Zelikovsky A (2004) Power efficient monitoring management in sensor networks. In: IEEE wireless communication and networking conference (WCNC’04), Atlanta, pp 2329–2334

  4. Cardei M, Thai M, Li Y, Wu W (2005) Energy- efficient target coverage in wireless sensor networks. IEEE INFOCOM 2005. Miami

  5. Cardei M, Wu J, Lu N, Pervaiz MO (2005) Maximum network lifetime with adjustable range. In: IEEE international conference on wireless and mobile computing, networking and communications (WiMob’05)

  6. Fakcharoenphol J, Rao S, Talwar K (2003) A tight bound on approxi- mating arbitrary metrics by tree metrics. In: Proceedings of STOC’03. ACM, New York, pp 448–455

  7. Funke S, Kesselman A, Kuhn F, Lotker Z, Segal M (2007) Improved approximation algorithms for connected sensor cover. Wirel Netw 13:153–164

    Article  Google Scholar 

  8. Garg N, Konjevod G, Ravi R (2000) A polylogarithmic approximation algorithm for the group Steiner tree problem. SODA

  9. Ghosh A, Das SK (2005) A distributed greedy algorithm for connec- ted sensor cover in dense sensor networks. LNCS 3560:340–353

  10. Gupta H, Das SR, Gu Q (2003) Connected sensor cover: self-organization of sensor networks for efficient query execution. MobiHoc’03, pp 189–200

  11. Huang L, Li J, Shi Q (2015) Approximation algorithms for the connected sensor cover problem. COCOON, pp. 183–196

  12. Min M, Du H, Jia X, Huang CX, Huang SC-H, Wu W (2006) Improving construction for connected dominating set with Steiner tree in wireless sensor networks. J Glob Optim 35(1):111–119

    Article  MathSciNet  MATH  Google Scholar 

  13. Mustafa N, Ray S (2009) PTAS for geometric hitting set problems via local search. In: Proceedings of SoCG 2009. ACM, New York, pp 17–22

  14. Wu L, Du H, Wu W, Li D, Lv J, Lee W (2013) Approximations for minimum connected sensor cover. INFOCOM

  15. Xing G, Wang X, Zhang Y, Liu C, Pless R, Gill C (2005) Integrated coverage and connectivity configuration for energy conser- vation in sensor networks. ACM Trans Sensor Netw 1(1):36–72

    Article  Google Scholar 

  16. Zhang H, Hou JC (2005) Maintaining sensing coverage and connectivity in large sensor networks. Ad Hoc & Sensor Wireless Netw 1:89–124

    Google Scholar 

  17. Zhou Z, Das S, Gupta H (2004) Connected k-coverage problem in sensor networks. In: Proceedings of the 13th international conference on computer communications and networks, pp 373–378

  18. Zhou Z, Das SR, Gupta H (2009) Variable radii connected sensor cover in sensor networks. ACM Trans Sensor Netw 5:1

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Engineering, Columbia University, New York, NY, 10027, USA

    Yingfan L. Du

  2. Department of Computer Science, University of Texas at Tyler, Tyler, TX, 75799, USA

    Lidong Wu

Authors
  1. Yingfan L. Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lidong Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lidong Wu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Du, Y.L., Wu, L. Connected sensor cover and related problems. Peer-to-Peer Netw. Appl. 10, 1299–1303 (2017). https://doi.org/10.1007/s12083-016-0442-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-016-0442-7

Keywords

Search

Navigation