DocumentCode :
2773616
Title :
Analysis of handover algorithms [microcellular radio]
Author :
Gudmundson, Mikael
Author_Institution :
Radio Commun. Syst., R. Inst. of Technol., Stockholm, Sweden
fYear :
1991
fDate :
19-22 May 1991
Firstpage :
537
Lastpage :
542
Abstract :
Handover algorithms are analyzed for a simple channel model. Three performance measures are defined: the probability of lost calls, the probability of unnecessary handover, and the probability of handover. In the design of a handover algorithm, a tradeoff between these measures has to be made since they cannot be minimized simultaneously. A particular class of algorithms, linear handover algorithms, is introduced. Performance bounds are derived, and expressions for the performance measures for linear algorithms are given. In particular, a lower bound for the probability of lost calls is derived. This bound is valid as long as the signal model is correct and is not limited to the class of linear algorithms
Keywords :
cellular radio; statistical analysis; cellular radio; handover algorithm analysis; handover probability; linear handover algorithms; lost calls; microcellular radio; performance bounds; simple channel model; unnecessary handover; Algorithm design and analysis; Frequency division multiaccess; Interference; Loss measurement; Maintenance; Microcell networks; Mobile communication; Multiaccess communication; Radio communication; Switches;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Vehicular Technology Conference, 1991. Gateway to the Future Technology in Motion., 41st IEEE
Conference_Location :
St. Louis, MO
ISSN :
1090-3038
Print_ISBN :
0-87942-582-2
Type :
conf
DOI :
10.1109/VETEC.1991.140549
Filename :
140549
Link To Document :
بازگشت