Low-complexity Scheduling Algorithms for Multi-channel Downlink Wireless Networks

This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM) wireless downlink networks with n users/OFDM sub-channels. For this system, while the classical MaxWeight algorithm is known to be throughput-optimal, its buffer-overflow performance is very poor (form...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2010 Proceedings IEEE INFOCOM S. 1 - 9
Hauptverfasser: Bodas, Shreeshankar, Shakkottai, Sanjay, Lei Ying, Srikant, R
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.03.2010
Schlagworte:
Algorithm design and analysis
Analytical models
Buffer overflow
Computational complexity
Computational modeling
Downlink
OFDM
Scheduling algorithm
Throughput
Wireless networks
ISBN:1424458366, 9781424458363
ISSN:0743-166X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM) wireless downlink networks with n users/OFDM sub-channels. For this system, while the classical MaxWeight algorithm is known to be throughput-optimal, its buffer-overflow performance is very poor (formally, we show it has zero rate function in our setting). To address this, we propose a class of algorithms called iHLQF (iterated Heaviest matching with Longest Queues First) that is 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 (n 4 vs. n 2 respectively). To overcome this issue, we propose a new algorithm called SSG (Server-Side Greedy). We show 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 (n 2 ) that is comparable to the MaxWeight algorithm. Thus, it provides a nice trade-off between buffer-overflow performance and computational complexity. These results are validated by both analysis and simulations.
ISBN:1424458366
9781424458363
ISSN:0743-166X
DOI:10.1109/INFCOM.2010.5462047