Locally optimal soft handoff algorithm

Author

Prakash, Rajat ; Verravalli, V.V.

Author_Institution

Dept. of Electr. Eng., Cornell Univ., Ithaca, NY, USA

Volume

2

fYear

2000

fDate

2000

Firstpage

1450

Abstract

The performance of soft handoff algorithms is studied in terms of the tradeoff between three metrics: rate of handoffs, mean active set size and link quality. A locally optimal (LO) handoff algorithm is derived as an approximation to the optimal handoff algorithm. The LO algorithm is shown to yield a significantly better tradeoff than the static threshold handoff algorithm. A simple dynamic threshold handoff algorithm is shown to be an approximation to the LO algorithm, and result in performance only slightly inferior to the LO algorithm

Keywords

approximation theory; cellular radio; optimisation; radio links; cellular communications system; dynamic threshold handoff algorithm; handoff rate; link quality; locally optimal soft handoff algorithm; mean active set size; mobile position; multiple base stations; optimal handoff algorithm approximation; soft handoff algorithms performance; static threshold handoff algorithm; system traffic load conditions; Algorithm design and analysis; Approximation algorithms; Base stations; Fading; Heuristic algorithms; Interference; Multiaccess communication; Noise level; Telecommunication traffic; Time measurement;

fLanguage

English

Publisher

ieee

Conference_Titel

Vehicular Technology Conference Proceedings, 2000. VTC 2000-Spring Tokyo. 2000 IEEE 51st

Conference_Location

Tokyo

ISSN

1090-3038

Print_ISBN

0-7803-5718-3

Type

conf

DOI

10.1109/VETECS.2000.851366

Filename

851366