Title: Robust scheduling algorithm for guaranteed bit rate services

Authors: Huda Adibah Mohd Ramli; Kumbesan Sandrasegaran

Addresses: Faculty of Engineering, Department of Electrical and Computer Engineering, International Islamic University Malaysia (IIUM), P.O. Box 10, 50728 Kuala Lumpur, Malaysia. ' Faculty of Engineering and Information Technology, University of Technology, Sydney, 15 Broadway, Ultimo, NSW 2007, Australia

Abstract: This paper proposes a novel packet scheduling algorithm to overcome detrimental effects of channel impairments on the quality of service of delay-sensitive Guaranteed Bit Rate (GBR) services. The proposed algorithm prioritises the packets that require retransmission of Hybrid Automatic Repeat Request (HARQ) users compared to the packets of new users. The packets of new users are scheduled according to the Channel Quality Information (CQI), average throughput and packet delay information. Computer simulations have demonstrated that the proposed algorithm has 22.7% system capacity improvement over a well-known algorithm. It also tolerates for up to 200% delay of CQI and reduces the uplink signalling overhead by 150% compared to the well-known algorithm without compromising the quality of service requirements of the GBR services.

Keywords: mobile communications; LTE; long-term evolution; OFDMA; orthogonal frequency division multiple access; CQI; channel quality information; QoS; quality of service; HARQ; hybrid automatic repeat request; packet scheduling; multimedia; channel impairment; GBR; guaranteed bit rate.

DOI: 10.1504/IJMC.2013.050996

International Journal of Mobile Communications, 2013 Vol.11 No.1, pp.71 - 88

Published online: 17 Feb 2013 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article