Adaptive resource allocation and dynamic Call Admission Control in wireless networks

Most radio resource management algorithms engage radio resource management and Call Admission Control (CAC) separately as two different procedures. This incorporation of these two procedures into a single scheme seems challenging. In this paper a novel framework combining radio resource management and Probabilistic CAC (PCAC) is proposed. When an incoming call requests admission to the network, radio resource management reallocates the resources to ongoing users employing a bargaining game to determine the new shares of resources allocated to all users. The PCAC algorithm proposed adjusts dynamically the admission criteria according to the output of the resource allocation algorithm and the QoS requirements of ongoing calls. In this course, a demand function is employed to determine the probabilistic parameter employed by PCAC. The performance results presented verify the improvement achieved by the proposed model.