Browse > Article

An Approximation Scheme For A Geometrical NP-Hard Problem  

Kim, Joon-Mo (Electronics & Computer Engineering, Dankook University)
Publication Information
Journal of the Institute of Electronics Engineers of Korea TC / v.44, no.8, 2007 , pp. 62-67 More about this Journal
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.
Keywords
Sensor networks; interconnection; deployment; optimizations;
Citations & Related Records
연도 인용수 순위
  • Reference
1 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
2 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   DOI   ScienceOn
3 http://enl.usc.edu/~ningxu/papers/survey.pdf
4 F. K. Hwang, D. S. Richards and P. Winter, 'The Steiner Tree Problem,' Annals of Discrete Mathematics, North-Holland, vol.53, 1992
5 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
6 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
7 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   DOI   ScienceOn