Skip to main content
SpringerLink
Log in

Hybrid approximation for minimum-cost target coverage in wireless sensor networks

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

This paper presents a hybrid approximation scheme for the Max-SNP-complete minimum-cost target coverage problem in wireless sensor networks. LP-rounding and set-cover selection are polynomial-time approximations for this problem. Our hybrid scheme combines these two methods using a crafted convex combination. We show that the hybrid scheme with appropriately chosen coefficients produces much better approximations than either of the two methods used alone. We show that, through a large number of numerical experiments, the hybrid scheme never exceeds an approximation ratio of 1.14, providing up to 14.86% improvement over the best approximations previously known.

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

Similar content being viewed by others

References

  1. Cardei, M., Wu, J.: Coverage in wireless sensor networks. In: Ilyas, M., Magboub, I. (eds.) Handbook of Sensor Networks. CRC Press (2004)

  2. Chakrabarty K., Iyengar S.S., Qi H., Cho E.: Grid coverage for surveillance and target location in distributed sensor networks. IEEE Trans. Comput. 51(12), 1448–1453 (2002)

    Article  MathSciNet  Google Scholar 

  3. Hochbaum D.: Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems. In: Hochbaum, D. (eds) Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, Boston (1997)

    Google Scholar 

  4. Rajagopalan S., Vazirani V.V.: Primal-dual RNC approximation algorithms for set cover and covering integer programs. SIAM J. Comput. 28, 526–541 (1999)

    MathSciNet  Google Scholar 

  5. Sahni S., Xu X.: Algorithms for wireless sensor networks. Int. J. Distr. Sensor Netw. 1(1), 35–56 (2005)

    Article  Google Scholar 

  6. Vazrani V.V.: Approximation Algorithms. Springer, New York (2001)

    Google Scholar 

  7. Wang J., Zhong N.: Efficient point coverage in wireless sensor networks. J. Comb. Optim. 11, 291–305 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  8. Wang J., Zhong N.: Minimum-cost sensor arrangement for achieving wanted coverage lifetime. Int. J. Sensor Netw. 3(3), 165–174 (2008)

    Article  Google Scholar 

  9. Yu, Z., Wang, J.: Reliable sensor arrangement for achieving wanted coverage lifetime with minimum cost. In: Proceedings of the 2nd International Conference on Wireless Algorithms, Systems and Applications (WASA’07), Chicago, pp. 95–102. IEEE Computer Society Press, August 2007

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Massachusetts, Lowell, MA, 01854, USA

    Zheng Fang & Jie Wang

Authors
  1. Zheng Fang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jie Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zheng Fang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fang, Z., Wang, J. Hybrid approximation for minimum-cost target coverage in wireless sensor networks. Optim Lett 4, 371–381 (2010). https://doi.org/10.1007/s11590-009-0167-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-009-0167-0

Keywords

Search

Navigation