东南大学学报（英文版）2019，Vol.35Issue(1)：8-15,8.DOI:10.3969/j.issn.1003-7985.2019.01.002
无线传感器网络中无坐标信息的k-覆盖空洞检测算法
Coordinate-free k-coverage hole detection algorithm in wireless sensor networks
摘要
Abstract
For wireless sensor networks, a simple and accurate coordinate-free k-coverage hole detection scheme is proposed. First, an algorithm is presented to detect boundary cycles of 1-coverage holes. The algorithm consists of two components, named boundary edge detection and boundary cycle detection. Then, the 1-coverage hole detection algorithm is extended to k-coverage hole scenarios. A coverage degree reduction scheme is proposed to find an independent covering set of nodes in the covered region of the target field and to reduce the coverage degree by one through sleeping those nodes. Repeat the 1-coverage hole detection algorithm and the higher order of coverage holes can be found. By iterating the above steps for k-1 times, the boundary edges and boundary cycles of all k-coverage holes can be discovered. Finally, the proposed algorithm is compared with a location-based coverage hole detection algorithm. Simulation results indicate that the proposed algorithm can accurately detect over 99％ coverage holes.关键词
k-覆盖空洞检测/k-覆盖/无线传感器网络Key words
k-coverage hole detection/k-coverage/wireless sensor networks分类
信息技术与安全科学引用本文复制引用
马文钰,燕锋,左旭舟,夏玮玮,沈连丰..无线传感器网络中无坐标信息的k-覆盖空洞检测算法[J].东南大学学报（英文版）,2019,35(1):8-15,8.基金项目
The National Natural Science Foundation of China (No.61601122, 61471164, 61741102) （No.61601122, 61471164, 61741102）
