Resource Allocation for mmWave-NOMA Communication through Multiple Access Points Considering Human Blockages

In this paper, a new framework for optimizing the resource allocation in a millimeter-wave-non-orthogonal multiple access (mmWave-NOMA) communication for crowded venues is proposed. MmWave communications suffer from severe blockage caused by obstacles such as the human body, especially in a dense re...

Full description

Saved in:
Bibliographic Details
Main Authors: Barghikar, Foad, Tabataba, Foroogh S, Soorki, Mehdi Naderi
Format: Journal Article
Language:English
Published: 27-05-2020
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, a new framework for optimizing the resource allocation in a millimeter-wave-non-orthogonal multiple access (mmWave-NOMA) communication for crowded venues is proposed. MmWave communications suffer from severe blockage caused by obstacles such as the human body, especially in a dense region. Thus, a detailed method for modeling the blockage events in the in-venue scenarios is introduced. Also, several mmWave access points are considered in different locations. To maximize the network sum rate, the resource allocation problem is formulated as a mixed integer non-linear programming, which is NP-hard in general. Hence, a three-stage low-complex solution is proposed to solve the problem. At first, a user scheduling algorithm, i.e., modified worst connection swapping (MWCS), is proposed. Secondly, the antenna allocation problem is solved using the simulated annealing algorithm. Afterward, to maximize the network sum rate and guarantee the quality of service constraints, a non-convex power allocation optimization problem is solved by adopting the difference of convex programming approach. The simulation results show that, under the blockage effect, the proposed mmWave-NOMA scheme performs on average 23% better than the conventional mmWave-orthogonal multiple access scheme. Moreover, the performance of proposed solution is 11.4% lower than the optimal value while reducing complexity by 96%.
DOI:10.48550/arxiv.2005.13182