A Novel Proportional Fair Scheduling Algorithm for HSDPA in UMTS Networks

A utility function based perspective of packet scheduling in HSDPA is described and a new hybrid proportional fair scheduling algorithm has been developed. This algorithm employs a ratio of the instantaneous channel quality indicator to its mean value and an exponentially weighted moving average of the data rate to be transmitted at the base station (Node-B). Performance of the new algorithm has been compared with round robin, maximum carrier to interference ratio and proportional fair throughput schemes, under pedestrian A, vehicular A and vehicular B environments. The new algorithm has shown higher levels of total cell throughput than round robin and proportional fair throughput schedulers. Furthermore, it is shown that it has good fairness properties that are comparable with the round robin scheduler, and it exhibits low values of the mean end-to-end packet delay.