Self-deployment algorithms for field coverage in a network of nonidentical mobile sensors: Vertex-based approach

In this paper, efficient deployment algorithms are proposed for a mobile sensor network to enlarge the coverage area. The proposed algorithms calculate the position of the sensors iteratively based on existing coverage holes in the field. To this end, the multiplicatively weighted Voronoi (MW-Voronoi) diagram is used for a network of mobile sensors with different sensing ranges. Under the proposed procedures, the sensors move in such a way that the coverage holes in the network are reduced. Simulation results are provided to demonstrate the effectiveness of the deployment schemes proposed in this paper.