Uplink Resource Allocation for Multiple Access Computational Offloading (Extended Version)

TL;DR

This paper investigates uplink resource allocation in mobile edge computing, comparing full multiple access schemes with TDMA, and proposes optimal and low-complexity algorithms to minimize energy consumption for task offloading.

Contribution

It introduces new optimal and low-complexity algorithms for resource allocation under full multiple access and TDMA schemes, improving energy efficiency in offloading systems.

Findings

FullMA achieves significant energy reduction compared to TDMA.

Proposed algorithms outperform existing methods in energy consumption.

Algorithms effectively handle both indivisible and divisible tasks.

Abstract

The mobile edge computing framework offers the opportunity to reduce the energy that devices must expend to complete computational tasks. The extent of that energy reduction depends on the nature of the tasks, and on the choice of the multiple access scheme. In this paper, we first address the uplink communication resource allocation for offloading systems that exploit the full capabilities of the multiple access channel (FullMA). For indivisible tasks we provide a closed-form optimal solution of the energy minimization problem when a given set of users with different latency constraints are offloading, and a tailored greedy search algorithm for finding a good set of offloading users. For divisible tasks we develop a low-complexity algorithm to find a stationary solution. To highlight the impact of the choice of multiple access scheme, we also consider the TDMA scheme, which, in general, cannot exploit the full capabilities of the channel, and we develop low-complexity optimal resource allocation algorithms for indivisible and divisible tasks under that scheme. The energy reduction facilitated by FullMA is illustrated in our numerical experiments. Further, those results show that the proposed algorithms outperform existing algorithms in terms of energy consumption and computational cost.