ABSTRACT
The main focus of this work is directed towards distributed coordination algorithms for coverage in a mobile sensor network. The sensors are assumed to have nonidentical sensing ranges, and it is desired to move them in such a way that the total sensing coverage increases as much as possible. To this end, the field is partitioned using the multiplicatively weighted Voronoi cells, and then different geometric methods are developed to find new locations for the sensors such that the coverage is improved. The proposed algorithms are iterative, and use the available local information to place the sensors properly, aiming to reduce the size of the coverage holes in the network. Simulations demonstrate the good performance of the proposed algorithms.
