Connectivity-Guaranteed and Obstacle-Adaptive Deployment Schemes for Mobile Sensor Networks
Tan, G., Jarvis, S.A. and Kermarrec, A.M. (2008) Connectivity-Guaranteed and Obstacle-Adaptive Deployment Schemes for Mobile Sensor Networks. In: 28th IEEE International Conference on Distributed Computing Systems (ICDCS 2008), Beijing, China.
|PDF - Published Version |
Download (849Kb) | Preview
Mobile sensors can relocate and self-deploy into a network. While focusing on the problems of coverage, existing deployment schemes largely over-simplify the conditions for network connectivity: they either assume that the communication range is large enough for sensors in geometric neighborhoods to obtain location information through local communication, or they assume a dense network that remains connected. In addition, an obstacle-free field or full knowledge of the field layout is often assumed. We present new schemes that are not governed by these assumptions, and thus adapt to a wider range of application scenarios. The schemes are designed to maximize sensing coverage and also guarantee connectivity for a network with arbitrary sensor communication/sensing ranges or node densities, at the cost of a small moving distance. The schemes do not need any knowledge of the field layout, which can be irregular and have obstacles/holes of arbitrary shape. Our first scheme is an enhanced form of the traditional virtual-force-based method, which we term the Connectivity-Preserved Virtual Force (CPVF) scheme. We show that the localized communication, which is the very reason for its simplicity, results in poor coverage in certain cases. We then describe a Floor-based scheme which overcomes the difficulties of CPVF and, as a result, significantly outperforms it and other state-of-the-art approaches. Throughout the paper our conclusions are corroborated by the results from extensive simulations.
|Item Type:||Conference or Workshop Item (Paper)|
|Uncontrolled Keywords:||pcav hpsg mobile sensor network peer distributed overlay connectivity|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Divisions:||Faculty of Science > Computer Science|
|Depositing User:||Simon Hammond|
|Date Deposited:||20 Oct 2010 16:40|
|Last Modified:||23 Feb 2012 09:09|
Actions (login required)