Browse > Article

Analysis for a TSP Construction Scheme over Sensor Networks  

Kim, Joon-Mo (Computer Science & Engineering, Dankook University)
Publication Information
Journal of the Institute of Electronics Engineers of Korea TC / v.47, no.11, 2010 , pp. 1-6 More about this Journal
Abstract
In Sensor Networks, the problem of finding the optimal routing path dynamically, which passes through all terminals or nodes once per each, may come up. Providing a generalized scheme of approximations that can be applied to the kind of problems, and formulating the bounds of the run time and the results of the algorithm made from the scheme, one may evaluate mathematically the routing path formed in a given network. This paper, dealing with Euclidean TSP(Euclidean Travelling Sales Person) that represents such problems, provides the scheme for constructing the approximated Euclidean TSP by parallel computing, and the ground for determining the difference between the approximated Euclidean TSP produced from the scheme and the optimal Euclidean TSP.
Keywords
Sensor Networks; Approximation Algorithm; Euclidean TSP; Rectangular Partition; Routing;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 S. Arora, "Nearly linear time approximation schemes for Euclidean TSP and other geometric problems," Proc. 38th IEEE Symp. on Foundations of Computer Science, pp. 554-563, 1997.
2 X. Cheng, J.-M. Kim and B. Lu, "A Polynomial Time Approximation Scheme for the Problem of Interconnecting Highways," Journal of Combinatorial Optimization, Vol 5, issue 3, pp. 327-343, 2001.   DOI   ScienceOn
3 J. Park and C. Choi, "Bayes Stopping Rule for MAC Scheme in Wireless Sensor Networks," Journal of IEEK, vol. 45-TC, no. 7, pp.53-61, July 2008.   과학기술학회마을
4 J. Park, J. Ha and C. Choi, "Bayesian Cognizance of RFID Tegs," Journal of IEEK, vol. 46-TC, no. 5, pp.524-531, May 2009.   과학기술학회마을
5 N. Christofides, "Worst-case analysis of a new heuristic for the travelling salesman problem," Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, Report 388, 1976.
6 Robert Sedgewick and Kevin Wayne, "Minimum Spanning Tree lecture notes," Computer Science, Princeton University, 226: Algorithms & Data Structures, Spring 2007.
7 Atul Verma, Hemjit Sawant, Jindong Tan, "Selection and Navigation of Mobile Sensor Nodes Using a Sensor Network," Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications, p.41-50, March 08-12, 2005.
8 S. Arora, "Polynomial-time approximation schemes for Euclidean TSP and other geometric problems," Proc. 37th IEEE Symp. on Foundations of Computer Science, pp. 2-12, 1996.