.png){kind=icon}
.png){kind=icon}
Return
Cost Minimization for Cooperative Computation Framework in MEC Networks
.png){kind=icon}
OA
AI
DOI：10.1109/TWC.2021.3052887.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, a cooperative task computation framework exploits the computation resource in user equipments (UEs) to accomplish more tasks meanwhile minimizes the power consumption of UEs. The system cost includes the cost of UEs' power consumption and the penalty of unaccomplished tasks, and the system cost is minimized by jointly optimizing binary offloading decisions, the computational frequencies, and the offloading transmit power. To solve the formulated mixed-integer non-linear programming problem, three efficient algorithms are proposed, i.e., integer constraints relaxation-based iterative algorithm (ICRBI), heuristic matching algorithm, and the decentralized algorithm. The ICRBI algorithm achieves the best performance at the cost of the highest complexity, while the heuristic matching algorithm significantly reduces the complexity while still providing reasonable performance. As the previous two algorithms are centralized, the decentralized algorithm is also provided to further reduce the complexity, and it is suitable for the scenarios that cannot provide the central controller. The simulation results are provided to validate the performance gain in terms of the total system cost obtained by the proposed cooperative computation framework.
Keywords:
Task analysis
Servers
Delays
Heuristic algorithms
Device-to-device communication
Power demand
Complexity theory
MEC
D2D
user cooperation
accomplished tasks
power efficiency
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W
Organization
View more organizations