• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11B
• /
• pp.1269-1276
• /
• 2011

In the Proxy Mobile IPv6 (PMIPv6), the data transmission performance may be degraded when the two communicating hosts are located within the same mobile domain, since all the data packet shall be delivered by way of Local Mobility Anchor (LMA). In this paper we propose an extensional scheme of PMIPv6 using binding query. In the proposed Query-based PMIPv6 (Q-PMIPv6) scheme, the Mobile Access Gateway (NAG) of Correspondent Node (CN) sends a binding query to LMA to obtain the Proxy Care-of-Address of Mobile Node (MN). Since then, CN and MN can communicate with each other by using an optimized data path. For comparison, we performed the numerical analysis and the ns-2 simulations for the proposed Q-PMIPv6 scheme and the existing PMIPv6 and PMIPv6 Localized Routing (PMIPv6-LR). From the results, we can see that the proposed scheme outperforms the existing PMIPv6 and PMIPv6-LR schemes in terms of the signaling control and data delivery costs.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1417-1420
• /
• 2004

The combination of Fast-Handoff and Hierarchical Mobile IPv6 (F-HMIPv6) allows the anticipation of the layer3 handoff such that data traffic can be efficiently redirected to the mobile node's new location before it moves there. However, after moving to the new Access Router (NAR), if the mobile node (MN) sends the Local Binding Update (LBU) to the Mobility Anchor Point (MAP) before receiving all of the buffered packet from the NAR, the MN may receive the general packet from the MAP. That is, the MN may simultaneously receive two types of packet which has different sequence number. These cause the confusion in packet order, and the MN sends the dup ack for the packet retransmission to the CN. It results in the degradation of the TCP performance. Therefore, we propose the scheme for minimizing the out-of-sequence packet in F-HMIPv6.

• 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.

• Journal of Internet Computing and Services
• /
• v.14 no.3
• /
• pp.67-79
• /
• 2013

In wireless networks, efficient mobility management to support of mobile users is very important. Several mobility management schemeshave been proposed with the aim of reducing the signaling traffic of MN(Mobile Node). Among them, PMIPv6 (Proxy Mobile IPv6) is similar with host-based mobility management protocols but MN does not require any process for mobility. By introducing new mobile agent like MAG (Mobile Access Gateway) and LMA (Local Mobility Anchor), it provides IP mobility to MN. In this paper, we propose the analytical model to evaluate the mean signalingdelay and the mean bandwidth according to the type of MN mobility. As a result of mathematical analysis, MF-PMIP (Multicasting-based FastPMIP) outperforms compared to F-PMIP and PMIP in terms of parameters for the performance evaluation.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05b
• /
• pp.1301-1304
• /
• 2003

Mobile IP는 현재의 인터넷에서 노드가 링크를 변화시킬 때 통신이 지속 될 수 있도록 Mobility를 제공하기 위한 방안이다. Mobile IP는 MN(Mobile Node)가 HA(Home Agent) 와 FA(Foreign Agent) 사이에서 링크가 변화할 매 CN(Correspondent Node)와 지속적인 통신을 할 수 있도록 한다. 그러나 FA에서 FA로 MN이 노드의 위치를 바꿀 때에는 핸드 오프가 발생하여 패킷이 손실 될 수도 있다. 본 논문은 MN이 여러 FA를 이동할 때 발생하는 패킷 손실에 대한 경우를 살펴 이를 해결하기 위한 Seamless 핸드오프(Handoff) 알고리즘을 기술한다.

• 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.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.594-596
• /
• 2011

PMIPv6 (Proxy Mobile IPv6)은 MN (Mobile Node)를 대신하여 액세스 망에서 MN의 이동성을 지원하는 네트워크 기반의 이동성 관리 프로토콜이다. 기존의 PMIPv6는 MN과 Corespondent Node (CN) 간 통신을 할 때, 교환하는 데이터 패킷은 LMA (Local Mobility Anchor)를 경유하고 MAG (Mobile Access Gateway)를 경유해서 전송하기 때문에 시그널링 코스트가 증가하고 전송 지연 문제가 발생한다. 따라서 본 논문은 MN이 도메인 내 핸드오버를 했을 시, LMA에서 MAG를 경유하지 않는 경로 최적화를 제시한다.

• Journal of KIISE:Information Networking
• /
• v.35 no.6
• /
• pp.538-548
• /
• 2008

In the Internet Engineering Task Force(IETF), Next Step in Signaling(NSIS) working group, proposed a mechanism to discover the Crossover Node(CRN), when the route is changed by Mobile Node(MN) handover. The CRN is divergence or convergence node on old and new path for reserving resources. Trough the CRN discovery mechanism, it possible to reduce a signaling delay and avoid the redundant reservation on the common path between old and new path. However, the QoS(Quality of Service) can be guaranteed continuously while the MN is performing handover, it is needed to pre-reserve the resource on the new path before completion of the handover. When the nodes on the new path try to make a pre-resource reservation before the handover, it is difficult to pre-reserve the resource with the existing CRN discovery mechanism. Therefore, we proposed a Passive CRN(PCRN) discovery scheme and pre-resource reservation mechanism. The PCRN which means an initial common point between the current reserved and the new paths, where the handover can take place.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.411-413
• /
• 2000

Internet망에서 mobile comupting에 대한 관심은 커져하고 있다. Mobile IP는 노드의 이동성을 지원하는 방법 중의 하나이다. 그렇지만 handoff 하는 과정에서 발생하는 패킷 손실 때문에 신뢰성의 문제가 발생한다. 게다가 mobile node(MN)와 foreign agent(FA)사이가 무선 링크인 경우 패킷 손실은 더욱 심각하다. TCP/IP는 고정된 네트워크에서 고안되어진 것이기 때문에 기존의 TCP/Mobile IP가 무선에는 부적합하다. 그러므로 본 논문에서 TCP/Mobile IP와 application사이에 midddleware로써 mobile agen(MA)를 사용하는 것을 제안했다. TCP mobile agent(TCP MA)을 여러 application에서 TCP 성능의 향상을 위해 제안했다. TCP MA는 FA와 MN를 위해 행동하고, 그리고 MN의 현재 위치에 상관없이 MN에 결과를 보낸다. 이러한 TCP MA는 handoff 동안에 발생하는 패킷 손실을 감소시킨다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.99-114
• /
• 2012

Proxy Mobile IPv6 (PMIPv6) has received considerable attention between telecommunications and the Internet communities and does not require active participation of the Mobile Node (MN) by way of network-based mobility management. The PMIPv6 domain is studying establishment in progress to support extensively a number of MN by using a low handover latency. In this research, we are propose a novel 3S scheme for building Scalable and Secure and Seamless PMIPv6 domains. In the proposed scheme, all of Mobility Access Gateway (MAG) are acting as the Local Mobility Anchor (LMA) and composing a virtual ring with another MAG. General hashing is used in the efficient distribution-mapping between each MN and the MN's LMA of all MAGs. And, MAG and MN are authenticated using the symmetric key. Through mathematical analysis, we verifies the safety, scalability, and seamless service for 3S. Also, we're propose a handover procedure of 3S and show better than the existing schemes in terms of handover latency.