• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.343-354
• /
• 2003

This paper describes algorithm that minimizes recovery time of packet loss resulting from handoff in multicast environments and guarantees reliability through interaction of FN(Foreign Network) with PMTP(Predictable Multicast Tree Protocol). To solve the problems that inefficient routing and handoff delay taking plate when using hi-directional tunneling and remote subscription independently in multicast environments, proposed algorithm uses tunneling and rejoining multicast group according to the status of an arriving FA in a foreign network. Furthermore, proposed algorithm sends packet loss information and register message to previous FA or current FA at the same time. so, MH is able to recovery packet loss in handoff delay as soon as possible. As a result of performance analysis, proposed algorithm is more efficient than previous researches and is applicable to existing handoff method without requiring additional procedures.

• The Journal of the Korea Contents Association
• /
• v.3 no.2
• /
• pp.65-72
• /
• 2003

In this paper, the new scheme using a Combined Cache(CC) that combing the Paging and Routing Cache(PRC) and an alternative handoff method according to the type of data transmission for achieving the efficient realtime communication. The PRC and quasi-soft handoff method reduce the path duplication. But they increase the network traffic load because of the handoff state packet of Mobile Host(MH). Moreover the use the same handoff method without differentiating the type of transmission data. Those problems are solved by operating U with a semi-soft handoff method for realtime data transmission and with a hard handoff method for non-realtime data transmission. As a result or simulation a better performance is obtained because of the reduction of the number of control packet in case that the number of cells are below 20. And the packet arrival time and loss of packet decreased significantly for realtime data transmission.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.80-83
• /
• 2009

The most popular communication protocol is those defined by the IEEE 802.11 WLAN to support broadband internet connection. The demand for real-time multimedia service is increasing through WLAN on the road. The Hand-off function of mobile terminal is essential to support mobility. But, the hand-off function of IEEE 802.11 WLANs has the latency up to 300ms, and recent research has focusing on channel scanning and reconnection to AP and certification process of AP. It is also the lack of consideration in related works that hand-off happens frequently when the mobile node is moving. This paper proposed the hand-off algorithm that guarantees high throughput and estimates the point which may occur hand-off using GPS information and RSSI. We implement the proposed hand-off function that achieves the best performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12B
• /
• pp.1063-1069
• /
• 2004

There are some problems with the methods of paging and routing cache(PRC) and quasi soft handoff that are proposed to improve the performance for the transmission of real time data. This paper proposed a reasonable solution of these problems by proposing a new method using a combined cache(CC) and applying a different handoff procedure according to each type of data. The combined cache dose not maintain the handoff state but the idlle/active state. The simulation results in a better performance than the above methods in terms of the control packet traffic load, initial recevied data packet traffic load and arrival tune of real time packet at the epoch of handoff.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11S
• /
• pp.3675-3683
• /
• 2000

The Handoff is the core technical factor that is required when mobile host moves from one area to another, while transmitting and receiving data. The existing works try to minimize the loss of pockets by forwarding packets to the Cell which a mobile host will move to. However, though the loss quantity is little, the accumulated loss can del(rade the performance of the TCP, and can be a serious problem if data is sensitive to the loss of packets. In this paper, we can reduce a memory requesting in FA by restricting the mobile host to move within at most 2 movable cells and design the improved handoff protocol for Mil to receive packets seamlessly in spite of handoff. We can evaluate that the suggested method is superior to the previous method, as a result of comparing with it.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.4
• /
• pp.411-420
• /
• 2000

The performance of soft handoffs of CDMA mobile communication systems is potentially determined by several factors such as handoff-related system parameters (T_ADD, T_DROP, T_COMP, T_TDROP), mobile stations' mobility, service areas, capacity of base stations. Due to the importance of handoffs in mobile communications, several methods have been proposed and tested through computer simulations to prove the efficiency of proposed methods. Different assumptions on the above mentioned factors often produce different simulation results. Therefore, the credibility of a simulation result is directly determined by the objectivity of the assumptions made by the simulation. This paper proposes a new soft handoff method that controls handoff delay time based on a mobile station's speed, and compares it with the current method of CDMA systems. The simulation results showed that the new method is much more efficient for mobile stations that are free in their moving direction and space than for those restricted in their moving direction and space. In addition, the results showed that even the same handoff method may produces different simulation results depending on whether a service area is modeled as two-dimensional space or three-dimensional space. These results indicate the importance of suitable models of user mobility, especially the movement types and space allowed for mobile stations, which have been neglected in simulation studies of mobile communications.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.11 s.353
• /
• pp.159-167
• /
• 2006

IEEE 802.11i standard specifies full authentication and preauthentication for secure handoff in 802.11 wireless LAN (WLAN). However, the full authentication is too slow to provide seamless services for handoff users, and preauthentication may fail in highly populated WLAN where it is highly probable that the cache entry of a preauthenticated user is evicted by other users before handoff. In this paper, we propose a fast and secure handoff scheme by reducing authentication and key management delay in the handoff process. When a user handoffs, security context established between the user and the previous access point (AP) is forwarded from the previous AP to the current AP, and the session key is reused before the handoff session terminates. The freshness of session key is maintained by regenerating session keys after handoff session is terminated. The proposed scheme can achieve considerable reduction in handoff delay with providing the same security level as 802.1X authentication by letting an AP authenticate a handoff user before making an robust security network association (RSNA) with it.

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

차세대 네트워크의 출현으로 다양한 형태의 통신망 들 간의 융합이 중요해졌다. 무선 망의 경우 이질적인 망들 간의 통합 및 융합이 이루어지기 위해서는 끊김 없는 이동성 지원이 매우 중요하다. 끊김 없는 이동성 지원은 이질적인 무선망 간의 이동시에도 지속적으로 세션을 유지하는 기능을 말한다. 이러한 기능을 핸드오프 기법이라 하며 현재 다양한 연구가 진행 중이다. 본 논문에서는 현재 제안되어 있는 핸드오프 기법 중 USHA(Universal Seamless Handoff Architecture)를 기반으로 하여 적용하기 쉬우며 확장성과 신뢰성을 보장하는 핸드오프 모델을 제안한다.

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

모바일 멀티미디어 서비스에서는 핸드오프의 효율적인 처리를 통한 QoS를 보장하는 것이 중요하다. 본 논문에서는 기존 핸드오프 기법의 경로 최적화, 회선의 재활용률, 핸드오프 수행시간 등의 문제점을 개선을 위해 Crossover Switch(CX)탐색 기법에 적용되는 기존의 Loose select, Prior path knowledge와 제안한 Hybrid CX 탐색 알고리즘의 성능분석을 위해 C#을 사용하여 시뮬레이터를 구현하고 회선 재이용률, 경로 최적화 정도를 비교분석하였다. 실험결과 제안한 Hybrid CX 탐색 알고리즘이 우수하다는 것을 확인하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.673-675
• /
• 1999

본 논문은 기존의 유선환경에서의 서비스 환경을 이동 환경에서도 지원하기 위한 분산 구조를 다루고 있다. 이를 위하여 이동 단말기를 논리적으로 대신하는 이동 AP의 위치를 추적하는 추적 AP를 두어 기존의 응용 환경에서 수행되던 응용 프로그램들을 무선이동 환경에서도 수용할 수 있도록 하였다. 이동 단말기의 위치 변경에 따른 이동 AP, 추적 AP 사이에서 발생되는 핸드오프처리 알고리즘이 소개되었으며, 이 알고리즘은 패킷 손실이나 순서의 변경과 같은 흐름제어 기능을 포함하고 있다. 또한 무선 환경에서 발생 가능한 핸드오프와 소프트 핸드오프를 함께 고려하였다. 시뮬레이션의 결과는 핸드오프 과정에서의 추가 지연 시간에 대한 내용을 다루고 있다.