Speed control and scheduling of data mules in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Fast track article: Designing hierarchical sensor networks with mobile data collectors
Pervasive and Mobile Computing
Path Planning of Data Mules in Sensor Networks
ACM Transactions on Sensor Networks (TOSN)
Data Collection in Wireless Sensor Networks with Mobile Elements: A Survey
ACM Transactions on Sensor Networks (TOSN)
International Journal of Ad Hoc and Ubiquitous Computing
Analyzing multi-hop routing feasibility for sensor data harvesting using mobile sinks
Journal of Parallel and Distributed Computing
Efficient data collection from wireless nodes under the two-ring communication model
International Journal of Robotics Research
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
| Hi-index | 0.00 |
A data mule represents a mobile device that collects data in a sensor field by physically visiting the nodes in a sensor network. The data mule collects data when it is in the proximity of a sensor node. This can be an alternative to multihop forwarding of data when we can utilize node mobility in a sensor network. To be useful, a data mule approach needs to minimize data delivery latency. In this paper, we first formulate the problem of minimizing the latency in the data mule approach. The data mule scheduling (DMS) problem is a scheduling problem that has both location and time constraints. Then, for the 1D case of the DMS problem, we design an efficient heuristic algorithm that incorporates constraints on the data mule motion dynamics. We provide lower bounds of solutions to evaluate the quality of heuristic solutions. Through numerical experiments, we show that the heuristic algorithm runs fast and yields good solutions that are within 10 percent of the optimal solutions.