Computational complexity reduction algorithms for Markov decision process based vertical handoff in mobile networks

Vertical handoff is a major concern in the operation of mobile connections. Multiple wireless networks collate to provide smooth and quality service to the users over mobile connections. This paper formulates a Markov decision process for handoff decisions with a sample space that includes a union of parameters that are important for making a handoff decision. The major contribution of this paper is to propose three different yet closely related algorithms for reducing the computational complexity of the original problem. In particular, we propose a feature-wise assessment algorithm, a network-wise assessment algorithm, and a hybrid approach for computational complexity reduction. Discussed algorithms give pseudo-optimal solutions with a significant reduction in computational complexity. Results indicate that different complexity reduction algorithms perform best under different circumstances. This provides a guideline for the selection of complexity reduction algorithms based on real scenarios.