Deakin home > Deakin University Library > Deakin Research Online > Decentralized mobility models for data collection in wireless sensor networks
Openly accessible

Decentralized mobility models for data collection in wireless sensor networks

Hanoun, Samer, Creighton, Douglas and Nahavandi, Saeid 2008, Decentralized mobility models for data collection in wireless sensor networks, in ICRA 2008 : IEEE International Conference on Robotics and Automation, IEEE, Piscataway, N.J., pp. 1030-1035.

Attached Files (Some files may be inaccessible until you login with your Deakin Research Online credentials)
Name Description MIMEType Size Downloads
nahavandi-decentralizedmobility-2008.pdf Published version application/pdf 294.41KB 88

Title Decentralized mobility models for data collection in wireless sensor networks
Author(s) Hanoun, Samer
Creighton, Douglas
Nahavandi, Saeid
Conference name IEEE International Conference on Robotics and Automation (2008 : Pasadena, Calif.)
Conference location Pasadena, Calif.
Conference dates 19-23 May 2008
Title of proceedings ICRA 2008 : IEEE International Conference on Robotics and Automation
Editor(s) [Unknown]
Publication date 2008
Conference series International Conference on Robotics and Automation
Start page 1030
End page 1035
Publisher IEEE
Place of publication Piscataway, N.J.
Summary Controlled mobility in wireless sensor networks provides many benefits towards enhancing the network performance and prolonging its lifetime. Mobile elements, acting as mechanical data carriers, traverse the network collecting data using single-hop communication, instead of the more energy demanding multi-hop routing to the sink. Scaling up from single to multiple mobiles is based more on the mobility models and the coordination methodology rather than increasing the number of mobile elements in the network. This work addresses the problem of designing and coordinating decentralized mobile elements for scheduling data collection in wireless sensor networks, while preserving some performance measures, such as latency and amount of data collected. We propose two mobility models governing the behaviour of the mobile element, where the incoming data collection requests are scheduled to service according to bidding strategies to determine the winner element. Simulations are run to measure the performance of the proposed mobility models subject to the network size and the number of mobile elements.
Notes ©2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
ISBN 9781424416479
Language eng
Field of Research 099999 Engineering not elsewhere classified
HERDC Research category E1 Full written paper - refereed
Copyright notice ©2008, IEEE
Persistent URL http://hdl.handle.net/10536/DRO/DU:30018206

Document type: Conference Paper
Collections: School of Engineering and Information Technology
Open Access Collection
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in Deakin Research Online is owned by the author, with all rights reserved.

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 2 times in Scopus
Access Statistics: 379 Abstract Views, 88 File Downloads  -  Detailed Statistics
Created: Fri, 14 Aug 2009, 14:06:00 EST