Earticle

With improvements in living conditions, an increasing number of people are choosing to spend their time traveling. Comfortable tour routes are affected by the season, time, and other local factors. In this paper, the influencing factors and principles of scenic spots are analyzed, a model used to find the available routes is built, and a multi-route choice model based on a game theory utilizing a path recommendation weight is developed. A Monte Carlo analysis of a tourist route subjected to fixed access point conditions is applied to account for uncertainties such as the season, start time, end time, stay time, number of scenic spots, destination, and start point. We use the Dijkstra method to obtain multiple path plans and calculate the path evaluation score using the Monte Carlo method. Finally, according to the user preference in the input path, game theory generates path ordering for user choice. The proposed approach achieves a state-of-the-art performance at the pseudo-imperial palace. Compared with other methods, the proposed method can avoid congestion and reduce the time cost.

Content centric networking (CCN) is regarded as promising internet architecture because it can provide network efficiency in terms of bandwidth consumption by separating contents from a specific network location and decrease network congestion events. However, the application of a CCN does not widely consider the side effects of mobile devices, particularly mobile content sources. For content source mobility, a full routing update is required. Therefore, in this study, a route optimization scheme is proposed for mobile content sources in a CCN environment to provide low communication overhead, short download time, and low resource consumption. The proposed scheme establishes a direct path between content requesters and a mobile content source for the exchange of interest and data packets using interest-piggybacked data packets. Based on the inherent CCN naming characteristics, the content source does not know the name prefix of the content consumer, and thus the proposed optimized CCN scheme utilizes the content router in the home domain of the content source.

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.

Software Defined Network (SDN) is a new network architecture for designing, building, and managing networks that separates the networks control plane and forwarding plane to better support the scalability and innovation in a network infrastructure. The overall network performance of an application is mostly affected by the two major factors, bandwidth, and latency. Between each pair of network elements in network infrastructure, there may exist multiple paths connecting them with different properties. A traditional network does not take this knowledge into consideration and may result in sub-optimal performance of applications and underutilization of a network resource. This research proposes a concept of Application aware routing which could improve the overall performance of a network by categorizing the application in bandwidth oriented and latency oriented and allocate the separate route for each type of traffic based on the application preferences using Software defined network architecture and OpenFlow protocol. The research also proposes a design of an application aware network topology by using software defined network architecture which uses open flow protocol and open flow protocol based controller. Routes for the application packets are chosen based on the application type. To verify the feasibility and practical implementation of the proposed concept SDN topology is implemented in emulated environment using mininet.

With the recent changes in tourism trends, the demand for personalized travel experiences and hyper-personalization is increasing. At specific tourist destinations such as Jeju Island, various elements such as natural landscapes, marine scenery, and historical and cultural sites significantly influence tourist satisfaction and their intention to revisit. Accordingly, this study proposes a platform utilizing Artificial Intelligence (AI) technology to optimize UAM routes based on tourist preferences and provide personalized services. To achieve this, tourism big data was used to analyze preferred tourist destinations by season and landscape type, and based on this, an optimized UAM route and AI platform based on consumer preferences were developed. This platform, through an AI-based route recommendation system that reflects the preferences of individual tourists, aims to personalize the tourist experience and propose optimized routes that reflect local characteristics, thereby contributing to sustainable tourism development.

최근 들어 재난 발생으로 인한 재산 및 인명피해가 속출하고 있다. 이에 따라 국내 여러 분야에서 분야별 대응방안 모색을 위해 노력하고 있지만 대피매뉴얼 작성을 위한 연구는 미비한 실정이다. 본 연구에서는 공단과 같은 산업지역에서 대규모 대피가 필요한 사고가 발생하였을 때, 대응방안에 따른 최적의 대피경로를 산정하는 모형을 개발하였다. 모형개발에는 Dijkstra 최단경로 알고리즘, 가능경로법, 유전자 알고리즘 및 파레토 최적해 산정 등을 통하여 모형을 개발하였고, 병렬처리를 통하여 연산시간을 단축시킬 수 있도록 하였다. 뿐만 아니라 개발된 모형을 가상네트워크에 대한 적용을 통해 타당성을 검증하였고, 구미 국가산업 1단지를 대상으로 적용하여 실제 지역을 대상으로 한 모형의 적용성을 검증하였다. 모형을 이용하여 목적함수별 최적경로를 산출한 결과, 최적경로 산출 이전보다 좋은 결과를 얻을 수 있어 타당성이 검증되었고, 실제 지역을 대상으로 연산한 결과를 통해 모형의 적용성도 검증되었다. 본 연구 결과는 재난을 대비한 대응목적별 대피매뉴얼의 작성뿐만 아니라, 재난 발생 시 대응차량의 진입경로 산정에도 도움이 될 것으로 판단된다.

Lately, losses and damage from natural disasters have been increasing. Researchers across various fields in Korea are trying to come up with a response plan, but research for evacuation plans is still far from satisfactory. Hence this paper proposes a model that could find an optimized evacuation route for when disasters occur over wide areas. Development of the model used methods including the Dijkstra shortest path algorithm, feasible path method, genetic algorithm, and pareto efficiency. Computations used parallel computing (SPMD) for high performance. In addition, the developed model is applied to a virtual network to check the validity. Finally the adaptability of the model is verified on a real network by computating for Gumi 1stNational Industrial Complex. Computation results proved that this model is valid and applicable by comparison of the fitness values for before optimization and after optimization. This research can contribute to routing for responder vehicles as well as planning for evacuation by objective when disasters occur.

본 연구에서는 집중호우 시 사면재해 피해를 예방하기 위한 급경사지 위험도를 분석하고, 최적의 대피경로 확보에 대한 연구 를 진행하였다. LiDAR와 드론을 활용하여 사면의 경사를 확인하고, 위험도를 분석하였다. LiDAR를 통해 포인트클라우드 데이터를 수집하고, 경사도를 정밀하게 분석한다. 경사도 분석 결과값을 지도위에 표시하여 산사태 위험지도를 만들고, 위험 등급이 높은 지역에 대해서 산사태가 발생할 시 대피할 수 있는 최적의 대피경로를 파악한다. GIS의 네트워크분석을 통해 위험 지역 내에 포함되어 있는 건물에서 대피할 수 있는 최적의 경로를 추출하였다. 본 연구를 통해 접근이 어려운 급경사지에 대한 사면 정밀 분석을 할 수 있으므로 사면재해 피해 예방에 도움이 될 것으로 기대한다.

Proxy Mobile IPv6 (PMIPv6), a network-based localized mobility protocol, allows a mobile node (MN) to move around within the same PMIPv6 domain by keeping the same IP address. However, PMIPv6 does not support the global handover since it supports only an intra-domain handover. To support the global handover, MNs need to load the protocol stack for the global mobility. Our proposed scheme enables the MN’s session to be connected without any support of PMIPv6 protocol during the global handover. In addition, it reduces the packet transmission delay by performing the Route Optimization (RO) after the MN’s global handover. In this paper, we compare our proposed scheme with the existing Roaming scheme. As a result, the proposed scheme reduces the packet transmission delay by 25% and the packet loss by 78% compared with the existing one. In other words, our scheme supports the seamless and reliable handover for MN.

The use of mobile networks is rapidly increasing day by day. There are two aspects in mobile networks such as host mobility and network mobility. The protocols used for host mobility takes care of only single node to be connected with the internet. But, the protocols used for network mobility takes care of whole network to be connected with the internet using mobile router. The need for NEtwork MObility (NEMO) support is inevitable in mobile platforms such as car, bus, train, air-plane, etc. The Mobile Internet Protocol version 6 (MIPv6) and NEMO Basic Support Protocol (BSP) is used to support host mobility and network mobility, respectively. The NEMO BSP introduces several advantages, such as reduced signaling, increased manageability, reduced power consumption and conservation of bandwidth when compared to MIPv6 to be used in the mobile platforms. The NEMO BSP also suffers from a number of limitations, like inefficient route and increased handoff latency. The recent researches on NEMO have proposed several Route Optimization (RO) schemes that solves inefficient route. Though the proposed RO mechanisms solve inefficient route, it also has limitations such as signaling overflow, complexity and processing overload, delay during handoff, security breach, etc. The objectives of this survey are to identify, classify RO mechanisms and to select suitable RO mechanisms to enhance Quality of Service (QoS) in different kinds of internet applications.

Route Optimization (RO) is an emerging technique in the area of Mobile Networks (MN). Finding a best solution for the route optimization is still in research. The NEMO (NEtwork MObility) protocol provides network mobility and MIPv6 provides host mobility. A MN can have nodes with NEMO or MIPv6. The NEMO has more complexity in providing RO than MIPv6 in terms of throughput, payload, etc. Sometimes each and every node in the mobile network may not support RO. The nodes that do not support RO must be identified early in order to avoid excessive delay in setting up RO. In this paper, we have proposed a mechanism to reduce the delay in establishing RO by effectively maintaining a table that stores information about whether a node supports RO or not. In order to reduce the table size and search delay, information about RO support is stored in binary value. The outcome of this paper reduces time taken for fall back procedure that in turn reduces excessive delay in establishing RO. In general, it helps to offer better Quality of Services to the customers.

Transforming the convolution to the (+,-) in legend domain is proposed in this paper. Based on the transformation, the Legend Transformation of service curve and arrive curve is given in the case of independent cross traffic, and the closed expression of stochastic delay and stochastic backlog is obtained. In the paper, we analyze influence of the dynamic of traffic and network to QoS parameter. Based on the analysis result, the QoS analysis in Legend domain is given, and the upper bound of delay and backlog in Legend domain. For the case of non-independent cross traffic, the relationship expression of different traffic is got. And simulation proves that the route optimization algorithm is correct.

망이동성지원 프로토콜 (NEMO basic support protocol)은 이동망의 통신노드들에 대해 인터넷 연결을 제공하기 위한 확장된 MIPv6이다. 그러나, 망이동성지원 프로토콜은 중첩된 이동망의 경우에 다중 캡슐화와 함께 최적화되지 않은 경로 선택으로 인하여 데이터 전송 지연과 많은 비용을 요구한다. 본 논문에서는 계층적 MIPv6 (HMIPv6)와 계층적 프리픽스 할당 (HPD) 프로토콜을 결합한 제안 기법을 통해 핸드오프 발생시 효율적인 경로최적화와 더불어 패킷헤더비용과 위치등록부하를 감소시켰다. 제안 기법은 계층적 프리픽스할당과 트리기반 경로방법을 통하여 이동망 노드들에 대한 주소를 할당하고, 마이크로 이동성을 지원함과 동시에 도메인 내에서의 상호통신을 가능케 한다. 제안된 기법의 성능평가를 위해 NS-2로 모의실험을 하였다.

The Network Mobility (NEMO) basic support protocol extends the operation of Mobile IPv6 to provide uninterrupted Internet connectivity to the communicating nodes of mobile networks. The protocol is not efficient to offer delays in data delivery and higher overheads in the case of nested mobile networks because it uses fairly sub-optimal routing and multiple encapsulation of data packets. In this paper, our scheme combining Hierarchical Mobile IPv6 (HMIPv6) functionality and Hierarchical Prefix Delegation (HPD) protocol for IPv6, which provide more effective route optimization and reduce packet header overhead and the burden of location registration for handoff. The scheme also uses hierarchical mobile network prefix (HMNP) assignment and tree-based routing mechanism to allocate the location address of mobile network nodes (MNNs) and support micro-mobility and intra-domain data communication. The performance is evaluated using NS-2.

인터넷 mobility 기술의 발전으로 인해 Mobile IPv6 를 기반으로 하는 이동 네트워크(Mobile Network, NEMO)기술이 등장하였으며, MR(Mobile Router)와 HA(Home Agent)간의 bi-directional 터널을 통해 네트워크의 이동성을 지원한다. 그러나. 이동네트워크 안에 또 다른 이동네트워크가 존재하는 중첩된 이동네트워크에서는 bi-directional 터널이 중복되는 routing problem이 발생한다. 따라서 본 논문에서는 중첩된 이동네트워크가 계층적 구조를 가지는 것을 이용하여, 최상위 MR 이 지역 HA 역할을 수행하게 항으로써, 중첩된 이동네트워크내의 노드들을 위한 경로최적화와 마이크로 이동성을 동시에 지원할 수 잇도록 한다.

인터넷에서 호스트의 이동성을 지원해주기 위한 프로토콜인 Mobile IP 의 가장 근 문제점의 하나는 Triangle Routing Problem이며 이를 해결하기 위한 방안으로서 Route Optimization이 있다. 그러나, 이 방식은 Route Optimization 을 위해서 기존의 인터넷 호스트, 즉 Correspondent Node 가 Binding Cache를 유지하고, Encapsulation의 기능을 가져야 하고, Home Agent와 Security Association을 갖도록 변경이 불가피하다. 본 논문에서는 기존 인터넷 호스트에서의 변경을 필요로 하지 않는 새로운 Route Optimization 방안인 Backward-Compatible Route Optimization을 제시한다.

무선 네트워크 이동성 기술에 대한 연구가 수년간 진행되어 오면서 Mobile Network에 PAN(Personal Area Network)과 유사한 형태의 Nested Mobile Network에 대한 관심이 높아지고 있으며, 이러한 Nested Mobile Network에서의 경로최적화(Route Optimization : RO) 기술에 대한 연구가 활발하게 진행되고 있다. NEMO(NEtwork MObility)의 RO를 위해 제안된 논문 중에 ORC(Optimized Route Cache Protocol)에 대한 제안이 있었다.[1] NEMO Basic Support가 표준안으로 채택되면서 연구 대상에서 거론되지 않고 있지만, 복잡한 이동성 기술인 Nested Mobile Network상의 RO를 위해 다시 검토해 볼 수 있을 것이다. 또한 동일 저자에 의해 제안된 Nested Mobile Network 내부에 Ad-hoc Routing 알고리즘인 OLSR(Optimized Link State Routing Protocol)을 적용한 제안이 발표되었다.[2] 본 논문에서는 ORC와 Nested Mobile Network상의 OLSR Scheme을 적용하여 RO를 위한 방안을 제안하고자 한다.