林文彬, 唐志军, 邓超平, 孙鑫, 慈松, 周杨林. 基于VCG拍卖机制的任务卸载策略[J]. 电力信息与通信技术, 2024, 22(10): 61-67. DOI: 10.16543/j.2095-641x.electric.power.ict.2024.10.09
引用本文: 林文彬, 唐志军, 邓超平, 孙鑫, 慈松, 周杨林. 基于VCG拍卖机制的任务卸载策略[J]. 电力信息与通信技术, 2024, 22(10): 61-67. DOI: 10.16543/j.2095-641x.electric.power.ict.2024.10.09
LIN Wenbin, TANG Zhijun, DENG Chaoping, SUN Xin, CI Song, ZHOU Yanglin. Task Offloading Strategy Based on VCG Auction Mechanism[J]. Electric Power Information and Communication Technology, 2024, 22(10): 61-67. DOI: 10.16543/j.2095-641x.electric.power.ict.2024.10.09
Citation: LIN Wenbin, TANG Zhijun, DENG Chaoping, SUN Xin, CI Song, ZHOU Yanglin. Task Offloading Strategy Based on VCG Auction Mechanism[J]. Electric Power Information and Communication Technology, 2024, 22(10): 61-67. DOI: 10.16543/j.2095-641x.electric.power.ict.2024.10.09

基于VCG拍卖机制的任务卸载策略

Task Offloading Strategy Based on VCG Auction Mechanism

  • 摘要: 基于电力巡检机器人的变电站自动巡检技术能够快速找到故障区域,提升巡检效果。然而由于机器人终端的计算资源和能量有限,如何实时高效地处理巡检机器人采集的图像信息等以实现快速巡检是一个待解决的挑战。考虑到同时存在多个机器人终端将计算任务卸载给多个边缘计算供应商(edge computing provider,ECP),文章提出了基于VCG(Vickrey-Clarke-Groves)拍卖机制的计算任务卸载方案以降低任务处理时延并最大化ECP收益。首先,建立了多个终端向多个ECP进行任务卸载的异构网络模型。考虑到真实任务场景中任务可能是可以拆分的,将子任务以有向无环图(directed acyclic graph,DAG)的形式进行建模,并提出了考虑通信和计算资源时延的计算任务卸载算法。该算法考虑了每个ECP的收益,并通过VCG拍卖机制设计拍卖算法以保证该算法的真实性和有效性。最后,仿真证明该算法的性能能够迅速逼近最优卸载决策。

     

    Abstract: Substation automatic inspection technology based on electric inspection robot can quickly find the fault area and improve the inspection effect. However, due to the limited computing resources and energy of the robot terminal, how to process the image information collected by the inspection robot in real time and efficiently to realize rapid inspection is a challenge to be solved. Considering the presence of multiple robotic terminals offloading Computing tasks to multiple edge computing providers (ECP), This paper proposes a solution to unload computing tasks based on VCG (Vickrey-Clarke-Groves) auction mechanism to reduce task processing delay and maximize ECP revenue. Firstly, this paper establishes a heterogeneous network model in which multiple terminals unload tasks to multiple ECPs. In addition, considering that tasks may be divisible in a real task scenario, we modeled the subtasks as Directed acyclic graph (DAG), and proposed an offloading algorithm for computing tasks that took into account communication and computing resource latency. The algorithm considers the revenue of each ECP and designs the auction algorithm through the VCG auction mechanism to ensure the authenticity and effectiveness of the algorithm. Finally, simulation results show that the performance of this algorithm can quickly approximate the optimal unloading decision.

     

/

返回文章
返回