Performance of Scheduling Algorithms in High Speed Downlink Packet Access

J.U. John and S. Pillay (Malaysia)


UMTS, HSDPA, WCDMA, scheduling, algorithms, MATLAB


This paper presents a performance review on three basic scheduling algorithms employed for the High Speed Downlink Packet Access (HSDPA) in the Universal Mobile Telecommunication Systems (UMTS) networks. These algorithms are employed at the Node B - also known as the base station - to schedule the time-slots and orthogonal codes for the transmission of data packets to the users. The basic algorithms studied in this simulation are the Round Robin (RR), Maximum Carrier-to Interference ratio (M-CI) and the Proportional Fairness (PF). The algorithms are compared and analysed in terms of cell throughput, user bit rates, and resource distribution fairness. M-CI provided the highest cell throughput and user bit rate with over 41% more throughput than the RR. RR on the other hand showed a very fair resource distribution. The PF algorithm was a trade-off between the M-CI and RR, and provided 14% more cell throughput than the RR and significantly better resource distribution than the M-CI.

Important Links:

Go Back