Throughput Maximizing Multiuser Scheduling with Adjustable Fairness

We address the problem of downlink multiuser scheduling in practical wireless networks under a desired fairness constraint. Wireless networks such as LTE, WiMAX and WiFi provide partial channel knowledge at the base station/access point by means of quantized user equipment feedback. Specifically in 3GPP's LTE, the Channel Quality Indicator (CQI) feedback provides time-frequency selective information on achievable rates. This knowledge enables the scheduler to achieve multiuser diversity gains by assigning resources to users with favourable channel conditions. However, only focusing on the possible diversity gains leads to unfair treatment of the individual users. To overcome this situation we propose a method for multiuser scheduling that operates on the boundary of the achievable multiuser rate region while guaranteeing a desired long term average fairness. Our method is based on a sum utility maximization of the alpha-fair utility functions. To obtain a given fairness, quantified with Jain's fairness index, it is necessary to find an appropriate α, which we obtain from the observed CQI probability mass function (pmf).

[1]  Markus Rupp,et al.  The Vienna LTE simulators - Enabling reproducibility in wireless communications research , 2011, EURASIP J. Adv. Signal Process..

[2]  John M. Cioffi,et al.  Optimal Resource Allocation for OFDMA Downlink Systems , 2006, 2006 IEEE International Symposium on Information Theory.

[3]  Markus Rupp,et al.  Calculation of the spatial preprocessing and link adaption feedback for 3GPP UMTS/LTE , 2010, 2010 Wireless Advanced 2010.

[4]  Changchuan Yin,et al.  Reduced-Complexity Proportional Fair Scheduling for OFDMA Systems , 2006, 2006 International Conference on Communications, Circuits and Systems.

[5]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[6]  Xin Wang,et al.  A Unified Approach to QoS-Guaranteed Scheduling for Channel-Adaptive Wireless Networks , 2007, Proceedings of the IEEE.

[7]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[8]  Ashutosh Sabharwal,et al.  An Axiomatic Theory of Fairness in Network Resource Allocation , 2009, 2010 Proceedings IEEE INFOCOM.

[9]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[10]  Markus Rupp,et al.  Low complexity approximate maximum throughput scheduling for LTE , 2010, 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers.