Network-Level Simulation Results of Fair Channel-Dependent Scheduling in Enhanced UMTS

2004 
In this paper, previously performed UMTS studies have been extended to enhanced UMTS, and combined with several scheduling algorithms (ref. [1,2]). Scheduling algorithms for W-CDMA systems ranging from C/I based scheduling to Round-Robin scheduling are presented and discussed. We also include a trade-off between these two extreme methods of scheduling: Fair channel-dependent scheduling. All these scheduling algorithms have been implemented in a network simulator in ns-2, employing input trace files of SNRs, modeled from link-level simulation results. The network-level simulation results indeed display that the advantages of both extremes in scheduling algorithms have been combined in the new algorithm: a good fairness, comparable to that of Round-Robin scheduling, together with an efficient use of resources, as seen in C/I based scheduling.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    5
    References
    8
    Citations
    NaN
    KQI
    []