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

Author

Wang, Hao ; Ding, Lianghui ; Liu, Nan ; Pan, Zhiwen ; Wu, Ping ; You, Xiaohu

Author_Institution

Nat. Mobile Commun. Res. Lab., Southeast Univ., Nanjing, China

Volume

15

Issue

11

fYear

2011

fDate

11/1/2011 12:00:00 AM

Firstpage

1181

Lastpage

1183

Abstract

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.

Keywords

radio networks; scheduling; telecommunication congestion control; wireless channels; COCAC algorithm; MDG; ORR; cumulative rate distribution based scheduling; general channel conditions; minimum rate guaranteed CS-ORR based CAC algorithm; minimum rate guaranteed call admission control; multiuser diversity gain; opportunistic round robin; resource prediction; wireless communication networks; Call admission control; Prediction algorithms; Quality of service; Resource management; Round robin; Throughput; Wireless communication; Call admission control (CAC); cumulative rate distribution based scheduling (CS); multi-user diversity gain (MDG); opportunistic round robin (ORR);

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/LCOMM.2011.082911.111134

Filename

6012537