• The KIPS Transactions:PartC
• /
• v.14C no.6
• /
• pp.503-508
• /
• 2007

Since the Wibro service realize mobile network on the public, it has been considered that it is not enough to support real time service at vehicular speed. The standard Fast Mobile IPv6 Handover Protocol using HMIPv6 may guarantee seamless service as long as the Mobile Node moves in the same domain MAP however it does not regard fast handover over inter-MAP domain. Thus Macro Mobility Handover in HMIPv6 was proposed to reduce handover latency in inter-MAP domain. But it is still not enough to support real-time service. So we propose an Improved FHMIPv6 over 802.16e network to reduce the overall handover latency. We embedded Layer 3 handover messages of the FHMIPv6 into the Layer 2 handover messages. So the MN is able to $^-nish$ overall handover procedure earlier in our scheme. The numerical results show the performance of IFHMIPv6 has improved about 32% in comparison with FHMIPv6.

• The KIPS Transactions:PartC
• /
• v.15C no.1
• /
• pp.37-44
• /
• 2008

In order to minimize the signaling delay for a resource reservation on the new routing path after the handover of Mobile Node(MN) is completed, it is important to discover the crossover node where the old and new routing paths meet. With the 크로스오버 노드 being found, the signaling messages only need to be transferred on the changed part of the end-to-end path. The crossover node is generally discovered using the end-to-end Session ID(SID) of the established session between MN and Correspondent Node(CN). However, in the Hierarchical Mobile IPv6(HMIPv6) network, if the Mobile Anchor Point (MAP) reserves the resource by aggregate with the Home Agent(HA), the crossover node discovery cannot be performed in the general way since the aggregate SID that has established between the previous MAP and HA is different from the that of the current MAP and HA after MN's handover. In this paper, we propose a mechanism to discover the crossover node within the tunnel between the MAP and the HA in an HMIPv6 network, assuming that the Next Steps in Signaling(NSIS) is deployed for the resource reservation and the aggregate reservation is applied over the MAP and HA tunnel. The local repair required for the change of path is performed upon the crossover node discovery. The simulation results show that the proposed scheme reduces the signaling delay for the reservation and outperforms the existing scheme with respect to throughput during the handover.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7B
• /
• pp.991-1000
• /
• 2010

The Hierarchical Mobile IPv6 (HMIPv6) has been proposed to accommodate frequent mobility of the Mobile Node. HMIPv6 can effectively reduce the signaling overhead and latency. However, it has a problem that the registration of a mobile node concentrates on the furthest MAP(Mobility Anchor Point) when the mobile node enters into a new domain. This paper proposes a new load distribution mechanism by using the concept of Nash Bargaining Solution. The main advantage of the proposed scheme can prevent load concentration from being registered to the specified MAP based on the weight value according to the available resource-ratio of a MAP. With a simulation study, the proposed scheme can improve network performance under widely diverse traffic load intensities.

• 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 Internet Computing and Services
• /
• v.10 no.3
• /
• pp.71-83
• /
• 2009

In this paper, we propose a paging scheme considering local environment and moving patterns of mobile hosts on HMIPv6. The proposed paging scheme can adaptively construct a paging domain according to handoff probability of mobile hosts and local environment, and process a paging based on handoff probability stage by stage. For analysis of the proposed paging scheme, we simulate our scheme in two different experiment environments: an open environment like a square and a restricted environment like downtown. In experiment results, the proposed scheme shows superior performance to that of compared scheme all over. Particularly, in case of high call request rate and a restricted environment, the proposed scheme shows better performance.

• Journal of Communications and Networks
• /
• v.11 no.3
• /
• pp.248-260
• /
• 2009

To connect a mobile ad hoc network (MANET) with an IP network and to carryout communication, ad hoc network node needs to be configured with unique IP adress. Dynamic host configuration protocol (DHCP) server autoconfigure nodes in wired networks. However, this cannot be applied to ad hoc network without introducing some changes in auto configuration mechanism, due to intrinsic properties (i.e., multi-hop, dynamic, and distributed nature) of the network. In this paper, we propose a scalable autoconfiguration scheme for MANETs with hierarchical topology consisting of leader and member nodes, by considering the global Internet connectivity with minimum overhead. In our proposed scheme, a joining node selects one of the pre-configured nodes for its duplicate address detection (DAD) operation. We reduce overhead and make our scheme scalable by eliminating the broadcast of DAD messages in the network. We also propose the group leader election algorithm, which takes into account the resources, density, and position information of a node to select a new leader. Our simulation results show that our proposed scheme is effective to reduce the overhead and is scalable. Also, it is shown that the proposed scheme provides an efficient method to heal the network after partitioning and merging by enhancing the role of bordering nodes in the group.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.105-111
• /
• 2008

Mobility support for mobile networks will be important to minimize the packet overhead, to optimize routing, to reduce handoff latency, and to reduce the volume of handoff signals. Mobile IPv6 (MIPv6) and Hierarchical MIPv6 (HMIPv6) are one of mobility management protocols (MMPs) that provides network layer mobility over all access technologies. However, the communication quality of these candidates is severely degraded during handoffs. As another way to improve the handoff performance of a mobile network by conventional MMPs such as MIPv6 and HMIPv6, we propose a Low Latency Handoff Scheme (LLHS) combining Fast MIPv6 (FMIPv6) with HMIPv6 extension with buffering function, in which Mobility Anchor Points (MAPs) buffer packets destined to the Mobile Routers (MRs) or MNs within a mobile network during handoffs. The simulation results show that the proposed scheme reduces transmission delay and packet loss in UDP communication.

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

계층적인 Mobile IPv6 구조에서 실시간 서비스의 확대와 노드의 이동성 증가에 따라 Mobility Anchor Point(MAP)의 부하가 늘어나는 문제가 발생할 수 있다. 본 논문에서는 IETF(internet Engineering Task Force)의 중요한 마이크로 이동성 프로토콜인 HMIPv6의 기본동작을 설명하고 MAP에서 발생할 수 있는 부하를 하위에 있는 라우터에게 분산시키기 위하여 Passive Approach와 Active Approach 두 가지 방법을 제안하였다. Passive Approach는 MAP가 분산 시점을 결정하여 하위의 라우터에게 부하를 분산해주는 방법이고 Active Approach는 임의의 MAP하위에 있는 라우터가 스스로 분산 시점을 결정하여 MAP로 동작하여 MAP에서 발생할 수 있는 부하를 줄이는 방법이다.

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