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

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.