检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:曹敦[1,2] 张应宝 邹电 王进 汤强 冀保峰[3] CAO Dun;ZHANG Yingbao;ZOU Dian;WANG Jin;TANG Qiang;JI Baofeng(School of Computer and Communication Engineering,Changsha University of Science and Technology,Changsha 410114,China;Key Lab of Broadband Wireless Communication and Sensor Network Technology of Ministry of Education,Nanjing University of Posts and Telecommunications,Nanjing 210003,China;School of Information Engineering,Henan University of Science and Technology,Luoyang 471023,China)
机构地区:[1]长沙理工大学计算机与通信工程学院,湖南长沙410114 [2]南京邮电大学宽带无线通信与传感网技术教育部重点实验室,江苏南京210003 [3]河南科技大学信息工程学院,河南洛阳471023
出 处:《通信学报》2022年第2期185-195,共11页Journal on Communications
基 金:国家自然科学基金资助项目(No.61902041,No.61801170);湖南省自然科学基金资助项目(No.2021JJ30736);长沙市自然科学基金资助项目(No.kq2014112);南京邮电大学宽带无线通信与传感网技术教育部重点实验室开放研究基金资助项目(No.JZNY202102)。
摘 要:为了应对车联网中计算资源密集、可分离型任务的卸载环境动态变化和不同协同节点通信、计算资源存在差异的问题,提出了一种在V2X下多协同节点串行卸载、并行计算的分布式卸载策略。该策略利用车辆可预测的行驶轨迹,对任务进行不等拆分,分布式计算于本地、MEC及协同车辆,建立系统时延最小化的优化问题。为求解该优化问题,设计了博弈论的卸载机制,以实现协同节点串行卸载的执行顺序;鉴于车联网的动态时变特性,利用序列二次规划算法,给出了最优的任务不等拆分。仿真结果表明,所提策略能够有效减少计算任务系统时延,且当多协同节点分布式卸载服务时,所提策略在不同的参数条件下仍然能够保持稳定的系统性能。In order to cope with the dynamic changes of the offloading environment for computing resource-intensive and separable tasks in Internet of vehicle and deal with the problem that different collaborative nodes had different communication and computing resources, a distributed offloading strategy that multiple collaborative nodes had serial offloading mode and parallel computing mode in vehicle to everything(V2 X) scenario was proposed. Utilizing the predictable motion trajectories of vehicle, the tasks were split into unequal parts, finally each part was computed on itself, mobile edge server, and vehicles in parallel. Then an optimization problem of the system time delay minimization was established. To solve the optimization problem, an offloading scheme based on the game theory was designed to determine the serial offloading execution order of the cooperative nodes. Considering the dynamic characteristics of Internet of vehicles, a sequential quadratic programming(SQP) algorithm was adopted to optimally split tasks. Finally, the simulation results show that the proposed strategy can effectively reduce system delay, and when multiple cooperative nodes offload in parallel, the proposed strategy can still maintain the stable system performance under the different parameter conditions.
分 类 号:TN92[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.226.82.161