期刊
IEEE SYSTEMS JOURNAL
卷 15, 期 2, 页码 2241-2244出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JSYST.2020.2990395
关键词
Wireless sensor networks; Surveillance; Sensor phenomena and characterization; Silicon; Minimization; Coverage; target barrier; wireless sensor networks (WSNs)
类别
资金
- National Natural Science Foundation of China [U1704157]
- Scientific and Technological Innovation Leaders in Central Plains [194200510012]
- Science, Technology Innovative Teams in University of Henan Province [18IRTSTHN011]
- Key Scientific Research Projects of Universities in Henan Province [19A413007, 20A120008]
- National Thirteen-Five Equipment Pre-Research Foundation of China [61403120207, 61402100203]
The paper introduces a deterministic deployment algorithm for finding the minimum number of sensors required to effectively construct target-barrier coverage in a surveillance region, with extensive experiments showing significant results.
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据