Message Ferrying: Proactive Routing in Highly-Partitioned Wireless Ad Hoc Networks
FTDCS '03 Proceedings of the The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Approximation algorithms for TSP with neighborhoods in the plane
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Intelligent fluid infrastructure for embedded networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Data collection, storage, and retrieval with an underwater sensor network
Proceedings of the 3rd international conference on Embedded networked sensor systems
Approximation Algorithms for Scheduling Multiple Feasible Interval Jobs
RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Data gathering tours in sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
Controllably Mobile Infrastructure for Low Energy Embedded Networks
IEEE Transactions on Mobile Computing
Data harvesting with mobile elements in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improving wireless simulation through noise modeling
Proceedings of the 6th international conference on Information processing in sensor networks
Mobile Element Scheduling with Dynamic Deadlines
IEEE Transactions on Mobile Computing
SenCar: An Energy-Efficient Data Gathering Mechanism for Large-Scale Multihop Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Rendezvous Planning in Mobility-Assisted Wireless Sensor Networks
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Rendezvous design algorithms for wireless sensor networks with a mobile base station
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Improving the Data Delivery Latency in Sensor Networks with Controlled Mobility
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
On the Optimal Robot Routing Problem in Wireless Sensor Networks
IEEE Transactions on Knowledge and Data Engineering
Optimal Speed Control of Mobile Node for Data Collection in Sensor Networks
IEEE Transactions on Mobile Computing
Using mobile robots to harvest data from sensor fields
IEEE Wireless Communications
Speed control and scheduling of data mules in sensor networks
ACM Transactions on Sensor Networks (TOSN)
SenCar: an energy efficient data gathering mechanism for large scale multihop sensor networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Approximation algorithms for euclidean group TSP
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Mobility-based communication in wireless sensor networks
IEEE Communications Magazine
TrainSense: a novel infrastructure to support mobility in wireless sensor networks
EWSN'13 Proceedings of the 10th European conference on Wireless Sensor Networks
| Hi-index | 0.02 |
We study the problem of planning the motion of “data mules” for collecting the data from stationary sensor nodes in wireless sensor networks. Use of data mules significantly reduces energy consumption at sensor nodes compared to commonly used multihop forwarding approaches, but has a drawback in that it increases the latency of data delivery. Optimizing the motion of data mules, including path and speed, is critical for improving the data delivery latency and making the data mule approach more useful in practice. In this article, we focus on the path selection problem: finding the optimal path of data mules so that the data delivery latency can be minimized. We formulate the path selection problem as a graph problem that is capable of expressing the benefit from larger communication range. The problem is NP-hard and we present approximation algorithms for both single-data mule case and multiple-data mules case. We further consider the case in which we have only partial knowledge of communication range, where we design semionline algorithms that improve the offline plan using online knowledge at runtime. Simulation experiments on Matlab and ns2 demonstrate that our offline and semionline algorithms produce significantly shorter path lengths and data delivery latency compared to previously proposed methods, suggesting that controlled mobility can be exploited much more effectively.