TY - GEN
T1 - Comparison of opportunistic scheduling policies in time-slotted AMC wireless networks
AU - Gyasi-Agyei, Amoakoh
AU - Kim, Seong Lyun
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=33750399452&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33750399452&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:33750399452
SN - 0780394100
SN - 9780780394100
T3 - 2006 1st International Symposium on Wireless Pervasive Computing
SP - 1
EP - 6
BT - 2006 1st International Symposium on Wireless Pervasive Computing
T2 - 2006 1st International Symposium on Wireless Pervasive Computing
Y2 - 16 January 2006 through 18 January 2006
ER -
