• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.235-242
• /
• 2007

Network Mobility Basic Support protocol reduces location-update signaling by making network movements transparent to the mobile nodes (MNs) behind the mobile router (MR), but causes some problems such as sub-optimal routing and multiple encapsulations. This paper proposes an Route Optimization Employing HMIP Extension for Mobile Networks (ROHMIP) scheme for nested nubile networks support which introduces HMIP concept with relation information between MNNs behind a MR and the MR in order to localize handoff, to optimize routing and especially reduce handoff signal overhead. With ROHMIP, a mobile network node (MNN) behind a MR performs route optimization with a correspondent node (CN) as the MR sends a binding update message (BU) to mobility anchor point (MAP) via root-MR on behalf of all active MNNs when the mobile network moves. This paper describes the new mechanisms and provides simulation results which indicate that our proposal reduces transmission delay, handoff latency and signaling overhead.

• Journal of KIISE:Information Networking
• /
• v.36 no.3
• /
• pp.204-211
• /
• 2009

Proxy Mobile IPv6(PMIPv6) is that network-based mobility management protocol that network supports mobile node's mobility on behalf of the Mobile Node(MN). In PMIPv6 network, data packets from a Correspondent Node(CN) to a MN will always traverse the MN's Local Mobility Anchor(LMA). Even though, CN and MN might be located close to each other or within the same PMIPv6 domain. To solve this problem, several PMIPv6 Route Optimization(RO) schemes have been proposed. However, these RO schemes may result in a high signaling cost when MN moves frequently between MAGs. For this reason, we propose an adaptive route optimization(ARO) scheme. We analyze the performance of the ARO. Analytical results indicate that the ARO outperforms previous schemes in terms of signaling overhead.

• Korean Journal of Geomatics
• /
• v.1 no.1
• /
• pp.95-101
• /
• 2001

In a route plan, the route selection is a complicated problem to consider the spatial distribution and influence through overall related data and objective analysis on the social, economic and technical condition. The developed system in this study was compared and estimated by deciding a practical section for its validity and efficiency. Using Geographic Information System (GIS), the various information required for route selections in database was constructed, the characteristics of subject area by executing three-dimensional terrain analysis was grasped effectively, and the control point through buffering, overlay and location operation was extracted. An optimum route was selected by calculating the sum of alternatives to the sub-criteria weight, and from this result, there is a difference between real route and proposed route according to the prioritization of decision criteria based on the importance. This research could be constructed and applied geospatial information to the reasonable route plan and an optimum route selection efficiently using GIS. Therefore, the applications are presented by applying Analytic Hierarchy Process (AHP) to the decision-making of information needed in route selection.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1483-1492
• /
• 1996

In this paper, related on the postal business with the GIS(Geographics Information System), it discusses design and implementation of the PROS(Postal Route Optimization System) model and its main module, the shortest path generation algorithm, for supporting to postal route managements. It explains examples requirements of postal route system, and suggests the efficient PROS model using our developed shortest path generation algorithm. Because the shortest path algorithm adopts not only consider the Dijkstra algorithm of graph theory, but also the method with the direction property, PROS can be implemented with fast and efficient route search. PROS is mainly constituted of the Shortest Generator, the Isochronal Area Generator, and the Path Rearrangement Generator. It also exploits the GIS engine and the spatial DBMS (Data Base Management System) for processing coordinates in the map and geographical features. PROS can be used in the management of postal delivery business and delivery area and route, and in the rearrangement of route. In the near future, it can be also applied to commercial delivery businesses, guides of routs and traffic informations, and auto navigation system with GPS(Global Positioning System).

• Proceedings of the IEEK Conference
• /
• 2003.11b
• /
• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.1
• /
• pp.74-90
• /
• 2014

Routing in mobile wireless sensor networks (MWSNs) is an extremely challenging issue due to the features of MWSNs. In this paper, we present a novel bio-inspired trusted routing protocol (B-iTRP) based on artificial immune system (AIS), ant colony optimization (ACO) and Physarum optimization (PO). For trust mechanism, B-iTRP monitors neighbors' behavior in real time and then assesses neighbors' trusts based on AIS. For routing strategy, each node proactively finds routes to the Sink based on ACO. When a backward ant is on the way to return source, it senses the energy residual and trust value of each node on the discovered route, and calculates the link trust and link energy of the route. Moreover, B-iTRP also assesses the availability of route based on PO to maintain the route table. Simulation results show how B-iTRP can achieve the effective performance compared to existing state-of-the-art algorithms.

• Journal of Information Processing Systems
• /
• v.17 no.5
• /
• pp.879-891
• /
• 2021

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.

• International journal of advanced smart convergence
• /
• v.12 no.4
• /
• pp.8-19
• /
• 2023

This paper presents advancement in multi- unmanned aerial vehicle (UAV) cooperative area surveillance, focusing on optimizing UAV route planning through the application of genetic algorithms. Addressing the complexities of comprehensive coverage, two real-time dynamic path planning methods are introduced, leveraging genetic algorithms to enhance surveillance efficiency while accounting for flight constraints. These methodologies adapt multi-UAV routes by encoding turning angles and employing coverage-driven fitness functions, facilitating real-time monitoring optimization. The paper introduces a novel path planning model for scenarios where UAVs navigate collaboratively without predetermined destinations during regional surveillance. Empirical evaluations confirm the effectiveness of the proposed methods, showcasing improved coverage and heightened efficiency in multi-UAV path planning. Furthermore, we introduce innovative optimization strategies, (Foresightedness and Multi-step) offering distinct trade-offs between solution quality and computational time. This research contributes innovative solutions to the intricate challenges of cooperative area surveillance, showcasing the transformative potential of genetic algorithms in multi-UAV technology. By enabling smarter route planning, these methods underscore the feasibility of more efficient, adaptable, and intelligent cooperative surveillance missions.

• The KIPS Transactions:PartC
• /
• v.19C no.3
• /
• pp.191-208
• /
• 2012

Proxy Mobile IPv6 (PMIPv6) is designed to provide network-based mobility management support to an MN without any involvement of the MN in the mobility related signalling, hence, the proxy mobility entity performs all related signalling on behalf of the MN. The new principal functional entities of PMIPv6 are the local mobility anchor (LMA) and the mobile access gateway (MAG). In PMIPv6, all the data traffic sent from the MN gets routed to the LMA through a tunnel between the LMA and the MAG, but it still has the single point of failure (SPOF) and bottleneck state of traffic. To solve these problems, various approaches directed towards PMIPv6 performance improvements such as route optimization proposed. But these approaches add additional signalling to support MN's mobility, which incurs extra network overhead and still has difficult to apply to multiple-LMA networks. In this paper, we propose a improved route optimization in PMIPv6-based multiple-LMA networks. All LMA connected to the proxy internetworking gateway (PIG), which performs inter-domain distributed mobility control. And, each MAG keeps the information of all LMA in PMIPv6 domain, so it is possible to perform fast route optimization. Therefore, it supports route optimization without any additional signalling because the LMA receives the state information of route optimization from PIG.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.12
• /
• pp.17-23
• /
• 2010

In the mobile cloud computing, the mobile node should request and receive the services while being connected. In PMIPv6, all packets sent by mobile nodes or correspondent nodes are transferred through the local mobility anchor. This unnecessary detour still results in high delivery latency and significant processing cost. Several PMIPv6 route optimization schemes have been proposed to solve this issue. However, they also suffer from the high signaling costs and handover latency when determining the optimized path. We propose the route optimization handover scheme which adopts the prediction algorithm in PFMIPv6. In the proposed scheme, the new mobile access gateway establishes the bi-directional tunnel with the correspondent node's MAG using the context message when the mobile node's handover is imminent. This tunnel may eliminate the need of separate route optimization procedure. Hence, the proposed scheme can reduce the signaling cost than other conventional schemes do. Analytical performance evaluation is preformed to show the effectiveness of the proposed scheme. The result shows that our scheme is more effective than other schemes.