4.7 Article

NOMA-Enabled Computation and Communication Resource Trading for a Multi-User MEC System

Journal

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
Volume 71, Issue 7, Pages 7532-7547

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TVT.2022.3168503

Keywords

Incentive design; mobile-edge computing; resource allocation; task offloading

Funding

  1. NSF [CNS-1823304, CNS-1909381]
  2. Air Force Office of Scientific Research [FA9550-19-1-0375]

Ask authors/readers for more resources

This article proposes a novel framework for a multi-user mobile edge computing (MEC) network, where users with high downlink rate demands and users with intensive computation tasks can collaborate to reduce task completion time and improve downlink user rates. By using non-orthogonal multiple access (NOMA), the users with computation tasks can offload part of the tasks to the edge cloud and the downlink users, while forwarding information received from the base station (BS) to the downlink users. A joint optimization of communication and computational resources, user pairings, task sharing, and relay bits is performed to minimize task completion time and satisfy downlink user incentives. Simulation results demonstrate significant reductions in task completion time and computational energy savings at the edge cloud, as well as improved downlink user rates compared to orthogonal transmission.
In this article, we establish a novel framework for a multi-user mobile edge computing (MEC) network in which a set of users with high downlink rate demands and a set of users with intensive computation tasks can collaborate to achieve a mutually-beneficial scenario such that completion time of the tasks is reduced and the base station (BS) can send more information at a higher rate to the downlink users. Specifically, by leveraging non-orthogonal multiple access (NOMA) for uplink and downlink traffic, the user with the computation task can offload shares of the computation task to the edge cloud and the downlink user. At the same time, this user forwards the information it receives from the BS to the downlink user. In this set up, we jointly optimize the communication resources, computational resources at the edge cloud and user devices, pairings among the two sets of users, the shares of computation tasks, and relay bits to minimize the total task completion time while satisfying downlink users incentive requirements. For a network with a single computation demanding user and a single downlink user, the optimal solution to the problem is provided. For a network with multiple users, the problem is non-convex and computationally challenging. Hence, we propose an efficient, low complexity algorithm that utilizes the bottleneck matching algorithm, convex optimization, and the block coordinate descent scheme to obtain a locally-optimal solution. Simulation results demonstrate that, as compared with the state-of-the-art, the total task completion time is greatly reduced (32%-51%), and a large computational energy savings at the edge cloud (38%-55%) is achieved. Simultaneously, the downlink users rates improve compared to the orthogonal transmission.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available