Answers are grounded in this paper and cite their sources.
In Wireless Sensor Networks, mobile elements (MEs) as powered carriers to convey data has been shown to be an actualway of persisting sensor network life time and transmitting information in segregated networks.As the data generation amounts of sensors may vary, some sensors need to be visited more recurrently than others.In this paper, a partitioning-based algorithm is presented that schedules the activities of MEs in a sensor network such that there is no data loss due to buffer excess.Simulation results show that the proposed Partitioning-Based Scheduling (PBS) algorithm performs well in terms of dipping 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 controlled to move slower than the minimum required ME speed.
No takes yet. Share an insight, caveat, or question.
Shiv Om Tiwari (2014) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: