边缘计算中多设备多任务的能耗均衡优化算法

Energy Balancing for Multiple Devices with Multiple Tasks in Mobile Edge Computing

移动边缘计算技术随着科技的发展,面临着多设备多任务的能耗均衡的挑战。相关研究大多集中在如何利用边缘服务器的计算性能以减少移动设备在任务处理过程中的能耗和执行时间。但现有研究在多设备多任务的能耗均衡问题上还没有很好的解决方法。针对此类能耗均衡问题,改进了现有的边缘计算系统模型,并在此基础上,给出了多移动设备多任务的能耗均衡优化问题的计算模型,同时提出了一个贪心算法,并做出了相应的近似比分析。与总能耗优化算法以及随机算法进行对比,并进行了大量的仿真实验。实验结果证明,所提出的贪心算法的平均性能与随机算法相比在能耗均衡方面可进一步提升66.59%。通过与蛮力算法对比,在经典的任务拓扑下,当移动设备的最小传输功率分别为5 dBm和6 dBm时,贪心算法几乎获得最优解。

With the development of technology,mobile edge computing is facing the challenge of energy balancing of multi-device and multi-task.Related research mostly focuses on how to utilize the computing performance of edge servers to reduce the energy consumption and execution time of mobile devices during task processing.However,the existing research has not yet a good solution to the problem of multi-device and multi-task energy balancing.Aiming at this kind of energy balancing problem,this paper improves the existing edge computing system model,and gives a calculation model for the energy balancing optimization problem of multi-device and multi-task.At the same time,a greedy algorithm is proposed and the corresponding approximate ratio analysis is made.In addition,this paper is compared with the total energy consumption minimization algorithm and the random algorithm,and a large number of simulation experiments are conducted.Experimental results reveal that the average performance of the proposed greedy algorithm can be further improved by 66.59%in terms of energy balancing than the random algorithm.Compared with the brute force algorithm,under the classic task topology,when the minimum transmission power of the mobile device is 5 dBm and 6 dBm respectively,the greedy algorithm almost obtains the optimal solution.