Queue-Aware Opportunistic Interference Alignment in Downlink MU-MIMO Cellular Systems

A. M. Benaya, Maha Elsabrouty, Osamu Muta

Research output: Contribution to journalArticle

Abstract

Recently, attention has been paid to the integration of opportunistic communications, whether based on opportunistic user selection (OUS) or opportunistic antenna selection, with interference alignment (IA) in order to improve the performance of wireless networks. In OUS, users that have the best operational conditions are usually selected. However, fairness among users is another important aspect that should be considered in scheduling users. In this paper, a queue-aware two-stage opportunistic IA (OIA) algorithm is proposed for the downlink multicell multiuser multiple-input-multiple-output system. In the first stage, inter-cell interference is eliminated using one pair of precoding/postcoding matrices. Whereas in the second stage, two user selection polices are proposed namely, capacity-based selection (CBS) and queue-based scheduling (QBS), to select a group of users and minimize the inter-user interference among them using another pair of precoding/postcoding matrices. In the QBS-OIA case, a joint scheduling, resource allocation, and IA optimization problems are formulated, and a low complexity heuristic is proposed to solve it. Comparisons are conducted with other OIA algorithms in terms of achieved sum rate, achieved degrees-of-freedom (DoFs), number of served users, queue overflow probability, and computational complexity. Simulations show that the two proposed CBS-OIA and QBS-OIA algorithms outperform other schemes in terms of sum rate and DoFs. Moreover, the proposed QBS-OIA is capable of serving more users, in some cases, and achieves lower overflow probability with much reduced complexity on the expense of achieving a bit lower sum rate than the CBS-OIA in some cases.

Original languageEnglish
Article number8458427
Pages (from-to)50860-50874
Number of pages15
JournalIEEE Access
Volume6
DOIs
Publication statusPublished - Sep 8 2018

Fingerprint

MIMO systems
Scheduling
Law enforcement
Resource allocation
Computational complexity
Wireless networks
Antennas
Communication

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Materials Science(all)
  • Engineering(all)

Cite this

Queue-Aware Opportunistic Interference Alignment in Downlink MU-MIMO Cellular Systems. / Benaya, A. M.; Elsabrouty, Maha; Muta, Osamu.

In: IEEE Access, Vol. 6, 8458427, 08.09.2018, p. 50860-50874.

Research output: Contribution to journalArticle

Benaya, A. M. ; Elsabrouty, Maha ; Muta, Osamu. / Queue-Aware Opportunistic Interference Alignment in Downlink MU-MIMO Cellular Systems. In: IEEE Access. 2018 ; Vol. 6. pp. 50860-50874.
@article{86a7f8a1bc234d0b95ed4944b1d861fc,
title = "Queue-Aware Opportunistic Interference Alignment in Downlink MU-MIMO Cellular Systems",
abstract = "Recently, attention has been paid to the integration of opportunistic communications, whether based on opportunistic user selection (OUS) or opportunistic antenna selection, with interference alignment (IA) in order to improve the performance of wireless networks. In OUS, users that have the best operational conditions are usually selected. However, fairness among users is another important aspect that should be considered in scheduling users. In this paper, a queue-aware two-stage opportunistic IA (OIA) algorithm is proposed for the downlink multicell multiuser multiple-input-multiple-output system. In the first stage, inter-cell interference is eliminated using one pair of precoding/postcoding matrices. Whereas in the second stage, two user selection polices are proposed namely, capacity-based selection (CBS) and queue-based scheduling (QBS), to select a group of users and minimize the inter-user interference among them using another pair of precoding/postcoding matrices. In the QBS-OIA case, a joint scheduling, resource allocation, and IA optimization problems are formulated, and a low complexity heuristic is proposed to solve it. Comparisons are conducted with other OIA algorithms in terms of achieved sum rate, achieved degrees-of-freedom (DoFs), number of served users, queue overflow probability, and computational complexity. Simulations show that the two proposed CBS-OIA and QBS-OIA algorithms outperform other schemes in terms of sum rate and DoFs. Moreover, the proposed QBS-OIA is capable of serving more users, in some cases, and achieves lower overflow probability with much reduced complexity on the expense of achieving a bit lower sum rate than the CBS-OIA in some cases.",
author = "Benaya, {A. M.} and Maha Elsabrouty and Osamu Muta",
year = "2018",
month = "9",
day = "8",
doi = "10.1109/ACCESS.2018.2869693",
language = "English",
volume = "6",
pages = "50860--50874",
journal = "IEEE Access",
issn = "2169-3536",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Queue-Aware Opportunistic Interference Alignment in Downlink MU-MIMO Cellular Systems

AU - Benaya, A. M.

AU - Elsabrouty, Maha

AU - Muta, Osamu

PY - 2018/9/8

Y1 - 2018/9/8

N2 - Recently, attention has been paid to the integration of opportunistic communications, whether based on opportunistic user selection (OUS) or opportunistic antenna selection, with interference alignment (IA) in order to improve the performance of wireless networks. In OUS, users that have the best operational conditions are usually selected. However, fairness among users is another important aspect that should be considered in scheduling users. In this paper, a queue-aware two-stage opportunistic IA (OIA) algorithm is proposed for the downlink multicell multiuser multiple-input-multiple-output system. In the first stage, inter-cell interference is eliminated using one pair of precoding/postcoding matrices. Whereas in the second stage, two user selection polices are proposed namely, capacity-based selection (CBS) and queue-based scheduling (QBS), to select a group of users and minimize the inter-user interference among them using another pair of precoding/postcoding matrices. In the QBS-OIA case, a joint scheduling, resource allocation, and IA optimization problems are formulated, and a low complexity heuristic is proposed to solve it. Comparisons are conducted with other OIA algorithms in terms of achieved sum rate, achieved degrees-of-freedom (DoFs), number of served users, queue overflow probability, and computational complexity. Simulations show that the two proposed CBS-OIA and QBS-OIA algorithms outperform other schemes in terms of sum rate and DoFs. Moreover, the proposed QBS-OIA is capable of serving more users, in some cases, and achieves lower overflow probability with much reduced complexity on the expense of achieving a bit lower sum rate than the CBS-OIA in some cases.

AB - Recently, attention has been paid to the integration of opportunistic communications, whether based on opportunistic user selection (OUS) or opportunistic antenna selection, with interference alignment (IA) in order to improve the performance of wireless networks. In OUS, users that have the best operational conditions are usually selected. However, fairness among users is another important aspect that should be considered in scheduling users. In this paper, a queue-aware two-stage opportunistic IA (OIA) algorithm is proposed for the downlink multicell multiuser multiple-input-multiple-output system. In the first stage, inter-cell interference is eliminated using one pair of precoding/postcoding matrices. Whereas in the second stage, two user selection polices are proposed namely, capacity-based selection (CBS) and queue-based scheduling (QBS), to select a group of users and minimize the inter-user interference among them using another pair of precoding/postcoding matrices. In the QBS-OIA case, a joint scheduling, resource allocation, and IA optimization problems are formulated, and a low complexity heuristic is proposed to solve it. Comparisons are conducted with other OIA algorithms in terms of achieved sum rate, achieved degrees-of-freedom (DoFs), number of served users, queue overflow probability, and computational complexity. Simulations show that the two proposed CBS-OIA and QBS-OIA algorithms outperform other schemes in terms of sum rate and DoFs. Moreover, the proposed QBS-OIA is capable of serving more users, in some cases, and achieves lower overflow probability with much reduced complexity on the expense of achieving a bit lower sum rate than the CBS-OIA in some cases.

UR - http://www.scopus.com/inward/record.url?scp=85053156791&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85053156791&partnerID=8YFLogxK

U2 - 10.1109/ACCESS.2018.2869693

DO - 10.1109/ACCESS.2018.2869693

M3 - Article

AN - SCOPUS:85053156791

VL - 6

SP - 50860

EP - 50874

JO - IEEE Access

JF - IEEE Access

SN - 2169-3536

M1 - 8458427

ER -