Throughput-optimal opportunistic scheduling in the presence of flow-level dynamics

Authors:
Shihuan Liu;Lei Ying;R. Srikant
Affiliations:
Department of Electrical and Computer Engineering, Iowa State University, Ames, IA;Department of Electrical and Computer Engineering, Iowa State University, Ames, IA;Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2011

Citing 9
Cited 2

SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES

Probability in the Engineering and Informational Sciences
Stable scheduling policies for fading wireless channels

IEEE/ACM Transactions on Networking (TON)
Resource Allocation and Cross Layer Control in Wireless Networks (Foundations and Trends in Networking, V. 1, No. 1)

Resource Allocation and Cross Layer Control in Wireless Networks (Foundations and Trends in Networking, V. 1, No. 1)
Markov Chains and Stochastic Stability

Markov Chains and Stochastic Stability
Throughput optimality of delay-driven maxweight scheduler for a wireless system with flow dynamics

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Opportunistic beamforming using dumb antennas

IEEE Transactions on Information Theory
Opportunistic transmission scheduling with resource-sharing constraints in wireless networks

IEEE Journal on Selected Areas in Communications
Dynamic power allocation and routing for time-varying wireless networks

IEEE Journal on Selected Areas in Communications
A tutorial on cross-layer optimization in wireless networks

IEEE Journal on Selected Areas in Communications

Value of information in optimal flow-level scheduling of users with Markovian time-varying channels

Performance Evaluation
Inefficiency of MaxWeight scheduling in spatial wireless networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider multiuser scheduling in wireless networks with channel variations and flow-level dynamics. Recently, it has been shown that the MaxWeight algorithm, which is throughput-optimal in networks with a fixed number of users, fails to achieve the maximum throughput in the presence of flow-level dynamics. In this paper, we propose a new algorithm, calledWorkload-based Scheduling with Learning, which is provably throughput-optimal, requires no prior knowledge of channels and user demands, and performs significantly better than previously suggested algorithms.