首页 | 本学科首页   官方微博 | 高级检索  
     

面向车辆边缘计算的任务合作卸载
引用本文:鲁蔚锋,印文徐,王菁,费汉明,徐佳.面向车辆边缘计算的任务合作卸载[J].四川大学学报(工程科学版),2024,56(1):89-98.
作者姓名:鲁蔚锋  印文徐  王菁  费汉明  徐佳
作者单位:南京邮电大学计算机学院,南京邮电大学计算机学院,南京邮电大学计算机学院,国铁吉讯科技有限公司,南京邮电大学计算机学院
基金项目:国家自然科学基金项目(62372249, 62072254, 62272237, 62171217, 62372250, 62302236);中国铁道科学研究院集团有限公司院基金课题重点项目(2022YJ302)
摘    要:随着物联网技术和人工智能技术的飞速发展,车辆边缘计算越来越引起人们的注意。车辆如何有效地利用车辆周边的各种通信、计算和缓存资源,结合边缘计算系统模型将计算任务迁移到离车辆更近的路边单元,已经成为目前车联网研究的热点。由于车辆应用设备有限的计算资源,车辆用户的任务计算需求无法满足,需要充分利用车辆周边的计算资源来计算任务。本文研究了车辆边缘计算中任务的合作卸载机制,以最小化车辆任务的计算时延。首先,设计了任务合作卸载的三层系统架构,考虑了车辆周边停泊车辆的计算资源以及路边单元的计算资源,组成云服务器层、停泊车辆合作集群层和路边单元合作集群层的三层架构。通过路边单元合作集群和停泊车辆合作集群的合作卸载,充分利用系统的空闲计算资源,进一步提高了系统的资源利用率。然后,基于k-聚类算法的思想提出了路边单元合作集群划分算法对路边单元进行合作集群的划分,并采用块连续上界最小化的分布式迭代优化方法设计了任务合作卸载算法,对终端车辆用户的任务进行卸载计算。最后,通过将本文算法和其他算法方案的进行实验对比,仿真结果表明,本文算法在系统时延和系统吞吐量方面具有更好的性能表现,可以降低23%的系统时延,并且能提升28%的系统吞吐量。

关 键 词:边缘计算  车辆边缘计算  合作卸载  k-聚类  计算卸载
收稿时间:2022/9/5 0:00:00
修稿时间:2023/12/13 0:00:00

Task Cooperative Offloading for Vehicle Edge Computing
LU Weifeng,YIN Wenxu,WANG Jing,FEI Hanming,XU Jia.Task Cooperative Offloading for Vehicle Edge Computing[J].Journal of Sichuan University (Engineering Science Edition),2024,56(1):89-98.
Authors:LU Weifeng  YIN Wenxu  WANG Jing  FEI Hanming  XU Jia
Affiliation:School of Computer Sci., Nanjing Univ. of Posts and Telecommunications, Nanjing 210023, China;Jiangsu Key Lab. of Big Data Security and Intelligent Processing, Nanjing 210023, China;China Railway Gecent Technol. Co., Ltd., Beijing 100081, China
Abstract:With the rapid development of IoT technology and artificial intelligence technology, Vehicle Edge Computing has attracted more and more attention. Effectively utilizing the various communication, computational, and caching resources in the vicinity of vehicles, and employing edge computing system models to migrate computational tasks closer to the vehicles, have become a hotspot in current Internet of Vehicles research. Due to the limited computational resources of in-vehicle devices, the computational demands of vehicle users cannot be met without making full use of the computational resources available in the vicinity of vehicles. This paper investigated a collaborative offloading mechanism for computational tasks in vehicle edge computing, aiming to minimize the computational latency of vehicular tasks. Firstly, a three-layer architecture for task collaborative offloading was designed considering the computational resources of parked vehicles in the vicinity of vehicles as well as the computational resources of roadside units, which is comprised with three tiers: cloud server layer, roadside unit collaboration cluster layer, and the parked vehicle collaboration cluster layer. By means of collaborative offloading between the roadside unit collaboration cluster and the parked vehicle collaboration cluster, the free computational resources of system were fully leveraged, further enhanced resource utilization. Then, this paper proposed a roadside unit collaboration cluster partitioning algorithm based on k-means clustering algorithm for segmenting roadside units into collaboration clusters. A distributed iterative optimization approach with block-coordinate upper-bound minimization was utilized to design a task collaborative offloading algorithm for offloading the computation of terminal vehicle users'' tasks. Finally, By comparing the algorithm proposed in this paper with other algorithm schemes through experiments, the algorithm proposed in this paper had better performance in terms of system latency and system throughput according the stimulation result. Specifically, system latency was reduced by 23% and system throughput was increased by 28%.
Keywords:edge computing  vehicle edge computing  cooperative offloading  k-means  compute offloading
点击此处可从《四川大学学报(工程科学版)》浏览原始摘要信息
点击此处可从《四川大学学报(工程科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号