基于节点移动的WSNs覆盖空洞修复算法

Node Moving-Based Coverage Hole Repair Algorithm in Wireless Sensor Networks

提出了一种基于移动节点的覆盖空洞修复(MNCHR)算法。MNCHR算法利用一跳邻居节点修复空洞,进而维持覆盖和网络连通率。MNCHR算法首先通过节点剩余能量、覆盖冗余率以及移动距离信息计算节点的权值,再择优选择修复节点,并由修复节点修复空洞。与基于最小懒惰距离(MDL)算法和基于自模糊逻辑空洞覆盖算法(FSHC)相比,MNCHR算法能够在移动较短距离情况下,完成空洞的修复,减少了能耗。

Node moving-based coverage hole repair algorithm(MNCHR)was proposed.MNCHR automatically repaired the holes using information from the one-hop neighbors to restore coverage and connectivity of the network.MNCHR algorithm considered their coverage redundancy,residual energy,and moving distance to select a suitable replacement to cover it.Our results from extensive simulation analysis reveal that the proposed MNCHR algorithm outperforms MDL and FSHC algorithm in terms of coverage reclamation and energy consumption.