### Mobile coverage algorithm based on virtual force in WSN

DANG Xiaochao1，2, SHEN Sicheng1, HAO Zhanjun1，2, ZHAO Hongzhang1, XU Yuejiao1

1. 1.College of Computer Science and Engineering, Northwest Normal University, Lanzhou 730070, China
2.Gansu IOT Research Center, Lanzhou 730070, China
• Online:2016-06-01 Published:2016-06-14

### WSN中基于虚拟力的移动覆盖算法

1. 1.西北师范大学 计算机科学与工程学院，兰州 730070
2.甘肃省物联网工程研究中心，兰州 730070

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.