By Topic

Effect of Node-B scheduling algorithms on High Speed uplink Packet Access with E-TFC selection

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 $31
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

4 Author(s)
Chen Tao ; Nokia Research Center, China ; Lin Huibin ; Ding Haiyu ; Jiang Haitao

In this paper, the effect of Node-B scheduling algorithms on High Speed uplink Packet Access (HSUPA) with E-TFC selection is evaluated. Node-B scheduling as the key technique of HSUPA is important for the performance. The scheduling algorithms, Proportional-Fair (PF) and Round-Robin (RR), as the key components of Node-B scheduling are presented and studied in the case of HSUPA here. With the modeling and system simulations, the difference between PF and RR in HSUPA is discussed by the way of qualitative and quantitative analysis. PF can offer a little bit higher cell throughput compared to RR in the case of heavy load. Generally speaking, the difference between scheduling algorithms is marginal due to some other factors, e.g. UE category, channel conditions, maximum re-transmission number, the load target setting, etc. The scheduling algorithm as the part of Node-B scheduling, which is coupled with the E-TFC selection process, is not the only factor affecting the performance of HSUPA.

Published in:

Wireless, Mobile and Multimedia Networks, 2006 IET International Conference on

Date of Conference:

6-9 Nov. 2006