论文标题
MEC网络中合作计算框架的成本最小化
Cost Minimization for Cooperative Computation Framework in MEC Networks
论文作者
论文摘要
在本文中,合作的任务计算框架利用UES中的计算资源来完成更多任务,同时最大程度地减少了UES的功耗。系统成本包括UES功耗的成本和未完成任务的罚款,并且通过共同优化二进制卸载决策,计算频率和卸载传输功率来最大程度地减少系统成本。为了解决公式的混合构成非线性编程问题,提出了三种有效的算法,即基于整数限制基于放松的迭代算法(ICRBI),启发式匹配算法和分散算法。 ICRBI算法以最高复杂性的成本实现了最佳性能,而启发式匹配算法大大降低了复杂性,同时仍提供合理的性能。由于前两种算法是集中的,因此还提供了分散算法以进一步降低复杂性,并且适用于无法提供中央控制器的场景。提供了模拟结果,以根据建议的合作计算框架获得的总系统成本来验证性能增长。
In this paper, a cooperative task computation framework exploits the computation resource in 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.