Combined QoS Scheduling and Call Admission Control Algorithm in Cellular Networks

In this paper, a scheduling problem in wireless networks is considered when there simultaneously exist CBR (constant bit rate) users requiring exact minimum average throughput guarantee and EMG (elastic with minimum guarantee) users requiring minimum average throughput guarantee and more if possible. By exploiting utility maximization problem without minimum throughput constraint and newly defined utility functions, we propose a combined scheduling and call admission control scheme that exactly guarantees the minimum requirements of CBR and EMG users and then allocates the leftover capacity to EMG users. In the proposed scheme, it is easy to give priority to particular users so that they are guaranteed their requirements prior to any other user. Moreover, the priority structure enables the proposed measurement-based call admission control algorithm to perform admission trial without affecting the minimum performance of existing users. We show through mathematical analysis and simulations that our scheme works as designed.