Locally optimal handoff algorithm

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

Abstract

The design of handoff algorithms for cellular communication systems based on mobile signal strength measurements is considered. The design problem is posed as an optimization to obtain the best tradeoff between expected number of service failures and expected number of handoffs, where a service failure is defined to be the event that the signal strength falls below a level required for satisfactory service to the subscriber. Based on dynamic programming arguments, an optimal solution is obtained which, though impractical, can be used as a benchmark in the comparison of suboptimal schemes. A simple, locally optimal handoff algorithm is derived from the optimal solution. Simulation results show that the locally optimal algorithm outperforms the hysteresis algorithm and is competitive with a hysteresis-threshold algorithm recently proposed by Zhang and Holtzman. A straightforward technique for adapting the locally optimal algorithm to changing environments is suggested.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC
Editors Anon
PublisherIEEE
Pages809-813
Number of pages5
Volume2
StatePublished - 1995
Externally publishedYes
EventProceedings of the 1995 6th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'95. Part 3 (of 3) - Toronto, Can
Duration: Sep 27 1995Sep 29 1995

Other

OtherProceedings of the 1995 6th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'95. Part 3 (of 3)
CityToronto, Can
Period9/27/959/29/95

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint

Dive into the research topics of 'Locally optimal handoff algorithm'. Together they form a unique fingerprint.

Cite this