Copyright © 2006 Elsevier B.V. All rights reserved.
Received 6 September 2005;
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







E-mail Article
Add to my Quick Links

Cited By in Scopus (3)







