非并行二分法的覆盖空洞修复算法  

Coverage Hole Repair Algorithm Based on Non-parallel Dichotomy

作　　者：韩雨涝 HAN Yulao(School of Mathematics and Computer,Panzhihua University,Panzhihua,Sichuan 617000,China)

机构地区：[1]攀枝花学院数学与计算机学院,四川攀枝花617000

出　　处：《计算机工程与应用》2020年第12期87-92,共6页Computer Engineering and Applications

基　　金：国家自然科学青年基金(No.61602379,No.61802309,No.6150372);四川省教育厅项目(No.20180432,No.20180435)。

摘　　要：针对无线传感器网络覆盖空洞影响网络服务质量问题,提出非并行二分法的分布式覆盖空洞修复算法CHRND,算法采用非并行方式选择具有劣弧的空洞边界节点作为覆盖空洞修复的驱动节点,采用基于弧二分法确定移动节点最佳目标位置。仿真实验结果表明,移动节点引入使得空洞不被分割基础上,CHRND算法能以较少数量移动节点实现覆盖空洞的完全修复。Aiming at the problem about network service quality of wireless sensor network caused by coverage holes, this paper proposes a distributed coverage holes repair algorithm CHRND based on non-parallel dichotomy. The CHRND selects the hole boundary nodes with minor arc as the driving node for repairing coverage holes by using non-parallel mode, and determines the optimal target position of mobile node based on arc dichotomy. Emulation experiments show that the algorithm can completely repair the coverage holes with a certain number of mobile nodes.

关 键 词：无线传感器网络 覆盖空洞 移动节点 空洞修复 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]