Optimal Deployment for Target-Barrier Coverage Problems in Wireless Sensor Networks

Target-barrier coverage problems are a new emerging issue in wireless sensor networks. However, it is a challenge to achieve target barriers for randomly distributed targets in the surveillance region. In this paper, we propose a deterministic deployment algorithm to find the minimum number of requi...

Full description

Saved in:
Bibliographic Details
Published in:IEEE systems journal 2021-06, Vol.15 (2), p.2241-2244
Main Authors: Si, Pengju, Wang, Shuaishuai, Shu, Lei, Ning, Rui, Fu, Zhumu
Format: Article
Language:English
Subjects:
Algorithms
Coverage
Minimization
Sensor phenomena and characterization
Silicon
Surveillance
target barrier
Wireless networks
Wireless sensor networks
wireless sensor networks (WSNs)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Target-barrier coverage problems are a new emerging issue in wireless sensor networks. However, it is a challenge to achieve target barriers for randomly distributed targets in the surveillance region. In this paper, we propose a deterministic deployment algorithm to find the minimum number of required sensors for a given region. The algorithm first constructs a target-barrier circle for each target. Then, it utilizes the merged properties of target-barrier circles to derive the shortest length of target barriers. Our extensive experiments demonstrate that the proposed algorithm can construct target-barrier coverage effectively with minor deployment costs.
ISSN:1932-8184
1937-9234
DOI:10.1109/JSYST.2020.2990395