2019
DOI: 10.1155/2019/7542324
|View full text |Cite
|
Sign up to set email alerts
|

Target Detection Coverage Algorithm Based on 3D-Voronoi Partition for Three-Dimensional Wireless Sensor Networks

Abstract: The detection of target events is an important research area in the field of wireless sensor networks (WSNs). In recent years, many researchers have discussed the problem of WSN target coverage in a two-dimensional (2D) coordinate system. However, the target detection problem in a 3D coordinate system has not been investigated extensively, and it is difficult to improve the network coverage ratio while ensuring reliable performance of WSN. In addition, sensor nodes that are initially deployed randomly cannot a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 17 publications
(13 citation statements)
references
References 31 publications
0
11
0
Order By: Relevance
“…Therefore, based on the typical literature [14,25], this paper improves and extends the Voronoi method, making it suitable for 3D DSNs target coverage. In this paper, we propose a dynamic adjustment optimisation algorithm for 3D DSNs based on a spherical sector coverage model.…”
Section: Related Workmentioning
confidence: 99%
See 4 more Smart Citations
“…Therefore, based on the typical literature [14,25], this paper improves and extends the Voronoi method, making it suitable for 3D DSNs target coverage. In this paper, we propose a dynamic adjustment optimisation algorithm for 3D DSNs based on a spherical sector coverage model.…”
Section: Related Workmentioning
confidence: 99%
“…In the early research of two dimensional DSN coverage, nodes are randomly distributed in the plane and divided into the 2D Voronoi method. As shown in Figure 5, given a set of sensor nodes s i = fs 1 , s 2 ,⋯,s n g, the bounded plane is divided into polygonal cells K i = fK 1 , K 2 ,⋯,K n g, such that each cell K i contains exactly one of the sensor nodes s i , where s i is called the K i -divided generation node [14,30]. Furthermore, according to the partitioning property of the Voronoi diagram, the distance Dðs i , TÞ from any point T in cell K i to s i is shorter than the distance Dðs j , TÞ between the point T and the neighbour nodes of s i .…”
Section: Network Coverage Model and Anglementioning
confidence: 99%
See 3 more Smart Citations