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

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

An Approximation Scheme For A Geometrical NP-Hard Problem

기하학적 NP-hard 문제에 대한 근사 접근법

  • Kim, Joon-Mo (Electronics & Computer Engineering, Dankook University)
  • 김준모 (단국대학교 전자컴퓨터공학부)
  • Published : 2007.08.25
Download PDF
⟨ Previous Next ⟩

Abstract

In some wireless sensor networks, the sensor nodes are required to be located sparsely at designated positions over a wide area, introducing the problem of adding minimum number of relay nodes to interconnect the sensor nodes. The problem finds its form in literature: the Minimum number of Steiner Points. Since it is known to be NP-hard, this paper proposes an approximation scheme to estimate the minimum number of relay nodes through the properties of the abstract from. Reducing the number of nodes in a sensor network, the amount of data exchange over the net will be far decreased.

센서네트워크 중에는 센서노드들이 넓은 지역에 걸쳐 정해진 위치에 산재되어야 하는 경우가 있다. 이런 경우 센서노드들을 interconnect하기 위한 최소개수의 연결노드들을 추가하는 문제가 대두되며, 이는 The Minimum number of Steiner Points라는 추상화된 문제로 귀결된다. 이 문제는 NP-hard 문제이므로, 본 논문에서는 문제가 내포하는 기하학적인 성질을 이용하여 연결노드의 최소개수에 근접하는 방안을 제시한다. 센서네트워크에서 노드의 개수를 줄임으로써 네트워크 내부에서 오가는 메시지의 교환량이 대폭 감소하게 된다.

Keywords

References

  1. S. Meguerdichian, F. Koushanfar, M. Potkonjak and M. B. Srivastava, 'Coverage Problems in Wireless Ad-hoc Sensor Networks,' Proc. IEEE INFOCOM, vol.3, pp.22-26, 2001
  2. S. S. Dhillon and K. Chakrabarty, 'Sensor Placement for Effective Coverage and Surveillance in Distributed Sensor Networks,' Proc. IEEE Wireless Communications and Networking Conference, pp.1609-1614, 2003
  3. http://enl.usc.edu/~ningxu/papers/survey.pdf
  4. G.-H. Lin and G.L. Xue, 'Steiner tree problem with minimum number of Steiner points and bounded edge-length,' Information Processing Letters, vol.69, pp.53-57, 1999 https://doi.org/10.1016/S0020-0190(98)00201-4
  5. F. K. Hwang, D. S. Richards and P. Winter, 'The Steiner Tree Problem,' Annals of Discrete Mathematics, North-Holland, vol.53, 1992
  6. D. Chen, D.-Z. Du, X.-D. Hu, G.-H. Lin, L. Wang and G. Xue, 'Approximations for Steiner trees with minimum number of Steiner points,' Theoretical Computer Science, vol.262, pp.83-99, 2001 https://doi.org/10.1016/S0304-3975(00)00182-1
  7. 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