4.7 Article

Energy-Efficient Task Offloading Under E2E Latency Constraints

期刊

IEEE TRANSACTIONS ON COMMUNICATIONS
卷 70, 期 3, 页码 1711-1725

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCOMM.2021.3132909

关键词

Task analysis; Servers; Resource management; Optimization; Radio links; Energy consumption; Computational modeling; Mobile edge computing; task offloading; resource allocation; end-to-end latency; task placement

向作者/读者索取更多资源

In this paper, a novel resource management scheme is proposed for the joint allocation of transmit power and computational resources in a centralized radio access network architecture. The optimization problem is divided into two sub-problems and solved using convex-concave procedure and heuristic algorithm. Feasibility analysis and a baseline method are also proposed. Simulation results show the superiority of the joint method in terms of acceptance ratio, with an optimality gap less than 5%.
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%.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据