Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

Connectivity-Guaranteed and Obstacle-Adaptive Deployment Schemes for Mobile Sensor Networks

Tools
- Tools
+ Tools

Tan, G., Jarvis, Stephen 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. Published in: IEEE Transactions on Mobile Computing, 8 (6). pp. 836-848.

Full text not available from this repository.
Official URL: http://dx.doi.org/10.1109/TMC.2009.31

Abstract

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 Item (Paper)
Subjects: Q Science > QA Mathematics > QA75 (Please use QA76 Electronic Computers. Computer Science)
Divisions: Faculty of Science > Computer Science
Journal or Publication Title: IEEE Transactions on Mobile Computing
Publisher: IEEE
ISSN: 1536-1233
Date: June 2008
Volume: 8
Number: 6
Page Range: pp. 836-848
Identification Number: 10.1109/TMC.2009.31
Status: Peer Reviewed
Publication Status: Published
Conference Paper Type: Paper
Title of Event: 28th IEEE International Conference on Distributed Computing Systems (ICDCS 2008)
Type of Event: Conference
Location of Event: Beijing, China
Related URLs:
  • Other Repository
URI: http://wrap.warwick.ac.uk/id/eprint/47635

Request changes to a record

Actions (login required)

View Item View Item
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us