arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2005.13182eess.SP
收藏

考虑人为阻塞的mmWave-NOMA多址接入点通信资源分配

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

Foad Barghikar, Foroogh S. Tabataba, Mehdi Naderi Soorki

摘要:

提出了一种新的用于拥挤场所的毫米波非正交多址接入(mmWave-NOMA)通信中的资源分配优化框架。MmWave通信受到诸如人体等障碍物的严重阻塞,特别是在密集区域。因此,详细的方法建模的阻塞事件在场地的情况下介绍。此外,在不同位置考虑了几个毫米波接入点。以网络总速率最大化为目标,将资源分配问题转化为一个混合整数非线性规划问题,该问题一般是NP-难的。因此,一个三阶段的低复杂度的解决方案,提出了解决这个问题。首先,提出了一种用户调度算法,提出了一种改进的最坏连接交换算法。其次,采用模拟退火算法求解天线分配问题。然后,以最大化网络总速率和保证服务质量约束为目标,采用差分凸规划方法求解非凸功率分配优化问题。仿真结果表明,在阻塞效应下,所提出的mmWave-NOMA方案比传统的mmWave-orthogonal多址接入方案的性能平均好23%。此外,所提出的解决方案的性能比最优值低11.4%,同时降低了96%的复杂度。

英文摘要:

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%.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑