Locally optimal soft handoff algorithm
Rajat Prakash, V.V. Verravalli · 2002
The performance of soft handoff algorithms is studied in terms of the tradeoff between three metrics: rate of handoffs, mean active set size and link quality. A locally optimal (LO) handoff algorithm is derived as an approximation to the optimal handoff algorithm. The LO algorithm is shown to yield a significantly better tradeoff than the static threshold handoff algorithm. A simple dynamic threshold handoff algorithm is shown to be an approximation to the LO algorithm, and result in performance only slightly inferior to the LO algorithm.