TY - GEN
T1 - Connectivity-guaranteed and obstacle-adaptive deployment schemes for mobile sensor networks
AU - Tan, Guang
AU - Jarvis, Stephen A.
AU - Kermarrec, Anne Marie
PY - 2008/8/12
Y1 - 2008/8/12
N2 - Mobile sensors can move and self-deploy into a network. While focusing on the problems of coverage, existing deployment schemes mostly over-simplify the conditions for network connectivity: they either assume that the communication range is large enough for sensors in geometric neighborhoods to obtain each other's location by local communications, or assume a dense network that remains connected. At the same time, an obstacle-free field or full knowledge of the field layout is often assumed. We present new schemes that are not restricted by these assumptions, and thus adapt to a much wider range of application scenarios. While maximizing sensing coverage, our schemes can achieve 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. Simulations results show that the proposed schemes achieve the targeted properties.
AB - Mobile sensors can move and self-deploy into a network. While focusing on the problems of coverage, existing deployment schemes mostly over-simplify the conditions for network connectivity: they either assume that the communication range is large enough for sensors in geometric neighborhoods to obtain each other's location by local communications, or assume a dense network that remains connected. At the same time, an obstacle-free field or full knowledge of the field layout is often assumed. We present new schemes that are not restricted by these assumptions, and thus adapt to a much wider range of application scenarios. While maximizing sensing coverage, our schemes can achieve 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. Simulations results show that the proposed schemes achieve the targeted properties.
UR - http://www.scopus.com/inward/record.url?scp=51849084699&partnerID=8YFLogxK
U2 - 10.1109/ICDCS.2008.49
DO - 10.1109/ICDCS.2008.49
M3 - Conference contribution
AN - SCOPUS:51849084699
SN - 9780769531724
T3 - Proceedings of the International Conference on Distributed Computing Systems
SP - 429
EP - 437
BT - The 28th International Conference on Distributed Computing Systems
PB - IEEE
T2 - 28th International Conference on Distributed Computing Systems, ICDCS 2008
Y2 - 17 July 2008 through 20 July 2008
ER -