Heuristic RAT selection policy to minimize call blocking probability in next generation wireless networks

Abstract

In next generation wireless network (NGWN) where multiple radio access technologies (RAT) co-exist, a joint call admission control (JCAC) algorithm is needed to make a RAT selection decision for each arriving call. RAT selection policy has a significant effect on the overall new call blocking probability in the network. We propose a heuristic RAT selection policy to minimize new call blocking probability in NGWN. The proposed JCAC scheme measures the arrival rate of each class of calls in the heterogeneous wireless network. Based of the measured values of the arrival rates and using linear programming technique, the JCAC scheme determines the RAT selection policy that minimizes overall call blocking probability in the heterogeneous wireless network. Using Markov decision process, we develop an analytical model for the JCAC scheme, and derive new call blocking probability, handoff call dropping probability (HCDP), and call incompletion probability (CIP). Performance of the proposed scheme is compared with the performance of other JCAC scheme. Simulation results show that the proposed scheme reduces new call blocking probability, HCDP, and CIP in the heterogeneous wireless network. Copyright © 2009 John Wiley & Sons, Ltd. In next generation wireless network (NGWN) where multiple radio access technologies (RAT) co-exist, a joint call admission control (JCAC) algorithm is needed to make a RAT-selection decision for each arriving call. We propose a heuristic RAT selection policy to reduce call blocking probability in NGWN, and develop an analytical model to evaluate its performance. Simulation results show that the proposed scheme reduces new call blocking probability, handoff call dropping probability, and call incompletion probability in NGWN.