Joint Computation and Communication Resource Allocation with NOMA and OMA Offloading for Multi-server Systems in F-RAN

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

View graph of relations

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)24456-24466
Journal / PublicationIEEE Access
Volume10
Online published17 Feb 2022
Publication statusPublished - 2022

Link(s)

Abstract

Since mobile devices typically have limited computation resources, offloading computation tasks to fog access points (F-APs) is a promising approach to support delay-sensitive and computation-intensive applications. This paper considers joint computation and communication resource allocation for multiuser multi-server systems, which aims to maximize the number of users being served and minimize the total energy consumption subject to delay tolerance constraints. The joint computation and communication resource allocation problem is solved optimally for both non-orthogonal multiple access (NOMA) and orthogonal multiple access (OMA) schemes. The joint user pairing and Fog Access Point assignment problem for NOMA is proved to be NP-hard. For both NOMA and OMA, heuristic and optimal algorithms based on graph matching are designed. The optimal algorithms, though of high complexity, allow NOMA and OMA to be compared at their full potential and serve as benchmarks for evaluating the heuristic algorithms. Simulation results show that NOMA significantly outperforms OMA in terms of outage probability and energy consumption, especially for tight delay tolerance constraints and large computational tasks. Simulation results also demonstrate that our proposed NOMA and OMA schemes significantly outperform the swap-enabled matching algorithm widely used in the literature.

Research Area(s)

  • Delays, Energy consumption, mobile edge computing, multiuser multi-server computation offloading, NOMA, OMA, Resource management, Servers, Simulation, Task analysis, weighted hypergraph matching

Download Statistics

No data available