A Simple Scheduling Algorithm Capable of Controlling Throughput-Fairness Tradeoff Performance

In this paper, we propose a simple scheduling algorithm that can arbitrarily control the throughput-fairness tradeoff performance in multiuser communication systems. A new scheduling criterion is introduced through a linear combining of two well-known criteria such as the instantaneous channel capacity and the average throughput, with a control factor. Changing the control factor, we can control arbitrarily the scheduling criterion so that a different throughput-fairness tradeoff performance could be achieved, thus for system needs to be dynamically adapted. With an appropriate control factor, the proposed algorithm can substitute the proportional fair (PF) scheduler in terms of the throughput-fairness tradeoff performance. We evaluate the throughput and fairness performance of the proposed algorithm according to the control factors, assuming independent Rayleigh fading multiuser channels.