Reducing sensors´ movement using simple iterative virtual movement

Mobility has been suggested as a way to improve the coverage of wireless sensor networks. However, increased mobility to improve coverage makes a rise in the consumed power. The best proposed solution in such settings is virtual movement algorithms, although they are not effective in clustered networks. In this paper, an iterative structure has been proposed for virtual movement algorithms which in addition to solving the problem with clustered networks, ensures the minimal mobility required for optimal coverage. Simulation results of the proposed algorithm indicate its efficacy is more than the VEC, FBPC and FOA algorithms. The algorithm allows the desirable coverage and high convergence of the network while keeping the average movement for each node low.