Minimum Rate Guaranteed Call Admission Control for Cumulative Rate Distribution Based Scheduling
In this paper, the authors investigate Call Admission Control (CAC) for Cumulative rate distribution based Scheduling (CS) in wireless communication networks. They first analyze the Multiuser Diversity Gain (MDG) of CS, which is applicable to general channel conditions. Then, they propose the minimum rate guaranteed CS/ORR based CAC algorithm, COCAC, which jointly uses CS and Opportunistic Round Robin (ORR) for resource prediction and CAC decision. Furthermore, they evaluate the performance of their COCAC algorithm through simulation. Results show that COCAC can significantly reduce the new call blocking rate, while strictly guarantee the minimum rate requirements of all serving users.