Minimum Rate Guaranteed Call Admission Control for Cumulative Rate Distribution Based Scheduling

In this letter, we investigate call admission control (CAC) for cumulative rate distribution based scheduling (CS) in wireless communication networks. We first analyze the multi-user diversity gain (MDG) of CS, which is applicable to general channel conditions. Then we 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, we evaluate the performance of our 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.