Adaptive hard handoff algorithms

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

Abstract

The design of hard handoff algorithms based on optimizing the tradeoff between link quality and rate of handoffs is considered. For handoff algorithms based on this criterion, adaptation is precisely defined in terms of remaining on a locus of desirable operating points as system parameters (such as mobile velocity) change. A role based on a linear cost criterion is used to select desirable operating points. For this rule, it is shown that the optimal handoff algorithm, which is impractical, is easily adapted by fixing a single tradeoff parameter at an appropriate value. The same adaptation property is shown to hold for an easily implementable approximation to the optimal algorithm, the locally optimal (LO) handoff algorithm. This is in contrast to the poor adaptation of hysteresis based approaches which require complicated look-up tables for adaptation. Practical estimators for all relevant system parameters based only on a short window of pilot signal strength measurements are also discussed. It is shown that the LO algorithm adapts well when these simple estimators are used.

Original languageEnglish (US)
Title of host publicationIEEE VTS 50th Vehicular Technology Conference, VTC 1999-Fall
Pages1779-1783
Number of pages5
StatePublished - Jan 1 1999
Externally publishedYes
EventIEEE VTS 50th Vehicular Technology Conference, VTC 1999-Fall - Houston, TX, USA
Duration: Sep 19 1999Sep 22 1999

Publication series

NameIEEE VTS 50th Vehicular Technology Conference, VTC 1999-Fall
Volume3
ISSN (Print)0740-0551

Other

OtherIEEE VTS 50th Vehicular Technology Conference, VTC 1999-Fall
CityHouston, TX, USA
Period9/19/999/22/99

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Adaptive hard handoff algorithms'. Together they form a unique fingerprint.

Cite this