A Markov model for per-user service of opportunistic scheduling

Authors:
Mehrdad Dianati;Rahim Tafazolli;Xuemin Shen;Kshirasagar Naik
Affiliations:
University of Surrey, Guildford, UK;University of Surrey, Guildford, UK;University of Waterloo, Waterloo, ON, Canada;University of Waterloo, Waterloo, ON, Canada
Venue:
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Year:
2009

Citing 4
Cited 0

Opportunistic fair scheduling for the downlink of IEEE 802.16 wireless metropolitan area networks

QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
Queuing with adaptive modulation and coding over wireless links: cross-Layer analysis and design

IEEE Transactions on Wireless Communications
Delay Statistics and Throughput Performance for Multi-rate Wireless Networks Under Multiuser Diversity

IEEE Transactions on Wireless Communications
Channel predictive proportional fair scheduling

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider maximum rate opportunistic scheduling from a single wireless base station with a single antenna to multiple mobile users, each equipped with a single antenna. We show that a finite-state Markovian model can capture the dynamics of a single user's service, namely peruser service. We consider a saturated scenario, where the base station always has buffered data for transmission.