Path Planning of Data Mules in Sensor Networks

摘要: We study the problem of planning motion “data mules” for collecting data from stationary sensor nodes in wireless networks. Use mules significantly reduces energy consumption at compared to commonly used multihop forwarding approaches, but has a drawback that it increases latency delivery. Optimizing mules, including path and speed, is critical improving delivery making mule approach more useful practice. In this article, we focus on selection problem: finding optimal so can be minimized. formulate as graph capable expressing benefit larger communication range. The NP-hard present approximation algorithms both single-data case multiple-data case. further consider which have only partial knowledge range, where design semionline improve offline plan using online runtime. Simulation experiments Matlab ns2 demonstrate our produce shorter lengths previously proposed methods, suggesting controlled mobility exploited much effectively.