Please use this identifier to cite or link to this item:
|Title:||Analysis of throughput and fairness with downlink scheduling in WCDMA networks||Authors:||Fu, H.
|Issue Date:||Aug-2006||Citation:||Fu, H., Kim, D.I. (2006-08). Analysis of throughput and fairness with downlink scheduling in WCDMA networks. IEEE Transactions on Wireless Communications 5 (8) : 2164-2173. ScholarBank@NUS Repository. https://doi.org/10.1109/TWC.2006.1687732||Abstract:||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. In 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. © 2006 IEEE.||Source Title:||IEEE Transactions on Wireless Communications||URI:||http://scholarbank.nus.edu.sg/handle/10635/55099||ISSN:||15361276||DOI:||10.1109/TWC.2006.1687732|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 22, 2021
WEB OF SCIENCETM
checked on Jan 14, 2021
checked on Jan 19, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.