Minimizing recurrent handoff delays in MIPv6

May Siksik, Hussein Alnuweiri, Saif Zahir

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

During the handoff process in Mobile IP networks, the mobile node can become unreachable causing any data destined to the node to be lost. As a result, it is important to minimize the delays associated with the handoff process. Move-detection has been shown to be the bottleneck in the delays associated with the handoff process. To minimize move-detection delay, the router advertisement interval should be set as short as possible without exceeding its assigned bandwidth. This approach has been studied in previous work but only in the context of a single handoff. This paper provides an improved mobility analysis that assumes a more realistic model that incorporates the recurrent handoffs likely to occur during Eager Cell Switching. We derive a more realistic expression for the required bandwidth that accounts for the non-zero delay separating consecutive handoffs. We use our analysis to propose a new adaptive mobility paradigm capable of dynamically adjusting the advertisement interval as a function of the recurrent cell switching behavior and the available bandwidth. Our results show as much as 65% reduction in move detection delay over mobility models that consider only a single handoff.

Original languageEnglish
Title of host publication2007 Canadian Conference on Electrical and Computer Engineering, CCECD
Pages1618-1621
Number of pages4
DOIs
Publication statusPublished - 1 Dec 2007
Externally publishedYes
Event2007 Canadian Conference on Electrical and Computer Engineering, CCECD - Vancouver, BC, Canada
Duration: 22 Apr 200726 Apr 2007

Other

Other2007 Canadian Conference on Electrical and Computer Engineering, CCECD
CountryCanada
CityVancouver, BC
Period22/4/0726/4/07

Fingerprint

Bandwidth
Routers

Keywords

  • Handoff
  • Mobile IP
  • Move detection
  • Renewal theory

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Siksik, M., Alnuweiri, H., & Zahir, S. (2007). Minimizing recurrent handoff delays in MIPv6. In 2007 Canadian Conference on Electrical and Computer Engineering, CCECD (pp. 1618-1621). [4233064] https://doi.org/10.1109/CCECE.2007.405

Minimizing recurrent handoff delays in MIPv6. / Siksik, May; Alnuweiri, Hussein; Zahir, Saif.

2007 Canadian Conference on Electrical and Computer Engineering, CCECD. 2007. p. 1618-1621 4233064.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Siksik, M, Alnuweiri, H & Zahir, S 2007, Minimizing recurrent handoff delays in MIPv6. in 2007 Canadian Conference on Electrical and Computer Engineering, CCECD., 4233064, pp. 1618-1621, 2007 Canadian Conference on Electrical and Computer Engineering, CCECD, Vancouver, BC, Canada, 22/4/07. https://doi.org/10.1109/CCECE.2007.405
Siksik M, Alnuweiri H, Zahir S. Minimizing recurrent handoff delays in MIPv6. In 2007 Canadian Conference on Electrical and Computer Engineering, CCECD. 2007. p. 1618-1621. 4233064 https://doi.org/10.1109/CCECE.2007.405
Siksik, May ; Alnuweiri, Hussein ; Zahir, Saif. / Minimizing recurrent handoff delays in MIPv6. 2007 Canadian Conference on Electrical and Computer Engineering, CCECD. 2007. pp. 1618-1621
@inproceedings{be134a7d9c4e4b88bbc552dc59f4d8e2,
title = "Minimizing recurrent handoff delays in MIPv6",
abstract = "During the handoff process in Mobile IP networks, the mobile node can become unreachable causing any data destined to the node to be lost. As a result, it is important to minimize the delays associated with the handoff process. Move-detection has been shown to be the bottleneck in the delays associated with the handoff process. To minimize move-detection delay, the router advertisement interval should be set as short as possible without exceeding its assigned bandwidth. This approach has been studied in previous work but only in the context of a single handoff. This paper provides an improved mobility analysis that assumes a more realistic model that incorporates the recurrent handoffs likely to occur during Eager Cell Switching. We derive a more realistic expression for the required bandwidth that accounts for the non-zero delay separating consecutive handoffs. We use our analysis to propose a new adaptive mobility paradigm capable of dynamically adjusting the advertisement interval as a function of the recurrent cell switching behavior and the available bandwidth. Our results show as much as 65{\%} reduction in move detection delay over mobility models that consider only a single handoff.",
keywords = "Handoff, Mobile IP, Move detection, Renewal theory",
author = "May Siksik and Hussein Alnuweiri and Saif Zahir",
year = "2007",
month = "12",
day = "1",
doi = "10.1109/CCECE.2007.405",
language = "English",
isbn = "1424410215",
pages = "1618--1621",
booktitle = "2007 Canadian Conference on Electrical and Computer Engineering, CCECD",

}

TY - GEN

T1 - Minimizing recurrent handoff delays in MIPv6

AU - Siksik, May

AU - Alnuweiri, Hussein

AU - Zahir, Saif

PY - 2007/12/1

Y1 - 2007/12/1

N2 - During the handoff process in Mobile IP networks, the mobile node can become unreachable causing any data destined to the node to be lost. As a result, it is important to minimize the delays associated with the handoff process. Move-detection has been shown to be the bottleneck in the delays associated with the handoff process. To minimize move-detection delay, the router advertisement interval should be set as short as possible without exceeding its assigned bandwidth. This approach has been studied in previous work but only in the context of a single handoff. This paper provides an improved mobility analysis that assumes a more realistic model that incorporates the recurrent handoffs likely to occur during Eager Cell Switching. We derive a more realistic expression for the required bandwidth that accounts for the non-zero delay separating consecutive handoffs. We use our analysis to propose a new adaptive mobility paradigm capable of dynamically adjusting the advertisement interval as a function of the recurrent cell switching behavior and the available bandwidth. Our results show as much as 65% reduction in move detection delay over mobility models that consider only a single handoff.

AB - During the handoff process in Mobile IP networks, the mobile node can become unreachable causing any data destined to the node to be lost. As a result, it is important to minimize the delays associated with the handoff process. Move-detection has been shown to be the bottleneck in the delays associated with the handoff process. To minimize move-detection delay, the router advertisement interval should be set as short as possible without exceeding its assigned bandwidth. This approach has been studied in previous work but only in the context of a single handoff. This paper provides an improved mobility analysis that assumes a more realistic model that incorporates the recurrent handoffs likely to occur during Eager Cell Switching. We derive a more realistic expression for the required bandwidth that accounts for the non-zero delay separating consecutive handoffs. We use our analysis to propose a new adaptive mobility paradigm capable of dynamically adjusting the advertisement interval as a function of the recurrent cell switching behavior and the available bandwidth. Our results show as much as 65% reduction in move detection delay over mobility models that consider only a single handoff.

KW - Handoff

KW - Mobile IP

KW - Move detection

KW - Renewal theory

UR - http://www.scopus.com/inward/record.url?scp=48749096971&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=48749096971&partnerID=8YFLogxK

U2 - 10.1109/CCECE.2007.405

DO - 10.1109/CCECE.2007.405

M3 - Conference contribution

AN - SCOPUS:48749096971

SN - 1424410215

SN - 9781424410217

SP - 1618

EP - 1621

BT - 2007 Canadian Conference on Electrical and Computer Engineering, CCECD

ER -