2017 27th International Telecommunication Networks and Applications Conference (ITNAC) 2017
DOI: 10.1109/atnac.2017.8215433
|View full text |Cite
|
Sign up to set email alerts
|

Effect of the number of participating nodes on recovery of WSN coverage holes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 19 publications
0
2
0
Order By: Relevance
“…LeDiR algorithm autonomously repositions a subset of the sensor nodes to restore connectivity with minimal topology changes. Rafiei et al [26] devise a node relocation algorithm to recover large-scale coverage holes. e effects of the number of participating sensor nodes and movement iterations are examined in Voronoi-based node 2…”
Section: Related Workmentioning
confidence: 99%
“…LeDiR algorithm autonomously repositions a subset of the sensor nodes to restore connectivity with minimal topology changes. Rafiei et al [26] devise a node relocation algorithm to recover large-scale coverage holes. e effects of the number of participating sensor nodes and movement iterations are examined in Voronoi-based node 2…”
Section: Related Workmentioning
confidence: 99%
“…A large number of studies have been devoted to detecting and recovering coverage holes [ 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 , 11 , 12 , 13 , 14 , 15 ]. However, most existing approaches [ 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 16 , 17 , 18 , 19 , 20 , 21 , 22 ] are based on an assumption that the sensing range of a sensor node is like a disk (as shown in Figure 1 a) with the centre of the disk as a sensor.…”
Section: Introductionmentioning
confidence: 99%