Fair and Efficient Channel Dependent Scheduling Algorithm for HSDPA System

In this paper, we propose a novel medium access control packet scheduler algorithm for high speed downlink packet access (HSDPA) to provide a priority scheduling between users based on their instantaneous channel conditions and their average throughputs. Simulation results show that the proposed algorithm outperforms the maximum CIR and proportional fair schemes in terms of providing minimum throughput guarantees and therefore, It has a better degree of fairness

[1]  Sem C. Borst.  User-level performance of channel-aware scheduling algorithms in wireless data networks , 2005, IEEE/ACM Transactions on Networking.

[2]  Niclas Wiberg,et al.  Scheduling algorithms for HS-DSCH in a WCDMA mixed traffic scenario , 2003, 14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003..

[3]  Hossam S. Hassanein,et al.  A performance comparison of class-based scheduling algorithms in future UMTS access , 2005, PCCC 2005. 24th IEEE International Performance, Computing, and Communications Conference, 2005..

[4]  A. Jalali,et al.  Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system , 2000, VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026).

[5]  Mamoru Sawahashi,et al.  Comparison of packet scheduling algorithms focusing on user throughput in high speed downlink packet access , 2002, The 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications.