• 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를 위한 방안을 제안하고자 한다.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.3-6
• /
• 2005

Mobile Network의 이동성에 대한 연구가 활발하게 진행되어 오면서, 이동네트워크의 복잡한 모델인 Nested Mobile Network에 대한 연구가 부각되고 있다. 이 Nested Mobile Network에 대한 연구에는 네트워크 내에 존재하는 노드와 외부의 CN(Correspondent Node)과의 패킷전송에서 경로최적화를 하기 위한 방법 등에 대한 연구가 진행되어 오고 있으며, Nested Mobile Network에서 Pinball routing 문제 등으로 인해 경로최적화가 이루어지지 못하고, 이 문제가 일반적인 Nested Mobile Network에서 패킷사이즈의 길이를 지나치게 길어지게 함으로써 전송지연을 발생시키는 것이다, 본 논문에서는 반복적인 CoA(Care-of-Address)의 치환과정을 통해 Nested Mobile Network 상의 Pinball routing 문제를 해결하기 위한 효율적인 방안을 제안하고자 한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.65-68
• /
• 2008

The Mobile IP provides the mobility of Mobile Node, but does not provide the mobility of network. For support the mobility of network, the IETF has proposed NEMO(Network Mobility). Route Optimization is a serious problem in mobile network, so several solutions for route optimization in nested mobile network have been suggested by the IETF NEMO WG. This paper proposes scheme about Route Optimization in nested mobile network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.2B
• /
• pp.82-89
• /
• 2008

Mobile IP is the basic solution to provide host mobility, whereas network mobility refers to the concept of collective mobility of a set of nodes. In a network mobility scenario, mobile networks can be nested in a hierarchical form. That situation is referred to a nested mobile network Nested mobile networks exhibit the pinball routing problem, which becomes worse in proportion to the number of nested levels in the hierarchy. In this paper, we propose a routing optimization scheme having backward compatibility to the basic network mobility protocol and concerning heterogeneity of nested mobile network, also we perform comparison and analysis of proposed schemes.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.9-10
• /
• 2007

[1],[2]의 드래프트 문서에서는 Mobile Network 내부에 HA를 두고 이동하는 Mobile Node를 LMN(Local Mobile Node)라 정의하고 있다. NEMO Basic Support를 기반으로 Nested Mobile Network에서 LMN의 이동에 대한 패킷 전송 경로를 가정 할 때 이 경로는 일반적인 Nested NEMO의 경우 보다 상당히 복잡한 경로를 가지게 된다. 본 논문에서는 이러한 LMN이 이동할 경우 패킷 전송경로에 대해 분석하고, Nested NEMO에 MANET을 적용하여 LMN의 이동에 대한 경로 최적화 방안을 제안하고자 한다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.4
• /
• pp.9-17
• /
• 2007

Network Mobility basic support protocol (NEMO Basic) extends the operation of Mobile IPv6 to provide uninterrupted Internet connectivity to the communicating nodes of mobile networks. The protocol uses a mobile router (MR) in the mobile network to perform prefix scope binding updates with its home agent (HA) to establish a bi-directional tunnel between the HA and MR. This solution reduces location-update signaling by making network movements transparent to the mobile nodes (MNs) behind the MR. However, delays in data delivery and higher overheads are likely to occur because of sub-optimal routing and multiple encapsulation of data packets. To manage the mobility of the mobile network, it is important to minimize packet overhead, to optimize routing, and to reduce the volume of handoff signals over the nested mobile network. This paper proposes en aggregate router-assisted route optimization (ARARO) scheme for nested mobile networks support which introduces a local anchor router in order to localize handoff and to optimize routing. With ARARO, 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 aggregate router (AGR) via root-MR on behalf of all active MNNs when the mobile network moves. This paper describes the new architecture and mechanisms and provides simulation results which indicate that our proposal reduces transmission delay, handoff latency and signaling overhead. To evaluate the scheme, we present the results of simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4B
• /
• pp.178-185
• /
• 2005

NEMO basic support is a solution that provides network mobility in the Internet topology. Yet, when multiple mobile networks are nested, this basic solution suffers ken pinball-routing and a severe routing overhead. Therefore, several solutions for route optimization in a nested mobile network have already been suggested by the IETF NEMO WG. However, the current paper proposes Regional Information-based Route Optimization (RIRO) in which mobile routers maintain a Nested Router List (NRL) to obtain next-hop information, and packets are transmitted with a new routing header called an RIRO Routing Header (RIRO-RH). We showed that RIRO had the minimum packet overhead that remained constant, irrespective of how deep the mobile network was nested, in comparison with two earlier proposed schemes - Reverse Routing Header (RRH) and Bi-directional tunnel between HA and Top-Level mobile router (BHT).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10A
• /
• pp.796-806
• /
• 2003

Mobile Node usually communicate with CN bia only it's own HA but Nested Mobile Networks correspond with CN bia all HA involved with them. when Mobile Network of a MR moves from its home link to a foreign link in the stationary network. then Mobile Network of another MR moves from its home link in stationary network to foreign link in previous mobile network. CN send Packet destined to the latter MR via both Home Agent of the former MR and the latter MR. There are two problem in this scenario. One is inefficient routing path that bypass via several HA. the other is waste of transmission resource and delay of Registration process which change of Nested Mobile Network Architecture cause Mobile Router. so We propose MRA(Mobile Relay Agent) to support effective routing by local mobility management.

• Convergence Security Journal
• /
• v.8 no.2
• /
• pp.51-56
• /
• 2008

In this paper presents the method of the Optimal Mobile Router Designation (OMRD) using QM(Quality of service Manager) in the nested mobile network. QM is positioned on TLMR (Top Level Mobile Router) in the nested mobile network and manages the information of all MRs in the mobile network. When MN (Mobile Node) moves to a new MR, OMRD (Optimal Mobile Router Designation) selects the candidate MRs group and decides an optimal MR considering the mobile characteristics. OMRD reduces maximally the production of handover and removes the transmission delay of a new call and a handover call resulted from the wireless insufficient resource. Also, it prevents the concentration in a specific MR and maintains equally the load of the whole network.

• Journal of information and communication convergence engineering
• /
• v.11 no.2
• /
• pp.82-94
• /
• 2013

In this paper, we propose a novel tunnel-free scheme in a proxy mobile IPv6 (PMIPv6)-based nested network mobility environment; several mobile nodes (MNs) and mobile routers (MRs) compose a hierarchical wireless network topology. Because tunnels created by several MRs overlap and data packets travel along several local mobility anchors (LMAs), the utilization of the wireless section is reduced and the packet forwarding path of the wire-line section is not optimal. In our tunnel-free scheme, the mobile access gateway (MAG) plays an important role in both the wireless and wire-line sections. Using a local binding update, this tunnel-free scheme forwards data packets with a host-based routing table without any tunnel. Establishing a direct tunnel between the MAG and the last LMA, this scheme removes nested tunnels between intermediate LMAs and MRs, and optimizes the forwarding path to the MN in the wire-line section.