• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.139-141
• /
• 2004

무선 LAN은 기존의 유선 LAN 기능을 무선 주파수를 전송 매체로 이용하여 제공할 수 있도록 하고자 하는 것으로, 높은 전송 대역폭을 지원해 주는 기술 표준화와 단말 가격의 인하로 빠르게 대중화에 성공하고 있다. 무선 LAN에서의 빠른 이동성지원(fast handoff) 은 QoS가 요구되는 서비스를 지원하기 위한 필수적인 요소이다. 현재의 이동성 방안은 단말이 AP의 존재를 파악하고 이동할지를 결정하는 방법인데, 이와 같은 방법은 단말에 부하가 많고 시간이 오래걸리게 되며 이동을 결정하는 데 알수 있는 정보도 제약된다. 논문에서는 단말의 부하를 줄이고 더 빠르게 이동성을 지원할수 있는 방법으로 AP가 단말의 존재를 파악하고 단말에게 이동 정보를 알려주는 방법을 제시한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.175-177
• /
• 2005

여러 네트워크에서 사용자의 이동이나 인증 결과 처리를 최소하기 위한 서비스가 발전하고 있다 그러나 인증, 권한 검증, 과금을 지원하는 AAA 기반의 망에서는 매 등록이 발생할 때 마다 새로운 세션 키가 필요하며 이를 위해 홈 망까지 등록 절차가 수행되어야 한다. 이것은 이동 노드 재인증 절차와 방문 홈에서 홈 망까지의 통신으로 인한 지연이 발생할 수 있다. 이같은 지연을 방지하기 위해 본 논문에서는 홈망의 AAA 서버와 상관없이 이전의 할당된 세션 키를 이용하여 빠른 핸드오프 기법을 제안한다. 본 제안 방식은이전 방문 에이전트와 새로운 방문 에이전트간에 제 3자로 하여금 키를 공유하고 홈망까지의 통신이 필요없고 세션키의 기밀성과 무결성이 보장되도록 수행할 수 있다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.219-236
• /
• 2014

In this paper, we propose a novel Proxy Mobile IPv6 network bandwidth-efficient handoff scheme. MN are classified into slow and fast one. At first MN should be registered in the microcell for bandwidth efficient handoff scheme. microcell is overlapped to handle the overflow session request which is nested. Overflow session request in macrocell requests to go back from the boundary of the microcell to new microcell. If idle session traffic is in a cell, it is requested by the target microcell. Analysis model was developed, an existing session of the session blocking probability and forcing termination probability of the session request have improved considerably. If the total traffic load of the system is not very large, the proposed scheme has the best bandwidth efficiency and provides better quality of service (QoS) to MN without costs of a lot of processing on the system.

• The Journal of Korean Association of Computer Education
• /
• v.10 no.5
• /
• pp.81-88
• /
• 2007

To support the movement of a mobile network consisting of several mobile nodes, the IETF NEMO working group proposed NEMO basic support protocol using bi-directional tunneling between the home agent and the mobile router. Since NEMO basic support protocol is based on bi-directional tunneling, all communications to and from mobile nodes are suffer from inefficient routing all the cases. To solve the routing inefficiency problem, several proposals are proposed. However, those proposals results in new problems, such as binding update storm and changes in existing protocol. Especially, binding update storm problem may cause the delay in binding update, this subsequently causes the difficulty for a real time service and the handoff delay on the movement of mobile network. In this paper, we propose a new binding update scheme which reduces binding update latency and the handoff delay through the distribution of the transmission time of binding update messages. The performance of the proposed scheme is also evaluated to demonstrate its efficiency. Simulation results show that the proposed scheme can efficiently reduce the binding update latency.

• Journal of Internet Computing and Services
• /
• v.7 no.3
• /
• pp.1-11
• /
• 2006

If a mobile node out of home domain asks to provide mobility service, the mobile should be permitted by the home domain. This can be accomplished by the usage of AAA but the recent studies have shown its weakness to fail the ability of mobile node. This study suggests Fast Handoff model which will shorten permission time by AAA and allow the mobility service to be more efficient. Our suggestion with Assertion function is a new approach to assist authentication capability through mutual authentication of each V_AAA when the distance between HA and itself gets far or its delay time becomes longer. Our suggestion verifies its efficiency by cost analysis.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.568-570
• /
• 2002

최근에 IETF Mobile IP WG과 SeaMoby WG에서 2계층 트리거를 이용한 빠른 핸드오프 기법을 공통적으로 논의하고 있으나, 아직 이들 WG에서는 제출된 기고서에 대한 표준을 정의하지 않고 있다. 따라서 본 논문에서는 2계층 트리거를 이용한 빠른 핸드오프를 기존의 Mobile IP와 지역적 등록 기법에 적용하여 성능을 검증한다. 이를 위하여 OPNET을 이용한 시뮬레이션을 통해 핸드오프 등록 지연 및 수율의 성능을 평가한다. 그 결과에서 빠른 핸드오프를 적용할 경우 두 기법 모두 에이전트 메시지의 방송 주기에 무관하게 성능을 향상됨을 확인할 수 있다.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.97-106
• /
• 2002

In 3GPP2 standard, MIP is used and a PDSN performs the function of FA to support macro mobility. When a MS is roaming from a PDSN area to another, the mobility supported is called macro mobility, while it is called micro mobility when a MS is roaming from a RN area to another in a PDSN area. Since a PDSN performs the function of FA in 3GPP2 standard, it is possible to support mobility but its mechanism is actually for supporting macro mobility, not for micro mobility, thus it is weak in processing fast and seamless handoff to support micro mobility. In this paper, we suggest the seamless handoff algorithm barred on multicast group mechanism to support micro mobility. Depending on the moving direction and velocity of a MS, the suggested algorithm constructs a multicast group of RNs on the forecasted MS's moving path, and maximally delays RNs'joining to a multicast group to increase the network efficiency. Moreover, to resolve the buffer overhead problem of the existent multicast scheme, the algorithm suggests that each RN buffers data only after the forecasted handoff time. To prove deadlock freeness and liveness of the algorithm. we use state transition diagrams, a Petri-net modeling and its reachability tree. Then, we evaluate the performance by simulation.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.277-282
• /
• 2002

In general, requirements for QoS are different according to the type of services in wire-line and wireless ATM networks, and real-time video service is more sensitive to cell transmission delay than to cell loss. Existing handoff schemes emphasizing prevention of cell loss had limitations in cell transmission delay to satisfy QoS. In this paper, a novel scheme to transmit ATM cells with low CLP(when CLP = 0) prior to others and discarding cells with high CLP(when CLF = 1) in ATM cell header among cells to be forwarded to new base station during handoffs in real-time VBR service is proposed. The proposed scheme is proven to be suitable for the satisfaction of QoS of real-time VBR service and appropriate for fast handoffs by giving high CLP value to less meaningful MPEG frames through simulations.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.1
• /
• pp.81-92
• /
• 2009

Recently, there is a drastic increase in users interested in real-time multimedia services in the WLAN environment, as the demand of IEEE 802.11 WLAN-based services increases. However, the handoff delay based on 802.11i security policy is not acceptable for the seamless real-time multimedia services provided to MS frequently moving in the WLAN environment, and there is a possibility of DoS attacks against session key derivation process and handoff mechanism. In this paper, a secure and efficient handoff mechanism in the centralized WLAN environment is introduced to solve the security problems. The 4-way Handshake for both mutual authentication and session key derivation is replaced by the 2-way Reassociation process.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.588-591
• /
• 2004

This paper describes a new approach to Internet host mobility. We argue that local mobility, the performance of existing mobile host protocol can be significantly improved. It proposes Fast Moving Detection scheme that based on neighbor AP channel information and moving detection table. And, it composes Local Area Clustering Path (LACP) domain that collected in AP's channel information and MN interface information. It stored the roaming table to include channel information and moving detection. Those which use the proposal scheme will need to put LACP information into the beacon or probe frame. Each AP uses scheme to inform available channel information to MN. From the simulation result, we show that the proposed scheme is advantageous over the legacy schemes in terms of the burst blocking probability and the link utilization.