RaceTrack: An Approximation Algorithm for the Mobile Sink Routing Problem

In large-scale monitoring applications, randomly deployed wireless sensor networks may not be fully connected. Using mobile sink for data collection is one of the feasible solutions. For energy saving, it is necessary to plan a shortest route for the mobile sink. Mobile sink routing problem can be regarded as a special case of TSP with neighborhoods (TSPN) problem. In this paper, we propose a novel approximation algorithm called RaceTrack. This algorithm forms a "racetrack" based on the TSP route, which is constructed from the locations of the deployed sensor nodes. By using inner lane heuristic and concave bend heuristic of auto racing, and a shortcut finding step, we optimize the obtained TSP route within O(n) computation time. Through formal proofs and large-scale simulations, we verified that our RaceTrack algorithm can achieve a good approximation ratio.

[1]  Maria E. Orlowska,et al.  On the Optimal Robot Routing Problem in Wireless Sensor Networks , 2007 .

[2]  Liu Run-tao.  A Simple and Fast Algorithm for Detecting the Convexity and Concavity of Vertices for an Arbitrary Polygon , 2002 .

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

[4]  Qing Zhang,et al.  Stochastic Analysis, Control, Optimization and Applications , 2012 .

[5]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[6]  Sanjeev Arora,et al.  Nearly Linear Time Approximation Schemes for Euclidean TSP and Other Geometric Problems , 1997, RANDOM.

[7]  Esther M. Arkin,et al.  Approximation Algorithms for the Geometric Covering Salesman Problem , 1994, Discret. Appl. Math..

[8]  Eylem Ekici,et al.  Responsible Editor: I.F. Akyildiz , 2006 .

[9]  Rajesh K. Gupta,et al.  Improving the Data Delivery Latency in Sensor Networks with Controlled Mobility , 2008, DCOSS.

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

[11]  Khaled M. Elbassioni,et al.  Approximation Algorithms for Euclidean Group TSP , 2005, ICALP.

[12]  Wei Hong,et al.  A macroscope in the redwoods , 2005, SenSys '05.

[13]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[14]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[15]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration in wireless sensor networks , 2003, SenSys '03.

[16]  Subhash Suri,et al.  Catching elephants with mice: sparse sampling for monitoring sensor networks , 2007, SenSys '07.

[17]  Joachim Gudmundsson,et al.  A Fast Approximation Algorithm for TSP with Neighborhoods , 1999, Nord. J. Comput..

[18]  Guoliang Xing,et al.  Rendezvous design algorithms for wireless sensor networks with a mobile base station , 2008, MobiHoc '08.