• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.625-632
• /
• 2005

Recently, real time services have been demanding a lot and the number of mobile devices is increasing extremely. Many researchers are focusing on decreasing handoff or signaling cost, produced when mobile devices are moving around. With these efforts, HMIPv6(Hierarchical Mobile Internet Protocol Version 6) was proposed. Mobile nodes do not need to register their locations to Home Agents whenever crossing over subnets within a MAP domain. In HMIPv6, mobile nodes choose the farthest MAP without considering node mobility pattern. However, a large MAP domain is not always efficient for a slow moving node and required additional work to choose a MAP in HMIPv6. Hence, this paper proposes 'Performance Analysis of HMIPv6 applying adaptive MAP Domain Site'.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1344-1367
• /
• 2014

Mobile traffic is increasing a masse because of the propagation of the Internet and the development of wireless mobile technology. Accordingly, the Network Local Mobility Management (NETLMM) working group [1] of the Internet Engineering Task Force (IETF) has standardized Proxy Mobile IPv6 (PMIPv6) [2] as a protocol for accomplishing the transmissibility of mobile terminals. PMIPv6 is a network-led IP-based mobility management protocol, which can control terminal mobility without depending on the type of access system or the capability of the terminal. By combining PMIPv6 and the mobility of Session Initiation Protocol (SIP), we can establish terminal mobility and session mobility through a more effective route. The mobility function can be improved and the overlap of function reduced as compared to that in the case of independent operation. PMIPv6 is appropriate for a non-real-time service using TCP, and SIP is appropriate for a real-time service using RTP/UDP. Thus, in the case of a terminal using both services, an effective mobility management is possible only by using PMIPv6 together with SIP. In order to manage mobility in this manner, researches on PMIPv6-SIP are in progress. In line with this trend, this paper suggests a new PMIPv6-SIP architecture where when a mobile terminal conducts a handover, a network-led handover while maintaining the session without the addition of a special function or middleware is possible along with effective performance evaluation through mathematical modeling by comparing the delay and the packet loss that occur during the handover to the Pure-SIP.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1B
• /
• pp.1-9
• /
• 2009

In this paper, we propose an enhanced handoff support scheme based on network-based mobility management protocol, Proxy Mobile IPv6 (PMIPv6), which is actively standardized by the IETF NETLMM working group. By utilizing the dynamic virtual hierarchy network architecture between mobile access gateways (MAGs), the proposed scheme can support network scalability and reliability to wireless access network. In addition, we propose pre-authentication process based on the policy store (PS) to support a fast and seamless handoff. We evaluate the performance of the proposed scheme in terms of handoff delay and end-to-end delay thru computer simulation. Thru, various computer simulation results, we verified the superior performance of the proposed scheme by comparing with the results of other schemes.

• Annual Conference of KIPS
• /
• 2012.04a
• /
• pp.583-585
• /
• 2012

PMIP (Proxy Mobile IPv6)은 네트워크 기반 이동성 지원 프로토콜로, 호스트 기반 이동성 프로토콜에 비해 핸드오버 시간을 줄였지만 완전히 제거하지 못하였고 핸드오버 시의 패킷 손실에 대해서도 고려하지 않는다. 따라서 핸드오버 시간을 줄이고 패킷 손실을 방지하여 끊김 없는 서비스를 제공하기 위한 빠른 predictive 핸드오버 방식이 제안되었다. 하지만 이 방식을 이용할 경우 predictive 모드에서의 핸드오버 절차를 진행하기 위해 불필요한 핸드오버 지연이 발생할 수 있다. 본 논문에서는 GPS를 이용하여 MN (Mobile Node)의 위치정보를 파악하고 이를 통해 predictive 모드에서의 빠른 핸드오버 절차 진행 시 발생하는 문제점 해결을 위한 기법을 제안한다.

• Information and Communications Magazine
• /
• v.19 no.7
• /
• pp.72-77
• /
• 2002

This paper introduces the Future Technologies for Universal Radio Environment (FUTURE), which is China's wireless communications research project oriented to beyond 3G systems. The features and basic requirements of the FUTURE project are described, and the system structure, which is based on IPv6 core network, is proposed. The key techniques for FUTURE project are also addressed.

• The Journal of the Korea Contents Association
• /
• v.1 no.1
• /
• pp.130-136
• /
• 2001

Real-time applications like VoIP in mobile networks need smooth handovers in order to minimize or eliminate packet loss as a mobile host(MH) transitions between network links. In this paper, we design a new variable buffering mechanism for IPv6 by which an MH can request that the router on its current subnet buffers pad(eta on its behalf while the MH completes registration procedures with the router of a new subnet. Performance results show that our proposed queueing scheme with a variable space allocation is quite appropriate for mobile internet environment in terms of the packet loss rate.

• Annual Conference of KIPS
• /
• 2011.04a
• /
• pp.945-948
• /
• 2011

기존의 모바일 IPv6에서 경로 최적화를 하기 위해 바인딩 업데이트를 할 때 RR 프로토콜을 사용한다. IPv6에서 바인딩 업데이트는 이동노드가 홈 네트워크에서 외부 네트워크로 이동했을 때 Home Agent와 Correspondent Node(CN)에게 전송하며 이 과정에서 몇 가지 취약점으 가지고 있다. HoIT와 CoIT 메시지는 서로 연관이 없으며 이동 단말과 HA사이에만 IPSec으로 보호된 터널이 존재하고 HA와 CN 사이에는 보호되지 않는다. 따라서 공격자는 CN과 가까이에 위치하여 자신의 CoA를 CN에게 CoIT를 보내 토큰을 받아서 CN과 바인딩 업데이트를 할 수 있다. 바인딩 업데이트가 끝나면 두 노드사이는 정상적인 통신을 할 수 있고 공격자에 의해 위험에 노출 될 수 있다. 또한 CoIT 메시지를 보내면 CN에서는 토큰을 생성하게 되므로 공격자가 다수의 기기를 획득해 CN에게 계속 CoIT를 보내면 계속 토큰을 만들어야 하므로 다른 정상적인 노드의 통신을 방해할 수 있다. 따라서 이 논문에서는 이러한 RR프로토콜에 대한 문제점을 분석하고 이러한 문제점을 해결 할 수 있는 개선 방안을 논의 해본다.

• Journal of KIISE:Information Networking
• /
• v.32 no.4
• /
• pp.508-514
• /
• 2005

The research in internetworking between UMTS and WLAN, which is completed with merits and demerits, Is actively progressed to establish global roaming environments. This internetworking is classified into two groups: loosely-coupled and tightly-coupled. h tightly-coupled mechanism demands lots of investment and considerable amountof time to construct, which is directly connoted between UNTS and WLAN via IWU. On the other hand, a tersely-coupled mechanism is more scalable and easier to implement than a tightly-coupled one while it has critical drawbacks of packet loss and blocking of services due to handover delay. To alleviate these drawbacks. this work proposes a handover scheme between UMTS and WLAN, which is based on HMIPv6. The performance of the proposed scheme is evaluated by the simaulation. The proposed internetworking scheme based on HMIPv6 shows hotter performance than those based on MIPv6.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.687-695
• /
• 2005

With increasing demand of using mobile Internet, HMIPv6 is proposed by IETF to reduce location management traffics due to micro mobility and to provide IP-based movement. A paging mechanism combined with HMIPv6 can reduce the signaling traffics of a mobile node. We propose a dynamic paging mechanism in HMIPv6 which decides an optimal paging area for each mobile node by considering its characteristics. Total costs of a static paging mechanism and a dynamic paging mechanism are analyzed by mathematical formulas. As a result, we proved that the dynamic paging mechanism reduced total signal traffic costs more than a static paging mechanism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8B
• /
• pp.1115-1121
• /
• 2010

The DNAv6 was designed to support fast attachment for a host, which is corresponding to the movement detection part in the mobility management. Since, however, the DNAv6 has supported only DNAv6-capable ARs and DNAv6-capable hosts, an non-DNAv6 host could not support fast handoff function in a DNAv6 network. In this paper, we consider a new method of the fast attachment of non-DNAv6 hosts. To support the non-DNAv6 host in DNAv6 networks, we suggest a novel algorithm, RCA algorithm, where an AR can decide whether a host has the DNAv6 function and whether it has moved to a new link or not, and then the AR can inform the host of new link information. For the RCA algorithm, we proposed to modify the RS message and the Reconf_Link message with addition of some fields. To validate our RCA algorithm and its performance, we have accomplished simulation tests for the ND process, the DNAv6 process and the modified DNAv6 process with our RCA algorithm. In the viewpoints of the attachment delay and complexity, the proposed algorithm gives the better delay performance than the ND process while it presents the less complexity than the DNAv6 process.