基于车流密度的车载边缘计算任务动态卸载策略  

Dynamic Unloading Strategy of Vehicle Edge Computing Tasks Based on Traffic Density

作　　者：赵宏伟[1] 尤静月 王阳阳 赵西珂 ZHAO Hongwei;YOU Jingyue;WANG Yangyang;ZHAO Xike(School of Information Engineering,Shenyang University,Shenyang 110041,China)

机构地区：[1]沈阳大学信息工程学院,沈阳110041

出　　处：《计算机科学》2023年第S02期718-724,共7页Computer Science

基　　金：国家自然科学基金面上项目(71672117);国家博士后基金项目(2019M651142);辽宁省高校优秀人才项目(2020389);沈阳市科技计划(21108915)。

摘　　要：针对车辆边缘计算的问题与挑战,提出了一种车-路-边协同的场景模型。以车辆密度为切入点,定义通信链路中断概率最小化问题,建立关于车流密度的通信速率模型。结合车辆卸载、定价以及资源分配3种策略将系统优化目标描述为车辆侧成本最小化,同时最大化RSU侧效用值的问题,引入问题分解的思想降低问题耦合度,将原始优化目标转换为卸载与定价之间的平衡问题以及资源分配问题。验证卸载与定价博弈的Nash均衡点的存在性,并提出一种基于Stackelberg博弈的分布式算法(SDA)求解优化问题。最后通过仿真实验验证了车流密度对于传输速率的影响,以及SDA为车辆降低了24%的卸载成本,为RSU提高了11%的收益。To address the problems and challenges of vehicle edge computing,a scenario model of vehicle-road-edge collaboration is proposed.Using vehicle density as the entry point,this paper defines the communication link outage probability minimization problem and establishes a communication rate model regarding vehicle density.Combining the three strategies of vehicle unloading,pricing and resource allocation,the system optimization objective is described as the problem of minimizing the vehicle-side cost and maximizing the RSU-side utility value.The problem decomposition idea is introduced to reduce the problem coupling,and the original optimization objective is transformed into the balance problem between unloading and pricing and the resource allocation problem.The existence of the Nash equilibrium point of the unloading and pricing game is verified,and a distributed algorithm(SDA)based on Stackelberg's game is proposed to solve the optimization problem.Finally,the impact of traffic density on transmission rate is verified through simulation experiments,and SDA reduces the unloading cost of vehicles by 24%,and increases the revenue of RSU by 11%.

关 键 词：边缘计算 车流密度 STACKELBERG博弈 纳什均衡 动态卸载 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]