论文标题

在NOMA-MEC网络中延迟最小化的最佳资源分配

Optimal Resource Allocation for Delay Minimization in NOMA-MEC Networks

论文作者

Fang, Fang, Xu, Yanqing, Ding, Zhiguo, Shen, Chao, Peng, Mugen, Karagiannidis, George K.

论文摘要

多访问边缘计算(MEC)可以增强移动设备的计算能力,而非正交多访问(NOMA)可以提供高数据速率。结合这两种策略可以有效地通过频谱和能源效率使网络受益。在本文中,我们调查了多用户NOMA-MEC网络中的任务延迟最小化,其中多个用户可以通过同一频段同时卸载其任务。我们采用部分卸载策略,在该策略中,每个用户可以将其计算任务划分为卸载和本地计算零件。我们的目标是通过优化用户的任务分区比率并卸载传输功率来最大程度地减少用户之间的任务延迟。延迟最小化问题首先是提出的,并表明它是一个非convex。通过仔细研究其结构,我们将原始问题转换为同等的准标准。通过这种方式,提出了二级搜索迭代算法,以达到最小任务延迟。为了降低提出的算法的复杂性并评估其最佳性,我们进一步得出了针对两用户NOMA-MEC网络的最佳任务分区比率和卸载功率的封闭形式表达式。模拟证明了所提出算法的收敛性和最佳性以及封闭形式分析的有效性。

Multi-access edge computing (MEC) can enhance the computing capability of mobile devices, while non-orthogonal multiple access (NOMA) can provide high data rates. Combining these two strategies can effectively benefit the network with spectrum and energy efficiency. In this paper, we investigate the task delay minimization in multi-user NOMA-MEC networks, where multiple users can offload their tasks simultaneously through the same frequency band. We adopt the partial offloading policy, in which each user can partition its computation task into offloading and locally computing parts. We aim to minimize the task delay among users by optimizing their tasks partition ratios and offloading transmit power. The delay minimization problem is first formulated, and it is shown that it is a nonconvex one. By carefully investigating its structure, we transform the original problem into an equivalent quasi-convex. In this way, a bisection search iterative algorithm is proposed in order to achieve the minimum task delay. To reduce the complexity of the proposed algorithm and evaluate its optimality, we further derive closed-form expressions for the optimal task partition ratio and offloading power for the case of two-user NOMA-MEC networks. Simulations demonstrate the convergence and optimality of the proposed algorithm and the effectiveness of the closed-form analysis.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源