Comparison of opportunistic scheduling policies in time-slotted AMC wireless networks

We consider scheduling schemes which exploit the random variability in wireless channels to maximize wireless throughput. We survey ten of such opportunistic scheduling policies, namely, PFS, OCASD, TAOS-1, I-OCASD, CASTI, EXP, M-LWDF, FIFO, RR and MaxC/I and compare them in terms of system throughput, fairness (user isolation) and the distributions of user starvation periods (packet delays) in a time-slotted wireless network like CDMA/HDR using adaptive modulation and coding (AMC). The results aids in determining the suitability of any of the ten policies in a wireless network depending on which metric is considered critical