Cross Layer QoS Guarantees in Multiuser WLAN Systems
Wireless Personal Communications: An International Journal
Joint optimization of a dynamic queue scheduling scheme for the provision of QoS in WLAN
Proceedings of the 5th International ICST Mobile Multimedia Communications Conference
A QoS-based dynamic queue length scheduling algorithm in multiantenna heterogeneous systems
EURASIP Journal on Wireless Communications and Networking - Special issue on advances in quality and performance assessment for future wireless communication services
A performance evaluation framework for packet scheduling algorithms in wireless system
Concurrency and Computation: Practice & Experience
| Hi-index | 0.01 |
This paper is concerned with the throughput and fairness analysis in a downlink WCDMA network. The channel model is assumed to include path loss, lognormal shadowing and fast Rayleigh fading. The scheduling schemes investigated are (i) the round robin scheme, (ii) the maximum carrier-to-interference ratio (C/I) scheme, (iii) the proportional fair scheme, (iv) the maximum instantaneous signal scheme, and (v) the fading-based signal power scheme. By using an approximation of the probability density function of C/I, throughput and fairness expressions are derived, and a performance comparison among the five scheduling schemes is given. The results indicate that throughput and fairness performance of each scheduling scheme depends on mobile users' location. Tn general, the round robin scheme has the worst throughput performance as compared to the other four schemes. The proportional fair scheme and the fading-based signal power scheme can provide relatively better tradeoffs between the throughput and the fairness. The findings presented here are not only of fundamental theoretical value, but are also of practical interest to the designers of third-generation mobile communication systems based on WCDMA technology