In this study a scheduling algorithm for CDMA systems is presented which is a trade-off between two extreme ways of scheduling: C/I based and Round-Robin scheduling. The simulation results indeed display that the advantages of both these extremes have been combined in the new algorithm: a good fairness, comparable to that of the Round-Robin scheduling, together with almost the same power gain as reached in the C/I based scheduling.
|Title of host publication||Proceedings IST Mobile & Wireless Communications Summit 2003|
|Place of Publication||Aveiro|
|Number of pages||5|
|Publication status||Published - 2003|