Mobility limited flip-based sensor networks deployment

被引:62
作者
Chellappan, Sriram
Bai, Xiaole
Ma, Bin
Xuan, Dong
Xu, Changqing
机构
[1] Ohio State Univ, Dept Comp Sci & Engn, Dreese Labs 395, Columbus, OH 43210 USA
[2] Univ Western Ontario, Middlesex Coll 366, Dept Comp Sci, London, ON N6A 5B7, Canada
[3] Shanghai Jiao Tong Univ, Dept Elect Engn, Shanghai 200030, Peoples R China
基金
美国国家科学基金会;
关键词
sensor networks deployment; limited mobility; flip-based sensors;
D O I
10.1109/TPDS.2007.28
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
An important phase of sensor networks operation is deployment of sensors in the field of interest. Critical goals during sensor networks deployment include coverage, connectivity, load balancing, etc. A class of work has recently appeared, where mobility in sensors is leveraged to meet deployment objectives. In this paper, we study deployment of sensor networks using mobile sensors. The distinguishing feature of our work is that the sensors in our model have limited mobilities. More specifically, the mobility in the sensors we consider is restricted to a flip, where the distance of the flip is bounded. We call such sensors as flip-based sensors. Given an initial deployment of flip-based sensors in a field, our problem is to determine a movement plan for the sensors in order to maximize the sensor network coverage and minimize the number of flips. We propose a minimum-cost maximum-flow-based solution to this problem. We prove that our solution optimizes both the coverage and the number of flips. We also study the sensitivity of coverage and the number of flips to flip distance under different initial deployment distributions of sensors. We observe that increased flip distance achieves better coverage and reduces the number of flips required per unit increase in coverage. However, such improvements are constrained by initial deployment distributions of sensors due to the limitations on sensor mobility.
引用
收藏
页码:199 / 211
页数:13
相关论文
共 22 条
[1]  
BOSE P, 1999, P INT WORKSH DISCR A
[2]  
BULUSU N, 2001, P IEEE INT C DISTR C
[3]  
CLOUQUEUR T, 2002, P ACM INT C WIR SENS
[4]  
Cormen T. H., 2001, Introduction to Algorithms, V2nd
[5]   An efficient implementation of a scaling minimum-cost flow algorithm [J].
Goldberg, AV .
JOURNAL OF ALGORITHMS, 1997, 22 (01) :1-29
[6]  
GOLDBERG AV, 1987, P ACM S THEOR COMP S
[7]  
GOLDBERG AV, 1998, P SCAND WORKSH ALG T
[8]  
Heinzelman W., 2000, P 33 ANN HAW INT C S, DOI DOI 10.1109/HICSS.2000.926982
[9]  
HOWARD A, 2002, AUTONOMOUS ROBOT SEP
[10]  
Howard A., 2002, P INT S DISTR AUT RO