TY - JOUR
T1 - Cost Minimization for Cooperative Computation Framework in MEC Networks
AU - Pan, Yijin
AU - Pana, Cunhua
AU - Wang, Kezhi
AU - Zhu, Huiling
AU - Wang, Jiangzhou
N1 - Funding information: This work was supported in part by the National Natural Science Foundation of China under Grants No. 62001107, No. 61971129, No. 61960206005, No. 61871128, Basic Research Project of Jiangsu Provincial Department of Science and Technology under Grant No. BK20190339, the UK Royal Society Newton International Fellowship under Grant NIF\R1\180777.
PY - 2021/6/1
Y1 - 2021/6/1
N2 - 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.
AB - 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.
KW - accomplished tasks
KW - Complexity theory
KW - D2D
KW - Delays
KW - Device-to-device communication
KW - Heuristic algorithms
KW - MEC
KW - Power demand
KW - power efficiency
KW - Servers
KW - Task analysis
KW - user cooperation
UR - http://www.scopus.com/inward/record.url?scp=85100452452&partnerID=8YFLogxK
U2 - 10.1109/TWC.2021.3052887
DO - 10.1109/TWC.2021.3052887
M3 - Article
AN - SCOPUS:85100452452
SN - 1536-1276
VL - 20
SP - 3670
EP - 3684
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 6
ER -