Computationally Efficient Method to Evaluate the Performance of Guard-Channel-Based Call Admission Control in Cellular Networks

Abstract

Many guard-channel-based call admission control (CAC) schemes for cellular networks have been proposed to provide the desired quality of service to not only new calls but also ongoing calls when they hand off to neighboring cells. Blocking/dropping probabilities of new/handoff calls are generally analyzed using one-dimensional Markov chain modeling under specific assumptions to avoid solving large sets of flow equations that makes exact analyses of these schemes using multidimensional Markov chain models infeasible. This is the case with the approach, which assumes that channel holding times for new and handoff calls have equal mean values, and the approach, which relaxes this assumption but is accurate only for the new call bounding CAC scheme. In this paper, we reevaluate the analytical methods for computing new/handoff call blocking/dropping probabilities for several widely known CAC schemes and develop an easy-to-implement method under more general assumptions. Numerical results show that when the mean channel holding times for new and handoff calls are different, the proposed effective holding time approach gives more accurate results compared with the traditional and the normalized methods while keeping the computational complexity low. The accuracy of these methods and their levels of computational complexity with the exact solution are also compared