Browse > Article

Interconnection Problem among the Dense Areas of Nodes in Sensor Networks  

Kim, Joon-Mo (Computer Science & Engineering, Dankook University)
Publication Information
Journal of the Institute of Electronics Engineers of Korea TC / v.48, no.2, 2011 , pp. 6-13 More about this Journal
Abstract
This paper deals with the interconnection problem in ad-hoc networks or sensor networks, where relay nodes are deployed additionally to form connections between given nodes. This problem can be reduced to a NP-hard problem. The nodes of the networks, by applications or geographic factors, can be deployed densely in some areas while sparsely in others. For such a case one can make an approximation scheme, which gives shorter execution time, for the additional node deployments by ignoring the interconnections inside the dense area of nodes. However, the case is still a NP-hard, so it is proper to establish a polynomial time approximation scheme (PTAS) by implementing a dynamic programming. The analysis can be made possible by an elaboration on making the definition of the objective function. The objective function should be defined to be able to deal with the requirement incurred by the substitution of the dense area with its abstraction.
Keywords
Sensor Networks; Graph Interconnection; NP-hard Problem; Approximation Algorithm; Steiner Tree Problem;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Z.A. Melzak, "On the problem of Steiner," Canadian Mathematics Bulletin, Vol. 4, pp. 143-148, 1961.   DOI
2 Ding-Zhu Du, Ker-I Ko, Theory of Computational Complexity, Wiley Inter-Science 2000.
3 Michael R. Garey, David S. Johnson, Computers and Intractability A Guide to the Theory of NP-Completeness, Freeman, 1978.
4 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.
5 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.
6 E.N. Gilbert and H.O. Pollak, "Steiner minimal trees," SIAM Journal on Applied Mathematics, Vol. 16, pp.1-29, 1968.   DOI   ScienceOn
7 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
8 DING-ZHU DU, FRANK K. HWANG and GUOLIANG XUE. "Interconnecting Highways," SIAM Discrete Mathematics, Vol. 12, pp. 252-261, 1999.   DOI