By Topic

A Novel Proportional Fair Scheduling Algorithm for HSDPA in UMTS Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Haider, A. ; Massey Univ., Palmerston North ; Harris, R.

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.

Published in:

Wireless Broadband and Ultra Wideband Communications, 2007. AusWireless 2007. The 2nd International Conference on

Date of Conference:

27-30 Aug. 2007