Low-complexity scheduling algorithms for multichannel downlink wireless networks

Authors:
Shreeshankar Bodas;Sanjay Shakkottai;Lei Ying;R. Srikant
Affiliations:
Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA and Department of Electrical and Computer Engineering, The University of Texas at Au ...;Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA and Department of Electrical and Computer Engineering, The University of Texas at Au ...;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:
2012

Citing 11
Cited 0

Stable scheduling policies for fading wireless channels

IEEE/ACM Transactions on Networking (TON)
Logarithmic delay for N × N packet switches under the crossbar constraint

IEEE/ACM Transactions on Networking (TON)
Large Deviations of Queues Sharing a Randomly Time-Varying Server

Queueing Systems: Theory and Applications
Scheduling in multi-channel wireless networks: rate function optimality in the small-buffer regime

Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Stability and Asymptotic Optimality of Generalized MaxWeight Policies

SIAM Journal on Control and Optimization
Delay-optimal server allocation in multiqueue multiserver systems with time-varying connectivities

IEEE Transactions on Information Theory
Low-complexity scheduling algorithms for multi-channel downlink wireless networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
Optimum scheduling and memory management in input queued switches with finite buffer space

IEEE Transactions on Information Theory
A Large Deviations Analysis of Scheduling in Wireless Networks

IEEE Transactions on Information Theory
Optimal Energy and Delay Tradeoffs for Multiuser Wireless Downlinks

IEEE Transactions on Information Theory
Dynamic server allocation to parallel queues with randomly varying connectivity

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the problem of designing scheduling algorithms for multichannel (e.g., OFDM-based) wireless downlink networks, with a large number of users and proportionally large bandwidth. For this system, while the classical MaxWeight algorithm is known to be throughput-optimal, its buffer-overflow performance is very poor (formally, it is shown that it has zero rate function in our setting). To address this, a class of algorithms called iterated Heaviest matching with Longest Queues First (iHLQF) is proposed. The algorithms in this class are shown to be throughput-optimal for a general class of arrival/channel processes, and also rate-function-optimal (i.e., exponentially small buffer overflow probability) for certain arrival/ channel processes. iHLQF, however, has higher complexity than MaxWeight (n4 versus n2, respectively). To overcome this issue, a new algorithm called Server-Side Greedy (SSG) is proposed. It is shown that SSG is throughput-optimal, results in a much better per-user buffer overflow performance than the MaxWeight algorithm (positive rate function for certain arrival/ channel processes), and has a computational complexity (n2) that is comparable to the MaxWeight algorithm. Thus, it provides a nice tradeoff between buffer-overflow performance and computational complexity. These results are validated by both analysis and simulations.