Analysis of Handover Algorithms
1991 (English)In: IEEE 41st Vehicular Technology Conference, 1991. Gateway to the Future Technology in Motion, IEEE , 1991, 537-542 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
IEEE , 1991. 537-542 p.
Computer and Information Science
Research subject SRA - ICT
IdentifiersURN: urn:nbn:se:kth:diva-29394DOI: 10.1109/VETEC.1991.140549ISBN: 0-87942-582-2OAI: oai:DiVA.org:kth-29394DiVA: diva2:393989
41st Vehicular Technology Conference. St. Louis, MO , USA. 19 maj 1991 - 22 maj 1991
QC 201111082011-02-012011-02-012011-11-16Bibliographically approved