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

被引:41
作者
Savkin, Andrey V. [1 ]
Javed, Faizan [1 ]
Matveev, Alexey S. [1 ]
机构
[1] Univ New S Wales, Sch Elect Engn & Telecommun, Sydney, NSW 2052, Australia
基金
澳大利亚研究理事会;
关键词
Wireless sensor networks; mobile sensor networks; sensor deployment; distributed algorithms; blanket coverage; randomized algorithms;
D O I
10.1109/LCOMM.2012.040912.110932
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
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.
引用
收藏
页码:949 / 951
页数:3
相关论文
共 6 条
[1]  
Cao M., P 2005 IEEE C DEC CO
[2]   Obstacle-Resistant Deployment Algorithms for Wireless Sensor Networks [J].
Chang, Chih-Yung ;
Chang, Chao-Tsun ;
Chen, Yu-Chieh ;
Chang, Hsu-Ruey .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2009, 58 (06) :2925-2941
[3]   A Distributed Self-Deployment Algorithm for the Coverage of Mobile Wireless Sensor Networks [J].
Cheng, Teddy M. ;
Savkin, Andrey V. .
IEEE COMMUNICATIONS LETTERS, 2009, 13 (11) :877-879
[4]   Coordination of groups of mobile autonomous agents using nearest neighbor rules [J].
Jadbabaie, A ;
Lin, J ;
Morse, AS .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2003, 48 (06) :988-1001
[5]   The number of circles covering a set [J].
Kershner, R .
AMERICAN JOURNAL OF MATHEMATICS, 1939, 61 :665-671
[6]   Critical conditions for connected-k-coverage in sensor networks [J].
Yang, Guanqun ;
Qiao, Daji .
IEEE COMMUNICATIONS LETTERS, 2008, 12 (09) :651-653