一种混合异构传感网的覆盖洞修补算法

传感网感知节点部署的随机性以及节点能耗殆尽、损坏退出等问题使网络中存在覆盖洞, 利用移动节点来修补覆盖空洞是当前较为可行的方法. 假定网络在静态节点和移动节点处混合, 并且在节点感知半径异构的情况下,研究如何通过移动节点重定位来修复感知覆盖洞, 同时兼顾移动距离或能耗最小以及修复后的感知覆盖率最大化来优化感知覆盖性能. 针对移动节点覆盖洞修补规划的NP-hard 问题, 结合遗传算法, 提出一种覆盖洞修补算法来求解最优解. 仿真实验结果表明, 所提出的算法相比于同类算法能够更有效地修补漏洞并兼顾节点能耗以及感知覆盖率.

A coverage hole repair algorithm for hybrid heterogeneous sensor networks

Coverage holes exist in the sense network due to random deployment of sensor nodes, node energy exhausted and damage, etc.. The method based on mobile nodes is feasible. It is assumed that sense nodes are heterogeneous with different sense radius and hybrid with static and mobile nodes. The main problem in this paper is how to schedule mobile sensor nodes in the proper position for repaired coverage holes while taking the minimum moved distance and the maximum coverage into account. It is a NP-hard problem that arranged mobile nodes repair coverage holes. Then a coverage hole repaired algorithm is present based on the genetic algorithm for optimal solutions. The simulation results show that the proposed algorithm can not only save more energy, but also obtain higher coverage compared with other similar algorithms.