Throughput-Efficient Scheduling and Interference Alignment for MIMO Wireless Systems

Multiple-input multiple-output (MIMO) wireless communication systems can achieve higher throughput through interference alignment. For a small number of users, determining the maximum possible degrees of freedom as well as the feasibility of interference alignment in MIMO systems is well studied. Ho...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on wireless communications Vol. 13; no. 4; pp. 1779 - 1789
Main Authors Ronasi, Keivan, Binglai Niu, Wong, Vincent W. S., Gopalakrishnan, Sathish, Schober, Robert
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.04.2014
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text
ISSN1536-1276
1558-2248
DOI10.1109/TWC.2014.031314.122040

Cover

More Information
Summary:Multiple-input multiple-output (MIMO) wireless communication systems can achieve higher throughput through interference alignment. For a small number of users, determining the maximum possible degrees of freedom as well as the feasibility of interference alignment in MIMO systems is well studied. However, the issues of scheduling in systems employing interference alignment and serving a large number of users have received little attention so far. In this paper, we study the problem of joint scheduling, interference alignment, and packet admission control in MIMO wireless systems with the goal of maximizing system throughput subject to stability constraints. We formulate a stochastic network optimization problem and propose a scheduling and interference alignment (SIA) algorithm. In each time slot, SIA schedules some users among many competing ones to transmit data, and determines encoding and decoding matrices for the selected users. Packet admission control is performed in each time slot. In addition, we propose a heuristic semi-distributed algorithm (SDSIA), which has a lower computational complexity than the SIA algorithm. Via simulation, we evaluate the performance of SIA and SDSIA for different algorithm parameters and different numbers of users. We also compare the performance of SDSIA with other approaches which do not simultaneously exploit interference alignment and scheduling and find that the combination of these two techniques increases the achievable data rate dramatically.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2014.031314.122040