loading page

Energy-Efficient Task Offloading Under E2E Latency Constraints
  • +2
  • Mohsen Tajallifar ,
  • Sina Ebrahimi ,
  • Mohammad Reza Javan ,
  • Nader Mokari ,
  • Luca Chiaraviglio
Mohsen Tajallifar
Tarbiat Modares University

Corresponding Author:[email protected]

Author Profile
Sina Ebrahimi
Author Profile
Mohammad Reza Javan
Author Profile
Nader Mokari
Author Profile
Luca Chiaraviglio
Author Profile

Abstract

Abstract:
In this paper, we propose a novel resource management scheme that jointly allocates the transmit power and computational resources in a centralized radio access network architecture. The network comprises a set of computing nodes to which the requested tasks of different users are offloaded. The optimization problem minimizes the energy consumption of task offloading while takes the end-to-end-latency, i.e., the transmission, execution, and propagation latencies of each task, into account. We aim to allocate the transmit power and computational resources such that the maximum acceptable latency of each task is satisfied. Since the optimization problem is non-convex, we divide it into two sub-problems, one for transmit power allocation and another for task placement and computational resource allocation. Transmit power is allocated via the convex-concave procedure. In addition, a heuristic algorithm is proposed to jointly manage computational resources and task placement. We also propose a feasibility analysis that finds a feasible subset of tasks. Furthermore, a disjoint method that separately allocates the transmit power and the computational resources is proposed as the baseline of comparison. A lower bound on the optimal solution of the optimization problem is also derived based on exhaustive search over task placement decisions and utilizing Karush–Kuhn–Tucker conditions. Simulation results show that the joint method outperforms the disjoint method in terms of acceptance ratio. Simulations also show that the optimality gap of the joint method is less than 5%.
Mar 2022Published in IEEE Transactions on Communications volume 70 issue 3 on pages 1711-1725. 10.1109/TCOMM.2021.3132909