2017
DOI: 10.1007/978-981-10-6388-6_18
|View full text |Cite
|
Sign up to set email alerts
|

An Algorithm for Hybrid Nodes Barrier Coverage Based on Voronoi in Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 16 publications
0
1
0
Order By: Relevance
“…This approach uses a voronoi polygon such that all its vertices are covered by a sensor node [8]. Basically, in voronoi polygon approach, polygons are drawn where the sensing area of nodes touches each other as shown in the figure 4 and based on the edges of these polygons the coverage is determined between any two points in the coverage area [9]. In case of Delaunay Triangulation all the sensor nodes whose sensing area (Voronoi Polygons share same edge) touches each other are connected to each other as shown in the figure below.…”
Section: Figure 3: Types Of Gridsmentioning
confidence: 99%
“…This approach uses a voronoi polygon such that all its vertices are covered by a sensor node [8]. Basically, in voronoi polygon approach, polygons are drawn where the sensing area of nodes touches each other as shown in the figure 4 and based on the edges of these polygons the coverage is determined between any two points in the coverage area [9]. In case of Delaunay Triangulation all the sensor nodes whose sensing area (Voronoi Polygons share same edge) touches each other are connected to each other as shown in the figure below.…”
Section: Figure 3: Types Of Gridsmentioning
confidence: 99%