Abstract: It’s a very popular algorithm idea that sensor mobility is exploited essentially to obtain an improved stationary network configuration. Since in the sparse wireless sensor network, there is no need to make every point of the target area monitored all the time, and the coverage rate is quite low using the popular algorithm idea. In this paper, it proposes a mobile maximum coverage algorithm based on sustaining mobility, in which it uses virtual force to get workspace for every sensor node, and also the theorem of equal circumference is imported to shorten the moving distance and reduce the overlapped area and sensing energy. The experimental results show that the algorithm in this paper can improve the coverage rate effectively, and the energy effectiveness of the network is improved greatly. Obviously, it has well utility.

Key words: wireless sensor network, virtual force, dynamic coverage, concentric circles, moving track, mobility

摘要： 以往移动覆盖算法的主流思想通常为：根据特定算法移动部署好传感节点后，转为静态无线传感器网络进行工作，即网络只在节点部署阶段处于移动状态。针对稀疏无线传感器网络按此思想覆盖率极低，并且通常网络也只需对目标区域实现动态覆盖的问题，提出了基于虚拟力的移动覆盖算法。算法采用虚拟力思想部署节点，划分出节点工作区，并依据等周定理规划出移动轨道，以最小化节点移动距离，并减少重叠覆盖面积，降低感知能耗。仿真实验结果表明，该算法实现了对目标区域的高覆盖率，并有效提高了网络的能量利用率，具有较强实用性。

关键词: 无线传感器网络, 虚拟力, 动态覆盖, 同心圆, 移动轨道, 移动性