A new priority based dynamic handoff algorithm minimizing unnecessary handoffs in cellular systems
A. Chandra, D. Bansal, A.R. Shorey · 2003
We propose a dynamic handoff algorithm that, as compared to the static algorithm, yields a reduced number of unnecessary handoffs while maintaining the quality of service constraints in a cellular mobile system. The fraction of unnecessary handoffs in the dynamic algorithm is found to be 25% to 39% lower than that in static algorithm. The proposed scheme takes decisions regarding initiating handoffs at fixed sampling intervals depending upon the state of the system at that instance. The main idea behind our algorithm is to defer handoff initiation until the handoff failure probability at the next sampling interval exceeds the specified QoS guarantee. We give a mathematical formulation to determine the appropriate time at which a mobile should initiate a handoff.