• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.1371-1374
• /
• 2001

핸드오프는 이동국이 통화 중에 이동하더라도 새로운 통화 채널을 확보하여 진행중인 호를 새로운 채널로 전환하는 과정이다. 본 논문은 IMT-2000 망에서 MSC 간 핸드오프 과정의 설계를 목적으로 한다. 이와 관련하여 IMT-2000 망 구조를 기술하고, IMT-2000 MSC 간 핸드오프 처리 방안으로 B-ISUP 메시지를 이용한 방안과 IS-41의 MAP을 이용한 방안을 비교 분석하였다. 또한, IS-41 MAP 기반의 MSC 간 핸드오프 호 처리 절차에 대해 기술하고, 핸드오프 기반의 IMT-2000 교환기 소프트웨어 블록 구조 및 기능을 설계하였다. 그리고, IMT-2000MSC간의 핸드오프 경로 구성 방안을 제시하고, IS-634와 IS-41 MAP규정을 만족하는 IMT-2000망에서의 MSC간 핸드오프를 위한 교환기 내부 소프트웨어 블록간의 호 흐름을 설계하였다.

• Journal of KIISE:Information Networking
• /
• v.34 no.1
• /
• pp.41-47
• /
• 2007

The Hierarchical Mobile IPv6 (HMIPv6) has been proposed to accommodate frequent mobility of the Mobile Node and to reduce the signaling load. A Mobility Anchor Point is a router located in a network visited by the Mobile Node. The Mobile Node uses the Mobile Anchor Point as a local Home Agent. The absence of any protections between Mobile Node and Mobile Anchor Point may lead to malicious Mobile Nodes impersonating other legitimate ones or impersonating a Mobile Anchor Point. In this paper, we propose a mechanism of the secure Mobile Anther Point discovery in HMIPv6. The performance analysis and the numerical results presented in this paper show that our proposal has superior performance to other methods.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.2 s.344
• /
• pp.16-21
• /
• 2006

Internet Engineering Task Force(IETF) proposed the Hierarchical Mobile IPv6(HMIPv6) to support mobility efficiently. The HMIPv6 was developed to reduce the signaling overhead and delay concerned with Binding Update in Mobile IPv6. However, the HMIPv6 still need a further enhancement for supporting the real-time application because HMIPv6 only concerns with the latency resulted within a MAP For providing seemless handoff we propose a scheme that can reduce latency when Mobile Node changes a MAP. Also we compare the HMIPv6 with the proposed scheme through a analysis model.

• Journal of KIISE:Information Networking
• /
• v.31 no.2
• /
• pp.131-145
• /
• 2004

Mobile IP has been designed only to maintain communications as mobile devices move from a place to a place, so it does not guarantee Quality of Service (QoS). Hierarchical MIPv6 improved QoS somewhat using Mobility Anchor Point(MAP), but QoS guarantee problem still remains. QoS in mobile IP is important to provide multimedia and real-timeapplications services in a mobile environment, and QoS is closely related to handoff delay. Therefore, handoff delay problem is actively studied as a main issue in mobile IP research area to guarantee QoS. In this paper, we suggest SNMP Information-based routing that adds keyword management method to Information-based routing in an active network in order to resolve such a problem, Suggested QoS controlled method and existing handoff method, simulations are carried out with NS-2 for performance evaluation. The results of simulations show an improvement on handoff delay, and consequently the QoS improvement.

• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.213-218
• /
• 2004

Recently MIP becomes more important for the macro mobility support in the emergence of the global system such as IMT-2000. However this Protocol suffers from many weaknesses on the location management. MIPv4 regional registration is presented for the local registration of MNs. MIPv6 can benefit from the reduced mobility signaling with external networks by employing a local MAP, that is called HMIPv6. The total signaling cost of HMIPv6 is rapidly increased by the number of CNs of an MN when the MN moves around between MAPs. In this paper, we propose a new location management scheme in MIPv6 that reduces the total signaling cost in the location update based on HMIPv6 Here the MN does not send the BU to CNs and HA when it moves around between MAPs. Instead it informs the current location by transferring the modified BU to the previous MAP. According to the results of the performance analysis, we determine the upper bound for the number of forwarding links allowed among adjacent MAPs without the BU information.

• KSCI Review
• /
• v.14 no.1
• /
• pp.265-271
• /
• 2006

In this paper, we propose a new automatic fingerprint identification system that identifies individuals in large databases. The algorithm consists of three steps: preprocessing, classification, and matching, in the classification, we present a new classification technique based on the statistical approach for directional image distribution. In matching, we also describe improved minutiae candidate pair extraction algorithm that is faster and more accurate than existing algorithm. In matching stage, we extract fingerprint minutiaes from its thinned image for accuracy, and introduce matching process using minutiae linking information. Introduction of linking information into the minutiae matching process is a simple but accurate way, which solves the problem of reference minutiae pair selection in comparison stage of two fingerprints quickly. This algorithm is invariant to translation and rotation of fingerprint. The proposed system was tested on 1000 fingerprint images from the semiconductor chip style scanner. Experimental results reveal false acceptance rate is decreased and genuine acceptance rate is increased than existing method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.7A
• /
• pp.746-754
• /
• 2007

In this paper, we propose a fast handoff algorithm for micromobility management enhancement in HMIPv6 networks, which eliminates the DAD procedure involved in the regular HMIPv6 in order to o decrease handoff latency and increase the resource utilization efficiency. In the proposed scheme, the MAP is designed to guarantee the uniqueness of MN's interface identifier within a MAP domain as long as the MN moves in a MAP domain, so that the MN configures the new address without the DAD procedure resulting in the decreased handoff latency significantly When the MN resides in a subnet, MIPv6 is used adaptively as a mobility management protocol, which is to reduce bandwidth waste from the IP packet header overhead of IP-in-IP tunneling from the regular HMIPv6. We evaluate the performance of the proposed handoff micromobility algorithm in terms of handoff delay and packet loss 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, MIPv6 and HMIPv6.

• Journal of Industrial Technology
• /
• v.26 no.B
• /
• pp.207-213
• /
• 2006

Mobility Anchor points are used for the mobility management in HMIPv6 networks. Currently a mobile node selects the MAP farthest away from itself as a new MAP among available candidates when it undertakes a macro hand off. With this technique, however, the traffic tends to be concentrated at a MAP with the largest domain size and the communication cost increases due to the distance between the mobile node and the MAP. In this work, we propose a novel scheme to select a MAP to minimize the communication cost, taking the mobile node's moving speed and data rate into account. To come up with the scheme we analyses the communication analyses the communication cost into the binding update cost and the data packet delivery cost, and derive an equation representing the optimal MAP domain size to minimize the total cost.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.445-450
• /
• 2006

IPv6를 사용하는 계층적 모바일 인터넷(HMIPv6)에서는 단말의 이동을 관리하기 위해 MAP (Mobility Anchor Point)를 사용한다. 현재는 매크로 핸드오프 발생 시 단말로부터 가장 멀리 떨어져있는 MAP을 선택하는 기법을 사용하고 있다. 그러나 이 경우 하나의 큰 MAP으로 전체 부하가 몰리는 문제와 이동 단말과 MAP 간의 긴 거리로 인해 통신 비용이 증가하는 문제가 있다. 따라서 이 연구에서는 단말의 이동속도와 패킷 전송률을 종합적으로 고려하여 새 MAP 영역에서 소요될 이동지역비용을 계산하고 이를 최소화하는 MAP 도메인 크기를 구하여 실제 서비스 받을 MAP들 중 이와 가장 유사한 크기의 MAP을 선택하는 기법을 제안한다.

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

IETF 에서는 이동노드와 다른 엔티티들 사이에서 발생하는 시그널링을 줄이기 위하여 계층적 이동성 관리 프로토콜(HMIPv6)을 제시하고 있다. HMIPv6는 MAP이라는 새로운 엔티티를 도입하여 특정 지역 내에서 지역 흠 에이전트의 역할을 수행하도록 함으로써 이동노드와 다른 엔티티 간에 발생하는 시그널링을 줄이고, Mobile IPv6의 핸드오프 성능을 개선하도록 하고 있다. HMIPv6에서는 MAP과 이동노드 사이의 인증을 위해 IKE 와 같은 보안 프로토콜을 사용하도록 정의하고 있다. 본 논문에서는 많은 부하가 걸리는 IKE 대신에 RR(Return Routability) 절차를 이용하여 이동노드와 MAP 사이의 인중을 제공하는 방법을 제안한다.