cqu_502+DS3+DS3.2.pdf (362.46 kB)
Download file

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

Download (362.46 kB)
conference contribution
posted on 06.12.2017, 00:00 authored by Amoakoh Gyasi-AgyeiAmoakoh 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

01/01/2006

ISBN-10

0780394100

Location

Phuket, Thailand

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Place of Publication

Piscataway, New Jersey

Peer Reviewed

Yes

Open Access

No

External Author Affiliations

Faculty of Sciences, Engineering and Health; TBA Research Institute; Yŏnse Taehakkyo;

Era Eligible

Yes

Name of Conference

International Symposium on Wireless Pervasive Computing