A Multi-hop Dynamic Connectivity and Maintenance Algorithm for Wireless Sensor Networks

This paper presents a multi-hop dynamic moving algorithm to repair the coverage holes, while maintaining the initial topology and connectivity, for the wireless sensor networks. In such environment, the movement of each sensor node is fully distributed and autonomous. The proposed algorithm takes the density measures into consideration for determining which node to move and to what direction and distance iteratively to heal the holes and also to maximize the overall coverage area. Simulation results suggest that the proposed algorithm outperforms other maintenance algorithms in terms of coverage, convergence speed, and energy consumption.