Energy-Efficient Resource Allocation for D2D-Assisted Fog Computing
In this paper, we address the problem of energy-efficient resource allocation in a multi-device D2D-assisted fog computing scenario, where the goal is to minimize the total energy consumption subject to constraints on the transmit powers, computation resources and task processing times. The consider...
Saved in:
Published in | IEEE transactions on green communications and networking Vol. 6; no. 4; pp. 1990 - 2002 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Piscataway
IEEE
01.12.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In this paper, we address the problem of energy-efficient resource allocation in a multi-device D2D-assisted fog computing scenario, where the goal is to minimize the total energy consumption subject to constraints on the transmit powers, computation resources and task processing times. The considered problem is non-convex and finding its global optimum is generally intractable; hence we propose two sub-optimal approaches to solve it. First, by investigating the relationship between the task processing time and the total energy consumption, we show how the original problem can be relaxed into a sequence of convex subproblems whose solutions can be efficiently obtained via standard algorithms. Second, to further reduce computational complexity, we propose a low-complexity heuristic resource allocation strategy which does not require calculating gradients and the Hessian matrices in the solution process. We also develop a lower bound on the total energy consumption for the considered task offloading scenario as a benchmark for comparison purpose. Computer simulations under a wide range of conditions and parameter settings show that both methods achieve a near-optimal solution in comparison to the lower bound. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
ISSN: | 2473-2400 2473-2400 |
DOI: | 10.1109/TGCN.2022.3190085 |