Skip to main content
Conference Proceedings

POSTER: Approximation algorithm for minimizing the size of coverage hole in wireless sensor networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 7730 LNCS 463-464
DOI: 10.1007/978-3-642-35668-1_40
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Covering a bounded region withminimum 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 Δ + k2) is the time complexity. © Springer-Verlag 2013.

Cite

CITATION STYLE

APA

Gorain, B., Mandal, P. S., & Das, S. (2013). POSTER: Approximation algorithm for minimizing the size of coverage hole in wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7730 LNCS, pp. 463–464). https://doi.org/10.1007/978-3-642-35668-1_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free