Delay Minimization for NOMA-MEC Offloading

TL;DR

This paper addresses reducing offloading delay in NOMA-MEC systems by formulating a fractional programming problem and proposing two convergent iterative algorithms, also providing mode selection criteria among OMA, pure NOMA, and hybrid NOMA.

Contribution

It introduces two novel algorithms based on Dinkelbach's and Newton's methods for delay minimization in NOMA-MEC and establishes criteria for optimal mode selection.

Findings

Both algorithms are proven to be optimal and converge.

The proposed methods outperform existing approaches in delay reduction.

Mode selection criteria effectively determine the best access scheme for MEC offloading.

Abstract

This paper considers the minimization of the offloading delay for non-orthogonal multiple access assisted mobile edge computing (NOMA-MEC). By transforming the delay minimization problem into a form of fractional programming, two iterative algorithms based on Dinkelbach's method and Newton's method are proposed. The optimality of both methods is proved and their convergence is compared. Furthermore, criteria for choosing between three possible modes, namely orthogonal multiple access (OMA), pure NOMA, and hybrid NOMA, for MEC offloading are established.