Optimal Distributed Blanket Coverage Self-Deployment of Mobile Wireless Sensor Networks

We propose a novel distributed random algorithm for self-deployment of a network of mobile wireless sensors in the problem of blanket coverage. The aim is to deploy sensors in a bounded region so that any point of the region is sensed by at least one sensor. The algorithm is based only on information about the closest neighbours of each sensor. The monitoring region is of an arbitrary shape and not known to the sensors a priori. We give mathematically rigorous proofs of asymptotic optimality and convergence with probability 1 of the proposed algorithm.

[1]  Andrey V. Savkin,et al.  A distributed self-deployment algorithm for the coverage of mobile wireless sensor networks , 2009, IEEE Communications Letters.

[2]  Daji Qiao,et al.  Critical Conditions for Connected-k-Coverage in Sensor Networks , 2008, IEEE Communications Letters.

[3]  R. Kershner.  The Number of Circles Covering a Set , 1939 .

[4]  M. Cao,et al.  A Lower Bound on Convergence of a Distributed Network Consensus Algorithm , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[5]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[6]  Chih-Yung Chang,et al.  Obstacle-Resistant Deployment Algorithms for Wireless Sensor Networks , 2009, IEEE Transactions on Vehicular Technology.