The combination of non-orthogonal multiple access (NOMA) and mobile edge computing (MEC) can significantly improve the spectrum efficiency beyond the fifth-generation network. In this paper, we mainly focus on energy-efficient resource allocation for a multi-user, multi-BS NOMA assisted MEC network with imperfect channel state information (CSI), in which each user can upload its tasks to multiple base stations (BSs) for remote executions. To minimize the energy consumption, we consider jointly optimizing the task assignment, power allocation and user association. As the main contribution, with imperfect CSI, the optimal closed-form expressions of task assignment and power allocation are analytically derived for the two-BS case. Specifically, the original formulated problem is nonconvex. We first transform the probabilistic problem into a non-probabilistic one. Subsequently, a bilevel programming method is proposed to derive the optimal solution. In addition, by incorporating the matching algorithm with the optimal task and power allocation, we propose a low complexity algorithm to efficiently optimize user association for the multi-user and multi-BS case. Simulations demonstrate that the proposed algorithm can yield much better performance than the conventional OMA scheme but also the identical results with lower complexity from the exhaustive search with the small number of BSs.
翻译:在本文中,我们主要侧重于为多用户、多B-多用户、多局-多局、NOMA协助的MEC网络提供节能资源分配,多频道国家信息不完善,每个用户都可以将其任务上传到多个基地站(BS),以便进行远程处决。为了最大限度地减少能源消耗,我们考虑联合优化任务分配、电力分配和用户协会(MEC),非横向多存取(NOMA)和移动边缘计算(MEC)的组合,可以大大提高第五代网络以外的频谱率效率。在本文件中,我们主要侧重于为多用户、多BS多用户网络的多用户、多用户网络网络网络,侧重于为多用户多用户多用户多用户、多用户网络网络的多用户网络提供最佳任务分配任务分配和电力分配的封闭式最佳任务分配表达形式的主要贡献,因为CSI不完善的CSI、任务分配和权力分配的最佳封闭式表达方式的主要贡献是分析为两个BS案件分析衍生出。具体地说,最初形成的问题是非connexx。我们首先将概率问题转化为。我们首先将概率将概率问题转化为。我们先将概率问题转化为。我们先先将概率问题转化为,我们先先先先先先先将概率问题,先将概率问题转化为。我们先将概率问题,先先将概率问题转化为,先将概率问题,先将概率问题转化为,先将概率问题转化为,先将概率问题转换算算算算法问题,先将概率问题,然后制制问题,先提出,先提出,先提出,然后用和多用户和多用户和多点,然后用和多审,然后用和多审,然后用用户和多B,然后用用户和多B的用户和多B,然后用用户和多B的用户和多B的用户联系。我们提出的用户和多B,然后用的、最小的用户和多B,然后算算算算算算算算算算,然后用的用户联系,然后算算算算算算算,然后制最佳定法可以产生更小的用户联系联系联系联系,然后用。我们提议法可以产生更小的、低的、低的、低的、低的、低的、低的用户和多号的用户和多号的用户和多的用户和多号的用户和多