arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.01239cs.ITeess.SPmath.IT

一种基于非正交多址接入的移动边缘计算最大最小任务卸载算法

A Max-Min Task Offloading Algorithm for Mobile Edge Computing Using Non-Orthogonal Multiple Access

Vaibhav Kumar, Muhammad Fainan Hanif, Markku Juntti, Le-Nam Tran

AI总结:

本文提出一种基于NOMA的MEC任务卸载算法,通过最大化最差用户卸载比特数,解决非凸优化问题,相比OMA显著提升性能,适用于延迟敏感应用。

摘要:

为了缓解网络核心与边缘之间的计算能力差距,移动边缘计算(MEC)将在未来几代无线网络中发挥基础性作用。本文考虑一种非正交多址接入(NOMA)传输模型,以最大化所有用户中卸载到网络边缘服务器的最差任务。针对多用户NOMA-MEC系统中最大化最小卸载比特数的非凸优化问题,提出了一种可证明收敛且高效的算法。与优化的正交多址接入(OMA)方法相比,在给定的MEC延迟、功率和能量限制下,基于NOMA的系统在MEC设置中显著优于基于OMA的系统。数值结果表明,所提出的基于NOMA的MEC算法对于延迟敏感型应用尤其有用。

英文摘要:

To mitigate computational power gap between the network core and edges, mobile edge computing (MEC) is poised to play a fundamental role in future generations of wireless networks. In this letter, we consider a non-orthogonal multiple access (NOMA) transmission model to maximize the worst task to be offloaded among all users to the network edge server. A provably convergent and efficient algorithm is developed to solve the considered non-convex optimization problem for maximizing the minimum number of offloaded bits in a multi-user NOMAMEC system. Compared to the approach of optimized orthogonal multiple access (OMA), for given MEC delay, power and energy limits, the NOMA-based system considerably outperforms its OMA-based counterpart in MEC settings. Numerical results demonstrate that the proposed algorithm for NOMA-based MEC is particularly useful for delay sensitive applications.

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

↑