Joint resource allocation for hybrid NOMA-assisted MEC in 6G networks
Haodong Li, Fang Fang, Zhiguo Ding
Digital Communications and Networks · 2020
doi:10.1016/j.dcan.2020.05.005 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Multi-access Edge Computing (MEC) is an essential technology for expanding computing power of mobile devices, which can combine the Non-Orthogonal Multiple Access (NOMA) in the power domain to multiplex signals to improve spectral efficiency . We study the integration of the MEC with the NOMA to improve the computation service for the Beyond Fifth-Generation (B5G) and the Sixth-Generation (6G) wireless networks. This paper aims to minimize the energy consumption of a hybrid NOMA-assisted MEC system. In a hybrid NOMA system, a user can offload its task during a time slot shared with another user by the NOMA, and then upload the remaining data during an exclusive time duration served by Orthogonal Multiple Access (OMA). The original energy minimization problem is non-convex. To efficiently solve it, we first assume that the user grouping is given, and focuses on the one group case. Then, a multilevel programming method is proposed to solve the non-convex problem by decomposing it into three subproblems , i.e., power allocation , time slot scheduling, and offloading task assignment, which are solved optimally by carefully studying their convexity and monotonicity. The derived solution is optimal to the original problem by substituting the closed expressions obtained from those decomposed subproblems. Furthermore, we investigate the multi-user case, in which a close-to-optimal algorithm with low-complexity is proposed to form users into different groups with unique time slots. The simulation results verify the superior performance of the proposed scheme compared with some benchmarks, such as OMA and pure NOMA.
Abstract licence: CC BY-NC-ND
References40
40 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.