posted on 2017-12-06, 00:00authored byAmoakoh Gyasi-Agyei, SL Kim
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.
Funding
Category 1 - Australian Competitive Grants (this includes ARC, NHMRC)
History
Parent Title
International Symposium on Wireless Pervasive Computing.
Start Page
1
End Page
6
Number of Pages
6
Start Date
2006-01-01
ISBN-10
0780394100
Location
Phuket, Thailand
Publisher
Institute of Electrical and Electronics Engineers (IEEE)