Journal of Computer Applications ›› 2020, Vol. 40 ›› Issue (9): 2698-2705.DOI: 10.11772/j.issn.1001-9081.2019122115

• Network and communications • Previous Articles     Next Articles

Lightweight coverage hole detection algorithm based on relative position of link intersections

HAN Yulao1, FANG Dingyi2   

  1. 1. School of Mathematics and Computer Science, Panzhihua University, Panzhihua Sichuan 617000, China;
    2. School of Information Science and Technology, Northwest University, Xi'an Shaanxi 710127, China
  • Received:2019-12-17 Revised:2020-02-24 Online:2020-09-10 Published:2020-05-15
  • Supported by:
    This work is partially supported by the Youth Program of the National Natural Science Foundation of China (61602379, 61802309, 61501372), the Project of Sichuan Provincial Department of Education (20180432,20180435), the Doctoral Research Fund of Panzhihua University (035200076).


韩雨涝1, 房鼎益2   

  1. 1. 攀枝花学院 数学与计算机学院, 四川 攀枝花 617000;
    2. 西北大学 信息科学与技术学院, 西安 710127
  • 通讯作者: 韩雨涝
  • 作者简介:韩雨涝(1981-),男,陕西礼泉人,讲师,博士,主要研究方向:无线传感器网络、无线网络;房鼎益(1959-),男,陕西西安人,教授,博士,CCF会员,主要研究方向:无线传感器网络关键技术、软件安全与保护。
  • 基金资助:

Abstract: Coverage holes in Wireless Sensor Network (WSN) cause poor network performance and low network service quality. To solve these problems, a Coverage Hole Detection Algorithm based on Relative Position of Intersections (CHDARPI) was proposed. First, the hole boundary nodes were defined and Relative Position of Intersections (RPI) of the link between adjacent boundary nodes was calculated. Then, the starting node of hole detection was selected based on the policy of Number of Incomplete Coverage Intersections (NICI) priority, which guaranteed the concurrent detection of the connected coverage holes. Finally, in the process of coverage hole detection, the message of hole detection was limited within the hole boundary nodes, and the forwarding strategies under different scenarios were formulated according to the sizes of the direction angles of the forwarding nodes, which ensured the efficiency of coverage hole detection. The simulation results show that, compared with the existing Distributed Coverage Hole Detection algorithm (DCHD) and Distributed Least Polar Angle algorithm (DLPA), the proposed CHDARPI decreases the average detection time and detection energy consumption by at least 15.2% and 16.7%.

Key words: Wireless Sensor Network (WSN), coverage hole, relative position, concurrent hole detection, hole boundary node

摘要: 针对无线传感器网络(WSN)覆盖空洞导致网络性能和服务质量下降的问题,提出了一种基于链路交点相对位置信息的覆盖空洞检测算法(CHDARPI)。首先,定义空洞边界节点并计算相邻边界节点间链路的交点相对位置(RPI)值;然后,采用基于未完全覆盖交点数量(NICI)优先的策略选择空洞检测的发起节点,保证了连通覆盖空洞的并发检测。最后,在空洞检测过程中,将空洞检测消息局限于空洞边界节点之内,并根据转发节点方向角的大小制定不同场景下的转发策略,保证了空洞检测的效率。仿真结果表明:与现有基于边界节点的分布式覆盖空洞检测算法(DCHD)和基于分布式最小极角的覆盖空洞检测算法(DLPA)相比,CHDARPI在平均空洞检测时间和检测能耗方面分别至少下降了15.2%和16.7%。

关键词: 无线传感器网络, 覆盖空洞, 相对位置, 并发空洞检测, 空洞边界节点

CLC Number: