Matrix analysis
Data communications, computer networks and open systems (4th ed.)
Data communications, computer networks and open systems (4th ed.)
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Fundamentals of wireless communication
Fundamentals of wireless communication
Majorization and matrix-monotone functions in wireless communications
Foundations and Trends in Communications and Information Theory
Guaranteed performance region in fading orthogonal space-time coded broadcast channels
EURASIP Journal on Wireless Communications and Networking - Theory and Applications in Multiuser/Multiterminal Communications
Resource Allocation for Wireless Networks: Basics, Techniques, and Applications
Resource Allocation for Wireless Networks: Basics, Techniques, and Applications
IEEE Transactions on Signal Processing
ORCA-MRT: an optimization-based approach for fair scheduling in multirate TDMA wireless networks
IEEE Transactions on Wireless Communications
Delay Considerations for Opportunistic Scheduling in Broadcast Fading Channels
IEEE Transactions on Wireless Communications
Delay-limited capacity: multiple antennas, moment constraints, and fading statistics
IEEE Transactions on Wireless Communications
Throughput guarantees for wireless networks with opportunistic scheduling: a comparative study
IEEE Transactions on Wireless Communications
Performance of TDMA and SDMA based Opportunistic Beamforming
IEEE Transactions on Wireless Communications - Part 1
Space-time block codes from orthogonal designs
IEEE Transactions on Information Theory
Orthogonal designs with maximal rates
IEEE Transactions on Information Theory
High-SNR power offset in multiantenna communication
IEEE Transactions on Information Theory
A simple transmit diversity technique for wireless communications
IEEE Journal on Selected Areas in Communications
On the delay-energy tradeoff in multiuser fading channels
EURASIP Journal on Wireless Communications and Networking
Hi-index | 0.00 |
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.