2016
DOI: 10.3390/s16122183
|View full text |Cite
|
Sign up to set email alerts
|

Local Coverage Optimization Strategy Based on Voronoi for Directional Sensor Networks

Abstract: In this paper, we study the area coverage of directional sensor networks (DSNs) with random node distribution. The coverage of DSNs depends on the sensor’s locations, the sensing radiuses, and the working directions, as well as the angle of view (AoV), which is challenging to analyze. We transform the network area coverage problem into cell coverage problems by exploiting the Voronoi diagram, which only needs to optimize local coverage for each cell in a decentralized way. To address the cell coverage problem,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
19
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
6
3
1

Relationship

1
9

Authors

Journals

citations
Cited by 30 publications
(20 citation statements)
references
References 16 publications
0
19
0
Order By: Relevance
“…Due to the typically large search space and the density of local extrema of the cost function, area coverage problems challenge traditional optimization schemes. Methods found in the literature range for instance from connected subgraphs [17], a generalized virtual field approach [18], and repulsive potential fields [19] to Voronoi diagrams [14]. To address the DSN placement problem in a numerical way, genetic algorithms (GA) [20] have emerged as a particularly useful tool [12], [13].…”
Section: Related Workmentioning
confidence: 99%
“…Due to the typically large search space and the density of local extrema of the cost function, area coverage problems challenge traditional optimization schemes. Methods found in the literature range for instance from connected subgraphs [17], a generalized virtual field approach [18], and repulsive potential fields [19] to Voronoi diagrams [14]. To address the DSN placement problem in a numerical way, genetic algorithms (GA) [20] have emerged as a particularly useful tool [12], [13].…”
Section: Related Workmentioning
confidence: 99%
“…A Voronoi diagram is also known as a Thiessen polygon or Dirichlet tessellation, which offers an effective solution for partitioning a plane into a few regions [ 38 ]. It has been used in various fields like local coverage optimization of wireless sensor network [ 39 ], interferometric synthetic aperture radar (InSAR) fine registration [ 40 ], and optimal allocation of dynamic reactive power sources [ 41 ]. The general idea of the Voronoi diagram is to partition the plane into regions according to the locations of a set of sites.…”
Section: Proposed Localization Systemmentioning
confidence: 99%
“…So the optimization of large-scale sensor deployment is limited. Zhang et al [11] and Sung and Yang [12] exploit the Voronoi diagram to transform the network area coverage problem into cell coverage problems, which reduces the variable number and the calculation complexity in local area, but it is based on a relatively uniform distribution of the sensors at the initial moment, which is difficult to realize because of the random distribution by aircraft.…”
Section: Introductionmentioning
confidence: 99%