Delay Minimization for Secure NOMA Mobile-Edge Computing

Abstract

This paper considers an uplink non-orthogonal multiple access (NOMA)-based mobile-edge computing (MEC) network, in the presence of a malicious eavesdropper. The studied model, we investigate the task completion time minimization problem is studied while the secrecy rate is guaranteed. The aim is to minimize the maximum task latency for the uplink NOMA users, subject to the worst-case secrecy rate, the transmit power and secrecy outage probability constraints. Due to the non-convexity of the formulated problem, we cannot solve it directly. By analyzing the attributes of the problem, some significant insights are revealed to simplify the original formulated problem. Based on this result, a bisection searching (BSS) based algorithm is proposed to find the optimal solution of the transformed problem. Finally, numerical results are provided to demonstrate the effectiveness of our proposed scheme.