Minimum Latency Multiple Data MULE Trajectory Planning in Wireless Sensor Networks

This paper investigates the problem of computing the optimal trajectories of multiple data MULEs (e.g., robots, vehicles, etc.) to minimize data collection latency in wireless sensor networks. By relying on a slightly different assumption, we define two interesting problems, the k-traveling salesperson problem with neighborhood ( k-TSPN) and the k-rooted path cover problem with neighborhood ( k-PCPN). Since both problems are NP-hard, we propose constant factor approximation algorithms for them along with two simpler heuristic algorithms. We also conduct simulations to compare the performance of the proposed approaches with the existing alternatives. Our simulation results indicate that the proposed algorithms outperform the competitors on average.

[1]  Yuanyuan Yang,et al.  SenCar: An Energy-Efficient Data Gathering Mechanism for Large-Scale Multihop Sensor Networks , 2006, IEEE Transactions on Parallel and Distributed Systems.

[2]  Xiuzhen Cheng,et al.  Localized Outlying and Boundary Data Detection in Sensor Networks , 2007 .

[3]  Refael Hassin,et al.  Approximation Algorithms for Min-Max Tree Partition , 1997, J. Algorithms.

[4]  Andreas Terzis,et al.  Using mobile robots to harvest data from sensor fields , 2009, IEEE Wireless Communications.

[5]  Chul E. Kim,et al.  Approximation algorithms for some routing problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[6]  Yang Yang,et al.  Minimum Spanning Tree with Neighborhoods , 2007, AAIM.

[7]  Eytan Modiano,et al.  Minimizing transmission energy in sensor networks via trajectory control , 2010, 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.

[8]  Ashutosh Sabharwal,et al.  Using Predictable Observer Mobility for Power Efficient Design of Sensor Networks , 2003, IPSN.

[9]  Rajesh K. Gupta,et al.  Speed control and scheduling of data mules in sensor networks , 2010, TOSN.

[10]  Joseph S. B. Mitchell,et al.  Approximation algorithms for TSP with neighborhoods in the plane , 2001, SODA '01.

[11]  Maria E. Orlowska,et al.  On the Optimal Robot Routing Problem in Wireless Sensor Networks , 2007, IEEE Transactions on Knowledge and Data Engineering.

[12]  Donghyun Kim,et al.  Minimizing data collection latency in wireless sensor network with multiple mobile elements , 2012, 2012 Proceedings IEEE INFOCOM.

[13]  Shahzad Sarwar,et al.  Power consumption in wireless sensor networks , 2009, FIT.

[14]  Joseph S. B. Mitchell,et al.  A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane , 2010, SCG.

[15]  Waylon Brunette,et al.  Data MULEs: modeling a three-tier architecture for sparse sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[16]  R. Ravi,et al.  Min-max tree covers of graphs , 2004, Oper. Res. Lett..

[17]  Christos H. Papadimitriou,et al.  The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..

[18]  Charles R. Farrar,et al.  A different approach to sensor networking for shm: Remote powering and interrogation with unmanned aerial vehicles , 2007 .

[19]  Esther M. Arkin,et al.  Approximations for minimum and min-max vehicle routing problems , 2006, J. Algorithms.

[20]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.