A QoS Guaranteed Fast Handoff Algorithm for Wireless Local Area Network Environments

Il-Hee SHIN; Chae-Woo LEE

A QoS Guaranteed Fast Handoff Algorithm for Wireless Local Area Network Environments

Il-Hee SHIN, Chae-Woo LEE

Full Text Views

0

Share
Cite this

Summary :

Proposed CCRSVP (CandidateCasting RSVP) algorithm is a new fast handoff method for IEEE 802.11 Wireless LAN (WLAN) environments. It shows good performance in the handoff latency and the bandwidth efficiency aspect and guarantees QoS because it uses an advanced multicasting method and RSVP. CCRSVP uses L2 information (BSSID) of WLAN and starts reserving resources and multicasting packets before L2 handoff completes. Therefore, the proposed algorithm can reduce L3 handoff latency more than other methods. To show performance of CCRSVP algorithm, we calculate handoff latency and packet loss ratio of each algorithm. Also we model handoff process which uses RSVP mechanism to confirm resource efficiency. Proposed handoff model uses parameters which can distinguish each handoff algorithm. We introduce Markov chain which can analyze handoff model and analysis method which uses iteration method. In this article, the results show that the proposed algorithm shows superior bandwidth efficiency than existing L3 handoff algorithms using RSVP. To analyze bandwidth efficiency of each algorithm, we compare the blocking probability which occurs in case of absence of resource, resource usage which shows reservation quantity, the average number of ongoing session which really uses resource reserved and resource utilization. We can confirm that CCRSVP algorithm has better performance than other algorithms at each comparative item.

Publication: IEICE TRANSACTIONS on Communications Vol.E87-B No.9 pp.2529-2536

Publication Date: 2004/09/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Networking Technologies for Mobile Internet Systems)

Category: Mobility Management

Cite this

Copy

Il-Hee SHIN, Chae-Woo LEE, "A QoS Guaranteed Fast Handoff Algorithm for Wireless Local Area Network Environments" in IEICE TRANSACTIONS on Communications, vol. E87-B, no. 9, pp. 2529-2536, September 2004, doi: .
Abstract: Proposed CCRSVP (CandidateCasting RSVP) algorithm is a new fast handoff method for IEEE 802.11 Wireless LAN (WLAN) environments. It shows good performance in the handoff latency and the bandwidth efficiency aspect and guarantees QoS because it uses an advanced multicasting method and RSVP. CCRSVP uses L2 information (BSSID) of WLAN and starts reserving resources and multicasting packets before L2 handoff completes. Therefore, the proposed algorithm can reduce L3 handoff latency more than other methods. To show performance of CCRSVP algorithm, we calculate handoff latency and packet loss ratio of each algorithm. Also we model handoff process which uses RSVP mechanism to confirm resource efficiency. Proposed handoff model uses parameters which can distinguish each handoff algorithm. We introduce Markov chain which can analyze handoff model and analysis method which uses iteration method. In this article, the results show that the proposed algorithm shows superior bandwidth efficiency than existing L3 handoff algorithms using RSVP. To analyze bandwidth efficiency of each algorithm, we compare the blocking probability which occurs in case of absence of resource, resource usage which shows reservation quantity, the average number of ongoing session which really uses resource reserved and resource utilization. We can confirm that CCRSVP algorithm has better performance than other algorithms at each comparative item.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/e87-b_9_2529/_p

Copy

@ARTICLE{e87-b_9_2529,
author={Il-Hee SHIN, Chae-Woo LEE, },
journal={IEICE TRANSACTIONS on Communications},
title={A QoS Guaranteed Fast Handoff Algorithm for Wireless Local Area Network Environments},
year={2004},
volume={E87-B},
number={9},
pages={2529-2536},
abstract={Proposed CCRSVP (CandidateCasting RSVP) algorithm is a new fast handoff method for IEEE 802.11 Wireless LAN (WLAN) environments. It shows good performance in the handoff latency and the bandwidth efficiency aspect and guarantees QoS because it uses an advanced multicasting method and RSVP. CCRSVP uses L2 information (BSSID) of WLAN and starts reserving resources and multicasting packets before L2 handoff completes. Therefore, the proposed algorithm can reduce L3 handoff latency more than other methods. To show performance of CCRSVP algorithm, we calculate handoff latency and packet loss ratio of each algorithm. Also we model handoff process which uses RSVP mechanism to confirm resource efficiency. Proposed handoff model uses parameters which can distinguish each handoff algorithm. We introduce Markov chain which can analyze handoff model and analysis method which uses iteration method. In this article, the results show that the proposed algorithm shows superior bandwidth efficiency than existing L3 handoff algorithms using RSVP. To analyze bandwidth efficiency of each algorithm, we compare the blocking probability which occurs in case of absence of resource, resource usage which shows reservation quantity, the average number of ongoing session which really uses resource reserved and resource utilization. We can confirm that CCRSVP algorithm has better performance than other algorithms at each comparative item.},
keywords={},
doi={},
ISSN={},
month={September},}

Copy

TY - JOUR
TI - A QoS Guaranteed Fast Handoff Algorithm for Wireless Local Area Network Environments
T2 - IEICE TRANSACTIONS on Communications
SP - 2529
EP - 2536
AU - Il-Hee SHIN
AU - Chae-Woo LEE
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E87-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2004
AB - Proposed CCRSVP (CandidateCasting RSVP) algorithm is a new fast handoff method for IEEE 802.11 Wireless LAN (WLAN) environments. It shows good performance in the handoff latency and the bandwidth efficiency aspect and guarantees QoS because it uses an advanced multicasting method and RSVP. CCRSVP uses L2 information (BSSID) of WLAN and starts reserving resources and multicasting packets before L2 handoff completes. Therefore, the proposed algorithm can reduce L3 handoff latency more than other methods. To show performance of CCRSVP algorithm, we calculate handoff latency and packet loss ratio of each algorithm. Also we model handoff process which uses RSVP mechanism to confirm resource efficiency. Proposed handoff model uses parameters which can distinguish each handoff algorithm. We introduce Markov chain which can analyze handoff model and analysis method which uses iteration method. In this article, the results show that the proposed algorithm shows superior bandwidth efficiency than existing L3 handoff algorithms using RSVP. To analyze bandwidth efficiency of each algorithm, we compare the blocking probability which occurs in case of absence of resource, resource usage which shows reservation quantity, the average number of ongoing session which really uses resource reserved and resource utilization. We can confirm that CCRSVP algorithm has better performance than other algorithms at each comparative item.
ER -