The Community for Technology Leaders
Green Image
Issue No. 06 - June (2009 vol. 8)
ISSN: 1536-1233
pp: 836-848
Guang Tan , INRIA-Rennes, Rennes
Stephen A. Jarvis , The University of Warwick, Coventry
Anne-Marie Kermarrec , INRIA-Rennes, Rennes
ABSTRACT
Mobile sensors can relocate and self-deploy into a network. While focusing on the problems of coverage, existing deployment schemes largely oversimplify 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.
INDEX TERMS
Sensor networks, mobile, deployment, connectivity.
CITATION

A. Kermarrec, S. A. Jarvis and G. Tan, "Connectivity-Guaranteed and Obstacle-Adaptive Deployment Schemes for Mobile Sensor Networks," in IEEE Transactions on Mobile Computing, vol. 8, no. , pp. 836-848, 2009.
doi:10.1109/TMC.2009.31
92 ms
(Ver 3.3 (11022016))