A framework for optimal scheduling of handoffs in wireless networks

The phenomenon of handoffs in cellular networks is formulated as an optimization problem. The signal received by a mobile user is treated as a stochastic process with an associated reward that is a function of some measurable characteristics of the received signal while the handoff is associated with a switching penalty. Using dynamic programming, properties of optimal policies for hard as well as soft handoff problems are derived. Using these properties, an optimal policy is obtained, which determines the optimal base station the mobile should be associated with during each time slot. Simulation results are also included that compare the optimal policy with the commonly used threshold policy