Matching-Based Resource Allocation for Critical MTC in Massive MIMO LTE Networks

Funding Number

2014-03638

Author's Department

Electronics & Communications Engineering Department

Find in your Library

https://ieeexplore.ieee.org/document/8822677/authors#authors

All Authors

Mohammed Y. Abdelsadek; Yasser Gadallah; Mohamed H. Ahmed

Document Type

Research Article

Publication Title

IEEE Access

Publication Date

9-30-2019

doi

10.1109/ACCESS.2019.2939120

Abstract

Supporting critical Machine-Type Communications (MTC) in addition to Human-Type Communications (HTC) is a major target for LTE networks to fulfill the 5G requirements. However, guaranteeing a stringent Quality-of-Service (QoS) for MTC, in terms of latency and reliability, while not sacrificing that of HTC is a challenging task from the radio resource management perspective. In this paper, we optimize the resource allocation process through exploiting the additional degrees of freedom introduced by massive Multiple-Input Multiple-Output (MIMO) techniques. We utilize the effective bandwidth and effective capacity concepts to provide statistical guarantees for the QoS, in terms of probability of delay-bound violation, of critical MTC in a cross-layer design manner. In addition, we employ the matching theory to solve the formulated combinatorial problem with much lower computational complexity compared to that of the global optimal solution so that the proposed scheme can be used in practice. In this regard, we analyze the computational complexity of the proposed algorithms and prove their convergence, stability and optimality. The results of extensive simulations that we performed show the ability of the proposed matching-based scheme to satisfy the strict QoS requirements of critical MTC with no impact on those of HTC. In addition, the results show a close-to-global optimal performance while outperforming other algorithms that belong to different scheduling strategies in terms of the adopted performance indicators.

First Page

127141

Last Page

127153

This document is currently not available here.

Find this item online

Share

COinS