Skip to main content

POSTER: Approximation Algorithm for Minimizing the Size of Coverage Hole in Wireless Sensor Networks

  • Conference paper
Distributed Computing and Networking (ICDCN 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7730))

Included in the following conference series:

  • 1494 Accesses

Abstract

Covering a bounded region with minimum number of homogeneous sensor nodes is an NP-complete problem [1]. In this article we have introduced a variation of area coverage problem in which the boundary sensor nodes of a coverage hole are allowed to move towards the hole for minimizing the size of the hole. We have shown that this problem is NP-hard. A ρ −approximation algorithm is proposed to solve this problem, where 2 ≤ ρ ≤ 3 and O(ΔlogΔ + k 2) is the time complexity.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Li, J., Wang, R., Huang, H., Sun, L.: Voronoi-based coverage optimization for directional sensor networks. Wireless Sensor Network 1(5), 417–424 (2009)

    Article  Google Scholar 

  2. Wang, G., Cao, G., LaPorta, T.F.: Movement-assisted sensor deployment. IEEE Trans. Mob. Comput. 5(6), 640–652 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gorain, B., Mandal, P.S., Das, S. (2013). POSTER: Approximation Algorithm for Minimizing the Size of Coverage Hole in Wireless Sensor Networks. In: Frey, D., Raynal, M., Sarkar, S., Shyamasundar, R.K., Sinha, P. (eds) Distributed Computing and Networking. ICDCN 2013. Lecture Notes in Computer Science, vol 7730. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35668-1_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35668-1_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35667-4

  • Online ISBN: 978-3-642-35668-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics