2018
DOI: 10.1007/s10586-017-1665-y
|View full text |Cite
|
Sign up to set email alerts
|

A coverage hole detection and repair algorithm in wireless sensor networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
7
0
1

Year Published

2018
2018
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 13 publications
(8 citation statements)
references
References 7 publications
0
7
0
1
Order By: Relevance
“…In [18], the authors dynamically analyze the network and determine the coverage holes. Firstly, the network topology is analyzed based on a simple subnet.…”
Section: Related Workmentioning
confidence: 99%
“…In [18], the authors dynamically analyze the network and determine the coverage holes. Firstly, the network topology is analyzed based on a simple subnet.…”
Section: Related Workmentioning
confidence: 99%
“…A coverage hole detection and repair algorithm is proposed for solving the network disconnection problem [15]. The algorithm dynamically analyses the network topology based on maximum simple subnet and determines the boundary node of the empty area.…”
Section: Related Workmentioning
confidence: 99%
“…In general, algorithms to recognize different coverage holes within the sensor networks can be divided into two main classes, depending on the system domains and the degree of data constraints such probabilistic approaches and computational geometry based approaches. Compared to the probabilistic approaches, the computational geometry based approaches improve the precision of identification by finding the accurate size and shape of the coverage holes by coordinate information on the nodes and by providing better information for restoring of coverage holes [6,7].…”
Section: Introductionmentioning
confidence: 99%