대한전자공학회논문지TC (Journal of the Institute of Electronics Engineers of Korea TC)

대한전자공학회 (The Institute of Electronics and Information Engineers)
권호 표지

센서네트워크 상의 TSP 경로구성 방법에 대한 분석

Analysis for a TSP Construction Scheme over Sensor Networks

  • Kim, Joon-Mo (Computer Science & Engineering, Dankook University)
  • 투고 : 2010.04.19
  • 심사 : 2010.11.10
  • 발행 : 2010.11.25
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

센서네트워크 등에서 단말 또는 노드들을 한 번씩 모두 방문하는 최적의 라우팅 경로를 동적으로 찾는 문제가 대두된다. 이러한 문제를 근사하게 해결 할 수 있는 일반화된 scheme을 제시하고, 이를 기반으로 구성되는 알고리즘의 실행시간 및 그 결과의 바운드를 수리적으로 정립하면, 주어진 네트워크에서 구축되는 라우팅 경로를 수리적으로 분석 할 수 있게 된다. 본 논문은 이러한 문제를 대표하는 Euclidean TSP(Euclidean Travelling Sales Person) 문제를 대상으로 하여, 근사 Euclidean TSP를 병렬처리 형태로 구성할 수 있는 scheme을 제공하고, 이 scheme에 의해 구해 질 수 있는 근사 Euclidean TSP가 최적의 Euclidean TSP와 어느 정도의 차이를 가지게 되는지 판단할 수 있는 기준을 제시한다.

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.

키워드

참고문헌

  1. 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.
  2. 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.
  3. 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.
  4. 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. https://doi.org/10.1023/A:1011497227406
  5. 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.
  6. 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.
  7. 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.
  8. Robert Sedgewick and Kevin Wayne, "Minimum Spanning Tree lecture notes," Computer Science, Princeton University, 226: Algorithms & Data Structures, Spring 2007.