Comparative Analysis of Packet Scheduling Schemes for HSDPA Cellular Networks.docVIP

2 Telfor Journal, Vol. 1, No. 1, 2009. Comparative Analysis of Packet Scheduling Schemes for HSDPA Cellular Networks Toni Janevski, Senior Member, IEEE, and Kire Jakimoski  users and preferably schedule transmissions to a user Abstract — In this paper we present comparison analysis when the channel conditions are advantageous. Several for packet scheduling algorithms for HSDPA (High Speed scheduling strategies are possible. However, efficient Downlink Packet Networks). In particular, we analyze the scheduling strategies require at least information about the round robin, max C/I and FCDS packet scheduling instantaneous channel conditions at the UE, and information about the buffer status and priorities of the data flows. algorithms in HSDPA by comparing the average throughput, delay and fairness of the users, changing the number of the users in pedestrian and vehicular environment. The results have showed that the number of the users in a given coverage area is very important when choosing which packet scheduling algorithm for HSDPA networks. These results The purpose of Packet Scheduling is to distribute resources among users in a fair and efficient way to maximize the system throughput. In order to achieve the will be very useful for choosing the adequate scheduling highest possible throughput, another parameter has been algorithm in HSDPA network with aim to satisfy the desired quality of service for the mobile users. added to the scheduling decision, which is the channel condition of the users, but this raises the issue of fairness. Different packet scheduling algorithms have different impacts on the performance of the system in terms of system throughput, packet delay, packet lose, fairness etc. This fact is used as a motivation in this