Optimal scheduling of handoffs in cellular networks
M. Asawa, W.E. Stark · IEEE/ACM Transactions on Networking · 1996
The phenomenon of hard handoffs (as applicable to FDMA- and TDMA-based networks) as well as soft handoffs (as applicable to DS/CDMA-based networks) is formulated as stochastic optimization problems. The signals received by a mobile user are treated as stochastic processes with associated rewards, which are functions of some measurable characteristics of the received signals, while the handoff is associated with a switching penalty. This formulation captures the trade-offs involved in handoffs in a flexible manner and captures many facets of popular cellular communication systems in use currently. Using dynamic programming, necessary and sufficient conditions for determining the optimal base station(s) the mobile should be associated with during each decision epoch are derived. For the cases where the above-mentioned necessary and sufficient conditions fail to determine an optimal decision, "limited lookahead" arguments are used for determining handoff decisions. The decisions are taken in a decentralized manner, which makes its implementation easier compared to centralized algorithms. Simulation results show that for the hard handoffs, performance gain by the proposed algorithm over the simpler threshold algorithms proposed in the literature is small; however, for the case of soft handoffs, the proposed algorithm offers considerable improvement over the algorithm proposed in the IS-95 standard.