Coordinate-free k-coverage hole detection algorithm in wireless sensor networks

作     者：Ma Wenyu Yan Feng Zuo Xuzhou Xia Weiwei Shen Lianfeng 马文钰;燕锋;左旭舟;夏玮玮;沈连丰

作者机构：National Mobile Communications Research LaboratorySoutheast UniversityNanjing 210096China School of Information and Software EngineeringUniversity of Electronic Science and Technology of ChinaChengdu 610054China 

出 版 物：《Journal of Southeast University(English Edition)》 (东南大学学报（英文版）)

年 卷 期：2019年第35卷第1期

页      面：8-15页

核心收录：

学科分类：080904[工学-电磁场与微波技术] 0810[工学-信息与通信工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 080202[工学-机械电子工程] 08[工学] 080402[工学-测试计量技术及仪器] 0804[工学-仪器科学与技术] 081001[工学-通信与信息系统] 0802[工学-机械工程] 

基　　金：The National Natural Science Foundation of China(No.61601122 61471164 61741102) 

主　　题：k-coverage hole detection k-coverage wireless sensor networks 

摘      要：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.