Adaptive handoff algorithms using absolute and relative thresholds for cellular mobile communication systems

Gamini Senarath*, Adnan Abu-Dayya, Robert Matyas

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

9 Citations (Scopus)

Abstract

In cellular mobile networks, efficient handoff performance entails minimizing unnecessary handoffs without risking desired handoffs which could lead to increased dropped calls. An adaptive relative-threshold (hysteresis) algorithm has been proposed in [1] to effectively identify and prevent unnecessary handoffs. However, results here show that this adaptive algorithm can cause undesired cell-dragging. We propose an adaptive, absolute-threshold algorithm to be used in combination with the adaptive relative-threshold algorithm to mitigate cell dragging. The performance of the algorithm is investigated for an IS-136 TDMA system using a powerful network level simulator. Results show that, depending on the propagation environment, the proposed algorithm can reduce received signal strength (RSS) based handoff triggers by up to 75% while maintaining a lower call drop-rate and less cell dragging than fixed threshold algorithms.

Original languageEnglish
Pages (from-to)1603-1607
Number of pages5
JournalIEEE Vehicular Technology Conference
Volume2
Publication statusPublished - May 1998
Externally publishedYes
EventProceedings of the 1998 48th IEEE Vehicular Technology Conference, VTC'98. Part 2 (of 3) - Ottawa, Can
Duration: 18 May 199821 May 1998

Fingerprint

Dive into the research topics of 'Adaptive handoff algorithms using absolute and relative thresholds for cellular mobile communication systems'. Together they form a unique fingerprint.

Cite this