Approximation algorithms for the geometric covering salesman problem
Discrete Applied Mathematics
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Approximation algorithms for TSP with neighborhoods in the plane
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Proceedings of the 3rd international conference on Embedded networked sensor systems
Catching elephants with mice: sparse sampling for monitoring sensor networks
Proceedings of the 5th international conference on Embedded networked sensor systems
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
A fast approximation algorithm for TSP with neighborhoods and red-blue separation
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Approximation algorithms for euclidean group TSP
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
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.