Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2011.18A.5.215

Efficient Connection of Migration Routes with Their Weights Using EGOSST  

Kim, In-Bum (김포대학 IT학부)
Abstract
In this paper, a mechanism connecting all weighted migration routes with minimum cost with EGOSST is proposed. Weighted migration routes may be converted to weighted input edges considered as not only traces but also traffics or trip frequencies of moving object on communication lines, roads or railroads. Proposed mechanism can be used in more wide and practical area than mechanisms considering only moving object traces. In our experiments, edge number, maximum weight for input edges, and detail level for grid are used as input parameters. The mechanism made connection cost decrease average 1.07% and 0.43% comparing with the method using weight minimum spanning tree and weight steiner minimum tree respectively. When grid detail level is 0.1 and 0.001, while each execution time for a connecting solution increases average 97.02% and 2843.87% comparing with the method using weight minimum spanning tree, connecting cost decreases 0.86% and 1.13% respectively. This shows that by adjusting grid detail level, proposed mechanism might be well applied to the applications where designer must grant priority to reducing connecting cost or shortening execution time as well as that it can provide good solutions of connecting migration routes with weights.
Keywords
EGOSST(Edge Grade Of Services Steiner Minimum Tree); Edge Steiner Minimum Steiner Tree; Edge Minimum Spanning Tree; Weighted Input Edge; Connection Line;
Citations & Related Records
Times Cited By KSCI : 3  (Citation Analysis)
연도 인용수 순위
1 J. Kim, M. Cardei, I. Cardei and X. Jia, "A Polynomial Time Approximation Scheme for the Grade of Services Steiner Minimum Tree Problem", Journal of Global Optimization Vol.24, pp.437-448, 2002.   DOI
2 김준모, "센서 네트워크 구축에서의 Combinatorial 기법 적용", 대한전자공학회논문지TC, Vol.45, No.7, pp.9-16, 2008.   과학기술학회마을
3 Yi-Ting Chien, Mong-Fong Horng, Yu-Cheng Sheu, Jeng-Pong Hsu, Yau-Hwang, Kuo, Chin-Shiun Shieh, "An Alternative-Path Approach to Improve Robustness of TCP Connections in Wireless Mesh Networks", 2010 Sixth International Conference on Intelligent Information Hiding and Multimedia Signal, Darmstadt, Germany, pp.248-251, 2010.   DOI
4 T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithm, 2ndEd., MIT Press, pp.561-579, 2001.
5 http://en.wikipedia.org/wiki/Steiner_tree, December, 2009.
6 B. Bell, "Steiner Minimal Tree Problem", http://www.css.taylor.edu/-bbell/steiner/, January 1999.
7 김인범, 김수인, "선분상의 포탈을 이용한 근사 선분 최소 신장트리의 생성", 정보처리학회 논문지, 12월, 2009   과학기술학회마을   DOI   ScienceOn
8 G.L. Xue, G.H. Lin. and D.Z. Du, "Grade of Service Steiner Minimum Trees in Euclidean Plane", Algorithmica, Vol.31, pp.479-500, 2001.   DOI
9 박수창, 이의신, 진민숙, 최영환, ,김상하, "무선 센서 네트워크에서 예측 가능한 싱크 이동성을 기반으로 한 데이타 전달 프로토콜", 한국정보과학회논문지, Vol.14, No.3, pp.276-280, 2008.   과학기술학회마을
10 Wing Ho Yuen, Roy D. Yates, Chi Wan Sung, "Effect of Node Mobility on Highway Mobile Infostation networks", MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems, San Diego, USA, pp.82-91, September, 2003.   DOI
11 D. Bunnjaweht, M. A. Wickert, "Capacity enhancement of a multi-beam technique in a WCDMA network using multiple path connections", Mobility '06 Proceedings of the 3rd international conference on Mobile technology, applications & systems, Article No.37, Bangkok, Thailand, 2006.   DOI
12 Dongfang Zheng, Xian Liu, Mrinal Mandal, Weidong Lu, "Virtual Traffic Path Optimization in Connection-Oriented Networks with Stochastic Traffic", Journal of Network and Systems Management, Vol.12, No.2, pp.231-249, 2004.   DOI   ScienceOn
13 A. Arvidsson, S. A. Berezner, A. E. Krzesinski, "The Design and Management of ATM Virtual Path Connection Networks", MASCOTS '99 Proceedings of the 7th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, College Park, USA, pp.2-9, 1999.   DOI