Cooperative proportional fairness scheduling for wireless transmissions

ABSTRACT

Nowadays efficient scheduling with high fairness has attracted much attention in wireless cellular systems. In this paper we consider the downlink transmission for multiple-base-station scenario, where the proportional fairness of multiple users is taken into account. Compared with previous works in the literature, the main contributions of this paper are three-fold: (1) The proportional fairness rule is firstly employed in the multiple-base-station cooperation case. Here we propose a cooperative proportional scheduling (CPF) scheme which maximizes the sum-log utility function using gradient descent rule. (2) We show that when adopting CPF scheduling, the limiting behavior of the throughput converges to an ordinary differential equation (ODE). The limit of each scheduler-user pair's throughput is obtained by solving a fixed-point problem. (3) We propose a distributed implementation of CPF. In the developed distributed mode, the base stations are allowed to exchange their messages of local throughput in a completely distributed and asynchronous way, which makes it realizable in practice.

REFERENCES

• 1: A. Jalali, R. Padovani, and R. Pankaj. Data throughput of cdma-hdr a high efficiency-high data rate personal communication wireless systemreasoning about naming systems. Proc. Veh. Technol. (VTC), 2000.
• 2: F. P. Kelly. Charging and rate control for elastic traffic. Euro. Trans. Telecommun., 8:7--20, 1997.
• 3: P. Viswanath, D. N. C. Tse, and R. Laroia. Opportunistic beamforming using dumb antennas. IEEE Trans. Inf. Theory., 48(6):1277--1294, 2002.
• 4: G. Caire, R. Muller, and R. Knopp. Hard fairness versus proportional fairness in wireless communications: The single-cell case. IEEE Trans. Inf. Theory., 53(4):1366--1385, April 2007.
• 5: H. Kim, K. Kim, Y. Han, and S. Yun. A proportional fair scheduling for multicarrier transmission systems. roc. Veh. Technol. (VTC), 2004.
• 6: Y. J. Zhang and S. C. Liew. Proportional fairness in multi-channel multi-rate wireless networks--part i: The case of deterministic channels with application to ap association problem in large-scale wlan. IEEE Trans. Wireless Commun., 7(9):3446--3456, September 2008.
• 7: Y. J. Zhang and S. C. Liew. Proportional fairness in multi-channel multi-rate wireless networks--part ii: The case of time-varying channels with application to ofdm systems. IEEE Trans. Wireless Commun., 7(9):3457--3467, September 2008.
• 8: Dimitri P. Bertsekas , John N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Athena Scientific, 1997
• 9: H. J. Kushner and G. Yin. Stochastic Approximation Algorithms and Applications. Springer-Verlag, Berlin, Germany, 2003.
• 10: Harold J. Kushner and Philip A. Whiting. Convergence of proportional-fair sharing algorithms under general conditions. IEEE Trans. Commun., 3(4):1250--1259, July 2004.
• 11: R. Jain. The art of computer systems performance analysis: techniques for experimental design, measurement, simulation and modeling. Wiley, New York, 1991.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS

General Terms:
Algorithms

Keywords:
proportional fairness, scheduling