Study on delay of proportional fair algorithm with controlled channel quality feedback

The delay of a modified proportional fair algorithm (PFA) is computed. The modified PFA uses a dynamic threshold to filter the feedbacks of channel quality (CQ) based on which the users priorities are calculated for scheduling. Only those in good CQs (relative to their own average CQ) can be the candidates for scheduling. The results show that the modified PFA with a low CQ threshold can not only reduce some feedback overhead but also maintain delay performance of the traditional PFA. Two methods of calculating priority, one based on signal to noise ratio, and the other on information rate, are considered. Their performances of delay have slight difference when fast fading components are distributed differently among users.

[1]  P. Whiting,et al.  Downlink scheduling in CDMA data networks , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[2]  David Tse,et al.  Multiaccess Fading Channels-Part I: Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities , 1998, IEEE Trans. Inf. Theory.

[3]  Jack M. Holtzman,et al.  Asymptotic analysis of proportional fair algorithm , 2001, 12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598).

[4]  J. M. Holtzman.  CDMA forward link waterfilling power control , 2000, VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026).

[5]  C. Ko,et al.  Channel capacity in time sharing multiple-access flat fading channels employing variable rate M-QAM transmitter , 2001 .