ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Computer Networks
Volume 50, Issue 17, 5 December 2006, Pages 3449-3465
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (492 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.comnet.2006.01.008    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2006 Elsevier B.V. All rights reserved.

Data harvesting with mobile elements in wireless sensor networksstar, open

Yaoyao Gua, E-mail The Corresponding Author, Doruk Bozdağa, E-mail The Corresponding Author, Robert W. Brewera, E-mail The Corresponding Author and Eylem EkiciCorresponding Author Contact Information, a, E-mail The Corresponding Author

aDepartment of Electrical and Computer Engineering, Ohio State University, 2015 Neil Avenue, 205 Dreese Lab., Columbus, OH 43210, United States

Received 6 September 2005; 
revised 23 January 2006; 
accepted 24 January 2006. 
Responsible Editor: I.F. Akyildiz. 
Available online 7 March 2006.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

In recent studies, using mobile elements (MEs) as mechanical carriers to relay data has been shown to be an effective way of prolonging sensor network life time and relaying information in partitioned networks. As the data generation rates of sensors may vary, some sensors need to be visited more frequently than others. In this paper, a partitioning-based algorithm is presented that schedules the movements of MEs in a sensor network such that there is no data loss due to buffer overflow. Simulation results show that the proposed Partitioning-Based Scheduling (PBS) algorithm performs well in terms of reducing the minimum required ME speed to prevent data loss, providing high predictability in inter-visit durations, and minimizing the data loss rate for the cases when the ME is constrained to move slower than the minimum required ME speed.

Keywords: Sensor networks; Sensor–actor; Mobility; Scheduling; Path planning; Data collection

Article Outline

1. Introduction
2. Related work
3. Partitioning-Based Scheduling algorithm
3.1. Problem formulation and notation
3.2. The proposed PBS algorithm
3.2.1. Bin partitioning according to overflow times
3.2.2. Sub-bin partitioning according to locations
3.2.3. Forming a TSP solution on each sub-bin
3.2.4. Forming the supercycle
3.3. Data transfer time considerations
3.4. Discussion of minimum required speed
3.5. Time complexity analysis
4. Performance evaluation
4.1. Metrics and methodology
4.2. Impact of the ME speed on data loss
4.3. Impact of node density on minimum required ME speed
4.4. Impact of number of bins on data loss
4.5. Impact of buffer size
4.6. Impact of transmission rate
4.7. Sensor visit predictability
5. Conclusion and future work
References
Vitae














Computer Networks
Volume 50, Issue 17, 5 December 2006, Pages 3449-3465
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.