Change search
ReferencesLink to record
Permanent link

Direct link
Analysis of Handover Algorithms
KTH, Superseded Departments, Signals, Sensors and Systems. (Radio Communication Systems)
1991 (English)In: IEEE 41st Vehicular Technology Conference, 1991. Gateway to the Future Technology in Motion, IEEE , 1991, 537-542 p.Conference paper (Refereed)
Abstract [en]

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.
National Category
Computer and Information Science
Research subject
URN: urn:nbn:se:kth:diva-29394DOI: 10.1109/VETEC.1991.140549ISBN: 0-87942-582-2OAI: diva2:393989
41st Vehicular Technology Conference. St. Louis, MO , USA. 19 maj 1991 - 22 maj 1991
QC 20111108Available from: 2011-02-01 Created: 2011-02-01 Last updated: 2011-11-16Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Gudmundson, Mikael
By organisation
Signals, Sensors and Systems
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 31 hits
ReferencesLink to record
Permanent link

Direct link