• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2004년도 가을 학술발표논문집 Vol.31 No.2 (3)
• /
• pp.31-33
• /
• 2004

We suggest an enhanced automatic route shortening method for dynamic source routing (DSR) protocol. DSR is a request / response based protocol which has low routing overhead owing to node movement. The original automatic route shortening is performed on the only nodes that belong to the source route of packets. On the contrary, our suggested method allows all neighbor nodes hearing the packet to participate in automatic route shortening. It makes all possible route shortenings be performed. So we maintain maximal short routes of ongoing data connections. Simulation results show that our method pays small extra overhead for ARS, but increases the ratio of packet transmissions and ARS' are performed from 2 to 5 times as much as original ARS.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 컴퓨터소사이어티 추계학술대회논문집
• /
• pp.171-174
• /
• 2003

Shortest path problems are among the most studied network flow optimization problems, with interesting applications in various fields. One such field is the route determination service, where various kinds of shortest path problems need to be solved in location-based service. Our research aim is to propose a route technique in real-time location-based service (LBS) environments according to user's route preferences such as shortest, fastest, easiest and so on. Turn costs modeling and computation are important procedures in route planning. We propose a new rest modeling method for turn costs which are traditionally attached to edges in a graph. Our proposed route determination technique also has an advantage that can provide service interoperability by implementing XML web service for the OpenLS route determination service specification.

• Journal of Advanced Marine Engineering and Technology
• /
• 제22권6호
• /
• pp.920-927
• /
• 1998

This paper presents a synthetic control algorithm that generates the rudder command angle to track the optimal route which is composed of straight-lines among way-points with keeping a required error limit. The control algorithm comprises three main lgorithms that is a course-keeping algorithm that eliminates the yaw angle difference between optimal route and current route a track-keeping algorithm that tracks the optimal route among way-points and a turning-control algorithm that includes the generation of optimal turning routes and control method. The effectiveness of the proposed control algorithm is assured through computer simulation.

• Journal of Ubiquitous Convergence Technology
• /
• 제1권1호
• /
• pp.35-41
• /
• 2007

In mobile ad-hoc wireless networks, one of the most important challenging issues is how to conserve energy, maximizing the lifetime of route(networks) in the view points of both power and mobility of nodes. However, many transmission methods presented in the previous works can not satisfy these two objectives simultaneously. To obtain these two goals, in this paper we propose an architecture to support power saving transmission services with route stability in mobile ad-hoc wireless networks. The proposed architecture consists of two parts, the underlying route stability method to support route(network) lifetime and the power saving transmission methods. The performance evaluation of the proposed architecture is achieved via simulation and analysis.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 2015년도 추계학술대회
• /
• pp.241-242
• /
• 2015

According to globalization of world economy on distribution and sales, logistics and transportation parts are play important role. Especially, it important to know and study how to choose right transport route and which is the key factor of route choice model in multimodal transport system. Thus this study aims to consider 4 main factors: cost, delivery time, freight, and logistics service factors additionally dividing into 13 sub factors and object is forwarders between Mongolia and Korean freight transport. The survey is based on AHP through interview with company officials. The paper provides empirical insights about current status of Mongolian forwarders and difference of the important factors between transportation modes. Result shows that time factor is role factor to choose transport route and then cost factors. Additionally, this study shows 2 different route choose factors between air transport and shipping transport forwarders.

• 공학논문집
• /
• 제7권1호
• /
• pp.37-51
• /
• 2005

An and hoc network is a collection of wireless mobile nodes forming a temporary network without the centralized administration. Due to the limited transmission range of wireless work interface, multiple networks "hops" maybe needed for one node to exchange data with adjacent node. In recent years, a variety of new routing protocol about ad hoc network was developed. This paper presents a new routing protocol based on the Dynamic Source Routing which is not suitable for the high mobility ad hoc network. The Enhanced DR adapts quickly to routing changes when node movement is frequent. When a trunk route is broken, this protocol will utilize the alternative route saved in the route to discovery quickly the new route. It improves the performance of the existing DSR algorithm, so that the negative impacts from weakness of DSR are reduced.

• International Journal of Railway
• /
• 제6권4호
• /
• pp.139-147
• /
• 2013

TSR (Trans-Siberian Railway) route is losing price competitiveness versus Deep Sea route in the transportation from East Asia to Europe, including Moscow. To further attracting the containers to the TSR route, it will be necessary (1) to keep competitive through rate, linked to fluctuating Deep Sea rate; (2) to strengthen speed advantage; (3) to enforce seamless transportation system, including simplified customs clearance procedures. In transportation to Central Asia from East Asia (Korea and Japan), TSR is competitive versus TCR (Trans-China Railway), depending on destinations. Korea has been the leader in revitalizing the TSR route since 2000. Key contributors were affluent export containers to Russia and Central Asia, port of Busan, efficient maritime transport network to Far East Russia, and Korean forwarders' persistent efforts for activating the market. Korea and Japan have a possibility of cooperation in using the TSR route efficiently, such as organizing a joint block train to a same destination.

• 한국주거학회:학술대회논문집
• /
• 한국주거학회 2005년도 추계학술대회 논문집
• /
• pp.311-314
• /
• 2005

Our city structure is being complicated from the development of industry and the increase in population. It makes the ground space overcrowded, so underground space is systematized for use. Because this underground space has very complicated configuration, people have difficulty in finding the route in the underground space. Therefore It is demanded to comprehend configuration of the various space structure, predict pattern of the moving and analyze induction factor of the moving. When people are in the conflagration or dangerous situation, they are in the habit of using the route which they are used to go to and from. It is needed to analyze moving pattern of the pedestrian who usually use the underground space for the sake of dealing with conflagration in the underground space. Finally, this study suggested that general characteristic, distribution, moving route of the pedestrian and factors influencing that they choose the route which the research finds out.

• 한국컴퓨터산업학회논문지
• /
• 제3권1호
• /
• pp.35-44
• /
• 2002

주어진 다각형의 내부를 경로를 따라 이동하면서 감시하는 경비원 경로는 길이의 최소화 또는 링크의 최소화 등으로 구분할 수 있다. 최소링크를 가진 경비원 경로(watchman route with minimum route)는 경로의 방향 전환 횟수가 최소인 경비원 경로이며, 약 가시성 다각형(weakly visible polygon)은 서로 약 가시성을 가진 두개의 체인으로 구성된 다각형이다. 본 논문에서는 n개의 꼭지점을 가진 약 가시성 다각형의 최소 링크를 가진 경비원 경로를 구하는 Ο($n^2$) 시간의 알고리즘을 제시한다.

• Journal of Information Processing Systems
• /
• 제19권1호
• /
• pp.46-54
• /
• 2023

To improve the railway transportation capacity and maximize the benefits of railway transportation, a method for layout optimization of railway transportation route based on deep convolution neural network is proposed in this study. Considering the transportation cost of railway transportation and other factors, the layout model of railway transportation route is constructed. Based on improved ant colony algorithm, the layout model of railway transportation route was optimized, and multiple candidate railway transportation routes were output. Taking into account external information such as regional information, weather conditions and actual information of railway transportation routes, optimization of the candidate railway transportation routes obtained by the improved ant colony algorithm was performed based on deep convolution neural network, and the optimal railway transportation routes were output, and finally layout optimization of railway transportation routes was realized. The experimental results show that the proposed method can obtain the optimal railway transportation route, the shortest transportation length, and the least transportation time, maximizing the interests of railway transportation enterprises.