Change search
ReferencesLink to record
Permanent link

Direct link
Throughput versus Fairness: Channel-Aware Scheduling in Multiple Antenna Downlink
Dresden University of Technology (TUD), Germany.
Information Systems Laboratory, Stanford University, USA.
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Signal Processing.
2009 (English)In: EURASIP Journal on Wireless Communications and Networking, ISSN 1687-1472, E-ISSN 1687-1499, 271540- p.Article in journal (Refereed) Published
Abstract [en]

Channel aware and opportunistic scheduling algorithms exploit the channel knowledge and fading to increase the average throughput. Alternatively, each user could be served equally in order to maximize fairness. Obviously, there is a tradeoff between average throughput and fairness in the system. In this paper, we study four representative schedulers, namely the maximum throughput scheduler (MTS), the proportional fair scheduler (PFS), the (relative) opportunistic round robin scheduler (ORS), and the round robin scheduler (RRS) for a space-time coded multiple antenna downlink system. The system applies TDMA based scheduling and exploits the multiple antennas in terms of spatial diversity. We show that the average sum rate performance and the average worst-case delay depend strongly on the user distribution within the cell. MTS gains from asymmetrical distributed users whereas the other three schedulers suffer. On the other hand, the average fairness of MTS and PFS decreases with asymmetrical user distribution. The key contribution of this paper is to put these tradeoffs and observations on a solid theoretical basis. Both the PFS and the ORS provide a reasonable performance in terms of throughput and fairness. However, PFS outperforms ORS for symmetrical user distributions, whereas ORS outperforms PFS for asymmetrical user distribution.

Place, publisher, year, edition, pages
2009. 271540- p.
Keyword [en]
opportunistic scheduling algorithms, Channel aware algorithms, throughput, fairness
National Category
URN: urn:nbn:se:kth:diva-32491DOI: 10.1155/2009/271540ISI: 000264962700001ScopusID: 2-s2.0-63749112273OAI: diva2:410852
QC 20110415Available from: 2011-04-15 Created: 2011-04-15 Last updated: 2012-05-23Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Jorswieck, Eduard A.Zhang, Xi
By organisation
ACCESS Linnaeus CentreSignal Processing
In the same journal
EURASIP Journal on Wireless Communications and Networking

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 24 hits
ReferencesLink to record
Permanent link

Direct link