一种Sweep Coverage问题的插入启发式算法
A novel insert heuristic algorithm for Sweep Coverage problem

作为一种能满足特定场景监控需求的网络覆盖类型, Sweep Coverage能够通过使用较少的节点来完成对Points of Interest(POI)的覆盖. 为了改进以前的Sweep Coverage机制在覆盖间隔相差较大时的性能, 本文提出了一种新的考虑了路径增量与覆盖间隔差异的插入启发式(Coverage Different Insert Heuristic) CDIH算法. 实验结果表明, 在相同的网络监控场景中, 新的启发式算法较以往的覆盖机制均能有较好的表现.
As a new improvement of coverage technologies of wireless sensor networks, sweep coverage can satisfy surveillance requirements with less number of sensor nodes than conventional static coverage for some particular applications. To improve the performance of existing Sweep Coverage approaches in the scenarioes where POIs may have varying coverage interval, in this paper, a novel insert heuristic scheme is proposed. In this proposed scheme, path increment and difference of coverage interval are introduced as the metrics for route building. Experimental results show that the proposed scheme has better performance than the exsiting approaches