Throughput performance of quantized proportional fair scheduling with adaptive modulation and coding

Abstract

Assuming a logarithmic rate model for SISO (Single-Input Single-Output) systems, the information theoretic capacity under scheduling algorithms exploiting multiuser diversity in wireless networks has been studied so far. However, in many cases, the throughput achieved in real wireless networks is very different from (and is much less than) the information theoretic capacity obtained under the assumption of the logarithmic rate model, and the rate functions in real wireless networks are very different from the logarithmic rate model. Hence, to examine the usefulness of the scheduling algorithms exploiting multiuser diversity in real wireless networks, we should study the throughput performance under more realistic rate function model rather than the information theoretic capacity under the logarithmic rate model. In this paper, we consider a wireless network where QPF (Quantized Proportional Fair) scheduling and AMC (adaptive modulation and coding) scheme are employed. Assuming a realistic rate function of AMC, we then analyze the throughput performance under the QPF scheduling with the AMC scheme. We also provide numerical results to investigate the usefulness of the QPF scheduling with the AMC scheme.