Intelligent Sensing, Situation Management, Impact Assessment, and Cyber-Sensing 2009
DOI: 10.1117/12.819294
|View full text |Cite
|
Sign up to set email alerts
|

Decentralized detection and patching of coverage holes in wireless sensor networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
26
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 28 publications
(26 citation statements)
references
References 21 publications
0
26
0
Order By: Relevance
“…During patching coverage hole, for providing conditions of patching hole, the first step is to detect coverage hole [4,11] to accurately determine the direction and size of the hole. In this study, we adopt a hole detection algorithm [4] to achieve the boundary of hole.…”
Section: A Coverage Hole Detectionmentioning
confidence: 99%
See 1 more Smart Citation
“…During patching coverage hole, for providing conditions of patching hole, the first step is to detect coverage hole [4,11] to accurately determine the direction and size of the hole. In this study, we adopt a hole detection algorithm [4] to achieve the boundary of hole.…”
Section: A Coverage Hole Detectionmentioning
confidence: 99%
“…For example, SOI algorithm [3] figures out the optimal inner nodes, and then moves mobile sensor nodes to the new position. Or to deploy new sensor nodes on the holeboundary bisectors [4] patch coverage holes. In [5], it adopts the basic principle that the static sensor nodes guide mobile sensor nodes to reach the optimum position and recover the coverage holes.…”
Section: Introductionmentioning
confidence: 99%
“…Overall, they are positively correlated. In order to explain the advantages of this strategy, the paper compares the coverage of the HPA strategy with the literature [4]. As can be seen from Figure 6, HPA can achieve 80% of the node coverage faster than HSNHRA, but after 90%, its node coverage increased slowly, and HSNHRA can reach 100% of the node coverage quickly.…”
Section: Simulation Experimentsmentioning
confidence: 99%
“…The representative are: Wang proposed the three distributed protocols of hole patching optimal target position by using Voronoi diagram to calculate the mobile node [3]. Yao proposed the HPA ( Hole Patching Algorithm ), the main idea of HPA is select a point along the perpendicular bisector between the boundary node of any two adjacent hole ,arrange a new node on the location to patch hole [4]. Wang and Li proposed strategy to using triangles based on mobile node one by one to repair hole [5].…”
Section: Introductionmentioning
confidence: 99%
“…Reference [8] proposed the Coverage Hole Patching Algorithm (CHPA), which selects the patching point along the perpendicular bisector between any two adjacent hole boundary nodes. The distances between the selected point and the corresponding two boundary nodes are equal to the communication radius.…”
Section: Introductionmentioning
confidence: 99%