Please use this identifier to cite or link to this item: https://doi.org/10.1109/ISSSTA.2006.311766
Title: Analysis of throughput and fairness of WCDMA networks with downlink scheduling
Authors: Fu, H. 
Kim, D.I.
Issue Date: 2006
Source: Fu, H., Kim, D.I. (2006). Analysis of throughput and fairness of WCDMA networks with downlink scheduling. IEEE International Symposium on Spread Spectrum Techniques and Applications : 218-222. ScholarBank@NUS Repository. https://doi.org/10.1109/ISSSTA.2006.311766
Abstract: In this paper we develop a theoretical framework which enables us to analyze the throughput and fairness performance of various downlink scheduling schemes in WCDMA networks. For theoretical analysis, the following scheduling schemes are considered: (1) the Round Robin scheme, (ii) the maximum carrier-to-interference ratio (C/I) scheme and (iii) the proportional fair scheme. By deriving a close approximation to the probability density function of C/I, new, exact throughput and fairness expressions are formulated for the above scheduling schemes, by which a rigorous quantitative comparison among them can be performed. The results verify that throughput and fairness performance of each scheduling scheme depends largely on mobile users' location in the active cell. In general, the Round Robin scheme has the worst throughput performance among them, while the proportional fair scheme provides a better trade-off between throughput and fairness. © 2006 IEEE.
Source Title: IEEE International Symposium on Spread Spectrum Techniques and Applications
URI: http://scholarbank.nus.edu.sg/handle/10635/69409
ISBN: 0780397800
DOI: 10.1109/ISSSTA.2006.311766
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

24
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.