Cart (Loading....) | Create Account
Close category search window
 

An Efficient Scheduling Algorithm for Data Collection through Multi-path Routing Structures in Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hai Van Luu ; Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore, Singapore ; Xueyan Tang

Multi-path routing is essential in wireless sensor data collection to overcome the high loss rates in wireless environments. In this paper, we propose an efficient scheduling algorithm for data collection through multi-path routing structures in wireless sensor networks. The message complexity of our proposed scheduling algorithm is O(n(Δ + 3)), where n is the number of sensor nodes in the network and Δ is the maximum node degree. The best existing scheduling algorithm for single-path routing structures has the message complexity of O(n(χ + Δ + 2)), where χ is the number of 2-hop neighbors of a sensor node. The complexity of the proposed scheduling algorithm is a significant improvement since χ is normally on the order of O(Δ2). In addition, we also develop a method for deriving a (super) lower bound on the shortest possible length of the data collection schedule generated by any algorithm. Extensive experimental results show that the proposed scheduling algorithm produces good data collection schedules with greatly reduced running time and fewer messages generated as compared to existing algorithms. The length of the data collection schedule produced by our algorithm is within 2.3 times of the lower bound estimate across a wide range of network settings.

Published in:

Mobile Ad-hoc and Sensor Networks (MSN), 2010 Sixth International Conference on

Date of Conference:

20-22 Dec. 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.