A distributed self-relocating algorithm for randomly deployed mobile wireless sensors

This paper introduces a distributed self-relocation algorithm used in mobile wireless sensor networks with random initial deployments. The algorithm aims at changing the relative distance of the sensors in different directions and converging within ten rounds. Simulation results show the algorithm produces a 95% coverage ratio on average in all different initial deployments with average initial coverage ratio from 50% to 80%. Results also show the algorithm works for different sensing models such as binary model and probability model. The algorithm is also robust against inaccurate geo-location information.