In this article, a two-user scenario of a non-orthogonal multiple access (NOMA)-based mobile edge computing (MEC) network is investigated. By treating the users and the MEC server as leader and follower , respectively, a Stackelberg game is formulated. More specifically, the leader tends to minimize the total energy consumption for task offloading and local computing by optimizing the task assignment coefficients and transmit power. On the other side, the follower aims to minimize the total execution time by allocating different computational resources for processing the offloaded tasks. In order to solve the formulated problem, the Stackelberg equilibrium is considered. Based on the given insights, a closed-form solution of the follower level problem is obtained and included in the leader level one. Furthermore, by analyzing the leader’s strategies, the leader level problem is solved through the Karush-Kuhn-Tucker (KKT) conditions, and closed-form expressions for the optimal task assignment coefficients and offloading time, are derived. Finally, this work is extended to the multi-user scenario, where a matching-based user pairing algorithm is proposed to assign users into different sub-channels. Simulation results indicate that: i) the derived closed-form solutions and the proposed user pairing algorithm can significantly improve energy efficiency; ii) the different task assignment strategies can be dynamically implemented to handle the varying wireless environment.

中文翻译：

---

使用NOMA的MEC系统中的能耗和延迟的Stackelberg博弈

在本文中，研究了基于非正交多址（NOMA）的移动边缘计算（MEC）网络的两用户方案。通过将用户和MEC服务器视为领导 和 追随者 ，分别制定了Stackelberg游戏。更具体地说，领导者倾向于通过优化任务分配系数和发射功率来最小化任务卸载和本地计算的总能耗。另一方面，关注者的目的是通过分配不同的计算资源来处理卸载的任务，以最大程度地减少总执行时间。为了解决所提出的问题，考虑了斯塔克尔伯格平衡。根据给定的见解，获得跟随者级别问题的封闭式解决方案，并将其包含在领导者级别之一中。此外，通过分析领导者的策略，通过Karush-Kuhn-Tucker（KKT）条件解决了领导者级别的问题，并得出了最优任务分配系数和卸载时间的闭式表达式。最后，这项工作扩展到了多用户方案，其中提出了一种基于匹配的用户配对算法，可以将用户分配到不同的子信道中。仿真结果表明：i）导出的闭式解和所提出的用户配对算法可以显着提高能源效率；ii）可以动态地实施不同的任务分配策略，以处理变化的无线环境。