On the Optimal Robot Routing Problem in Wireless Sensor Networks

Given a set of sparsely distributed sensors in the Euclidean plane, a mobile robot is required to visit all sensors to download the data and finally return to its base. The effective range of each sensor is specified by a disk, and the robot must at least reach the boundary to start communication. The primary goal of optimization in this scenario is to minimize the traveling distance by the robot. This problem can be regarded as a special case of the traveling salesman problem with neighborhoods (TSPN), which is known to be NP-hard. In this paper, we present a novel TSPN algorithm for this class of TSPN, which can yield significantly improved results compared to the latest approximation algorithm.

[1]  Parameswaran Ramanathan,et al.  Fault tolerance in collaborative sensor networks for target detection , 2004, IEEE Transactions on Computers.

[2]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[3]  Yu Hen Hu,et al.  Detection, classification, and tracking of targets , 2002, IEEE Signal Process. Mag..

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

[5]  Xiuzhen Cheng,et al.  iTPS: an improved location discovery scheme for sensor networks with long-range beacons , 2005, J. Parallel Distributed Comput..

[6]  Chang-Tien Lu,et al.  Detecting spatial outliers with multiple attributes , 2003, Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence.

[7]  S. Sitharama Iyengar,et al.  Distributed Bayesian algorithms for fault-tolerant event region detection in wireless sensor networks , 2004, IEEE Transactions on Computers.

[8]  Terry Jones,et al.  Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms , 1995, ICGA.

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

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

[11]  Vic Barnett,et al.  Outliers in Statistical Data , 1980 .

[12]  Dimitrios Gunopulos,et al.  Distributed deviation detection in sensor networks , 2003, SGMD.

[13]  Wei Hong,et al.  Model-Driven Data Acquisition in Sensor Networks , 2004, VLDB.

[14]  Hans-Paul Schwefel,et al.  Evolution and optimum seeking , 1995, Sixth-generation computer technology series.

[15]  Joachim Gudmundsson,et al.  TSP with neighborhoods of varying size , 2005, J. Algorithms.

[16]  Chang-Tien Lu,et al.  Algorithms for spatial outlier detection , 2003, Third IEEE International Conference on Data Mining.

[17]  Ramesh Govindan,et al.  Localized edge detection in sensor fields , 2003, Ad Hoc Networks.

[18]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[19]  E. Lawler,et al.  Erratum: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1986 .

[20]  Carol A. Gotway,et al.  Statistical tools for regional data analysis using GIS , 2003, GIS '03.

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

[22]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[23]  Ahmed Helmy,et al.  Location-centric isolation of misbehavior and trust routing in energy-constrained sensor networks , 2004, IEEE International Conference on Performance, Computing, and Communications, 2004.

[24]  Marcus Gallagher,et al.  On the importance of diversity maintenance in estimation of distribution algorithms , 2005, GECCO '05.

[25]  Oded Schwartz,et al.  On the complexity of approximating tsp with neighborhoods and related problems , 2003, computational complexity.

[26]  Joseph S. B. Mitchell,et al.  Approximation algorithms for geometric tour and network design problems (extended abstract) , 1995, SCG '95.

[27]  Jessica Staddon,et al.  Efficient tracing of failed nodes in sensor networks , 2002, WSNA '02.

[28]  Xiuzhen Cheng,et al.  An asymptotic analysis of some expert fusion methods , 2001, Pattern Recognit. Lett..

[29]  Parameswaran Ramanathan,et al.  Distributed target classification and tracking in sensor networks , 2003 .

[30]  Xiuzhen Cheng,et al.  Localized fault-tolerant event boundary detection in sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[31]  Nikolaus Hansen,et al.  Completely Derandomized Self-Adaptation in Evolution Strategies , 2001, Evolutionary Computation.

[32]  Marcus Gallagher,et al.  Experimental results for the special session on real-parameter optimization at CEC 2005: a simple, continuous EDA , 2005, 2005 IEEE Congress on Evolutionary Computation.

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

[34]  Jürgen Branke,et al.  Evolutionary optimization in uncertain environments-a survey , 2005, IEEE Transactions on Evolutionary Computation.