• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.1035-1038
• /
• 2008

Network mobility (NEMO) has been studied extensively due to its potential applications in military and public transportation. NEMO Basic Support Protocol (NBSP) [1], the current NEMO standard based on mobile IPv6, can be readily deployed using the existing mobile IPv6 infrastructure. However, for Nested network mobility, multi-level tunnel and too many Binding Update packets results in substantial performance overhead, generally known as route sub-optimality, especially in the bottleneck root mobile router (root-MR) and Access Router. In this paper, we propose a route optimization mechanism for nested network mobility management to reduce the overhead of root-MR. In this system, Mobile Router (MR) has a cache that stores Mobile Network Nodes' (MNN) information, Correspondent Nodes' (CN) information for every MNN，and the attachments information with its subnet MRs. Home Agent performs Binding Update with CNs responsible for MRs. Through this mechanism, the number of tunnel is limited between CN and MR and the overhead of root-MR is reduced obviously.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.269-272
• /
• 2005

무선 네트워크 이동성 기술에 대한 연구가 수년간 진행되어 오면서 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를 위한 방안을 제안하고자 한다.

• Journal of Internet Computing and Services
• /
• v.9 no.2
• /
• pp.35-42
• /
• 2008

Mobile IP is a solution to support mobile nodes, however, it does not handle NEtwork MObility (NEMO). The NEMO Basic Support (NBS) protocol ensures session continuity for all the nodes in the mobile network. Since the protocol is based on Mobile IP, it inherits the same fundamental problem such as tunnel convergence, when supporting the multicast for NEMO. In this paper, we propose the multicast route optimization scheme for NEMO environment. We assume that the Mobile Router (MR) has a multicast function and the Nested Mobile Router Information (NeMRI) table. The NeMRI is used to record o list of the CoAs of all the MRs located below it. And it covers whether MRs desire multicast services. Any Route Optimization (RO) scheme can be employed here for pinball routing. Therefore, we achieve optimal routes for multicasting based on the given architecture. We also propose cost analytic models to evaluate the performance of our scheme. We observe significantly better multicast cost in NEMO compared with other techniques such as Bi-directional Tunneling, Remote Subscription, and Mobile Multicast based on the NBS protocol.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.5
• /
• pp.1117-1124
• /
• 2010

PMIPv6 is a network-based mobility support scheme, proposed and standardized by NetLMM WG of IETF. It is proposed to solve problems of conventional mobility schemes, and to improve inefficiency of those. The standard document describes network components and detailed procedures to provide mobility to MN. But it describes only a handover procedure between MAGs, not between LMAs. In order to support seamless connectivity of MN efficiently, a handover procedure between LMAs is necessary. The proposed scheme in this paper utilizes a route optimization procedure to prevent inefficiency of inter-LMA tunneling scheme. At the same time, the proposed scheme utilizes a pre-authentication scheme to reduce handover latency. According to the result of performance evaluations, the proposed scheme greatly reduces handover latency, compared to conventional mobility support schemes.

• ETRI Journal
• /
• v.35 no.1
• /
• pp.41-50
• /
• 2013

Network Mobility (NEMO) handles mobility of multiple nodes in an aggregate manner as a mobile network. The standard NEMO suffers from a number of limitations, such as inefficient routing and increased handoff latency. Most previous studies attempting to solve such problems have imposed an extra signaling load and/or modified the functionalities of the main entities. In this paper, we propose a more secure and lightweight route optimization (RO) mechanism based on exploiting the firewall in performing the RO services on behalf of the correspondent nodes (CNs). The proposed mechanism provides secure communications by making an authorized decision about the mobile router (MR) home of address, MR care of address, and the complete mobile network prefixes underneath the MR. In addition, it reduces the total signaling required for NEMO handoffs, especially when the number of mobile network nodes and/or CNs is increased. Moreover, our proposed mechanism can be easily deployed without modifying the mobility protocol stack of CNs. A thorough analytical model and network simulator (Ns-2) are used for evaluating the performance of the proposed mechanism compared with NEMO basic support protocol and state-of-the-art RO schemes. Numerical and simulation results demonstrate that our proposed mechanism outperforms other RO schemes in terms of handoff latency and total signaling load on wired and wireless links.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.29-33
• /
• 2005

It is not future story that host mobility in wireless network. We already have many devices which can access network among moving our locations. Internet protocol is extended to support not only host mobility but also network mobility. But nesting mobile networks and mobile hosts, there is a problem that routing path of packet becomes complex. By sequential tunneling on outgoing packet at mobile router and toward mobile network at correspondent node, it can be setting up direct path in nested mobile network environment. In this paper, we propose a method for delivering packet through optimized path by sequential tunneling. And evaluate this method by equations and simulations.

• 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 the Korean Institute of Intelligent Systems
• /
• v.24 no.2
• /
• pp.209-217
• /
• 2014

Of several approaches for future Internet, separating two properties of IP address into locator and identifier, is being considered as a highly likely solution. IETF's LISP (Locator ID Separation Protocol) is proposed for this architecture. In particular, the LISP model easily allows for device mobility through simple update of information at MS (Mapping Server) without a separate protocol. In recent years, some of the models supporting device mobility using such LISP attributes have emerged; however, most of them have the limitation for seamless mobility support due to the frequent MS information updates and the time required for the updates. In this paper, PMIPv6 (Proxy Mobile IPv6) model is applied for mobility support in LISP model. PMIPv6 is a method that can support mobility based on network without the help of device; thus, this we define anew the behavior of functional modules (LMA, MAG and MS) to fit this model to the LISP environment and present specifically procedures of device registration, data transfer, route optimization and handover. In addition, our approach improves the communication performance using three tunnels identified with locators between mobile node and corresponding node and using a route optimized tunnel between MN's MAG and CN's MAG. Finally, it allows for seamless mobility by designing a sophisticated handover procedure.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.7
• /
• pp.59-66
• /
• 2010

In this paper, we compare the performance of proposals for route optimization handover, which provides optimized communication to mobile node, presented in IETF (Internet Engineering Task Force). For comparison, we consider the architecture with two MAGs (Mobile Access Gateways) and single LMA (Local Mobility Anchor), and analyze the signaling cost, handover latency, and packet loss. Evaluation results show that they are changed depending on the involved component, the number of route optimization messages and performance factor that each proposal targets.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.871-874
• /
• 2008

이동성을 제공하기 위한 프로토콜 중 오랜 기간 많은 연구로 표준화가 된 Mobile IPv6 (MIPv6)가 있다. MIPv6는 호스트 기반 이동성 제공 프로토콜로서 이동 단말이 이동성에 필요한 시그널링을 직접수행한다. 한편, 최근에 표준화 작업이 진행 중인 Proxy Mobile IPv6 (PMIPv6)는 네트워크 기반 이동성 제공 프로토콜로서 이동 단말이 아닌 네트워크 자체에서 이동성을 제공한다. PMIPv6는 MIPv6에서 Home Agent와 같은 역할을 하는 Local Mobility Anchor 와 이동 단말이 수행하던 시그널링을 대신하는 Mobile Access Gateway를 정의하여 이동성을 제공한다. PMIPv6의 기본 동작 과정에 대한 표준화가 진행됨에 따라 프로토콜의 최적화에 대한 이슈가 부각되고 있다. Route Optimization은 이러한 최적화 이슈 중 하나로서 패킷 전송 시 최적화 된 경로를 설정하고 발생할 수 있는 전송 지연을 최소화하는 기법이다. 본 논문에서는 PMIPv6에서의 Route Optimization을 적용하기 위해 Liebesch 인터넷 드래프트에서 제안 한 기법의 동작 과정을 살펴보고 PMIPv6의 기본 전송 과정과 비교하여 그 성능을 분석하였다.