Vector method based coverage hole recovery in wireless sensor networks
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Mobile sensor deployment in unknown fields
INFOCOM'10 Proceedings of the 29th conference on Information communications
Review: From wireless sensor networks towards cyber physical systems
Pervasive and Mobile Computing
Review: A survey on coverage and connectivity issues in wireless sensor networks
Journal of Network and Computer Applications
The fast scalable sensor efficiency measure in a hybrid sensor network
International Journal of Ad Hoc and Ubiquitous Computing
Characteristic function of connectivity with obstacles
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Hi-index | 0.00 |
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.