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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Li, J., Wang, R., Huang, H., Sun, L.: Voronoi-based coverage optimization for directional sensor networks. Wireless Sensor Network 1(5), 417–424 (2009)
Wang, G., Cao, G., LaPorta, T.F.: Movement-assisted sensor deployment. IEEE Trans. Mob. Comput. 5(6), 640–652 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)