Chen Cheng, Linbo Zhai, Yujuan Jia, Xiumin Zhu, Yumei Li
{"title":"车载边缘计算中基于蚁群优化算法的志愿车辆辅助依赖任务卸载","authors":"Chen Cheng, Linbo Zhai, Yujuan Jia, Xiumin Zhu, Yumei Li","doi":"10.1016/j.vehcom.2024.100849","DOIUrl":null,"url":null,"abstract":"<div><div>Vehicle Edge Computing improves the Quality of Service of vehicular applications by offloading tasks to the VEC server. However, with the continuous development of computation-intensive vehicular applications, the limited resources of the VEC server will not be enough to support these applications. Volunteer Computing-Based Vehicular Ad-hoc Networking (VCBV) proposes a concept of using vehicles as resources, which is considered to be a promising solution. In this paper, we study the multi-dependent task offloading problem in order to quickly and economically handle the overload task of the requesting vehicle in VCBV. Considering both task execution delay and execution cost, we formulate the problem of offloading the multi-dependent tasks of requesting vehicles to minimize total task completion time and execution cost. Since the offloading problem is NP-hard, an improved multi-objective Ant Colony Optimization algorithm is proposed. Firstly, we use a density-based clustering algorithm to form volunteer alliances that can contribute idle resources. Secondly, based on the volunteer alliances and RSUs, we use Analytic Hierarchy Process (AHP) to initialize pheromone concentration to make better decisions. Then, we design the update strategy of the pheromone concentration and heuristic information. Finally, we introduce Pareto optimal relationship to evaluate the results. A large number of simulation results verify that our algorithm has better performance than other alternatives.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":null,"pages":null},"PeriodicalIF":5.8000,"publicationDate":"2024-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Volunteer vehicle assisted dependent task offloading based on ant colony optimization algorithm in vehicular edge computing\",\"authors\":\"Chen Cheng, Linbo Zhai, Yujuan Jia, Xiumin Zhu, Yumei Li\",\"doi\":\"10.1016/j.vehcom.2024.100849\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Vehicle Edge Computing improves the Quality of Service of vehicular applications by offloading tasks to the VEC server. However, with the continuous development of computation-intensive vehicular applications, the limited resources of the VEC server will not be enough to support these applications. Volunteer Computing-Based Vehicular Ad-hoc Networking (VCBV) proposes a concept of using vehicles as resources, which is considered to be a promising solution. In this paper, we study the multi-dependent task offloading problem in order to quickly and economically handle the overload task of the requesting vehicle in VCBV. Considering both task execution delay and execution cost, we formulate the problem of offloading the multi-dependent tasks of requesting vehicles to minimize total task completion time and execution cost. Since the offloading problem is NP-hard, an improved multi-objective Ant Colony Optimization algorithm is proposed. Firstly, we use a density-based clustering algorithm to form volunteer alliances that can contribute idle resources. Secondly, based on the volunteer alliances and RSUs, we use Analytic Hierarchy Process (AHP) to initialize pheromone concentration to make better decisions. Then, we design the update strategy of the pheromone concentration and heuristic information. Finally, we introduce Pareto optimal relationship to evaluate the results. A large number of simulation results verify that our algorithm has better performance than other alternatives.</div></div>\",\"PeriodicalId\":54346,\"journal\":{\"name\":\"Vehicular Communications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":5.8000,\"publicationDate\":\"2024-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Vehicular Communications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2214209624001244\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"TELECOMMUNICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Vehicular Communications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2214209624001244","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
Volunteer vehicle assisted dependent task offloading based on ant colony optimization algorithm in vehicular edge computing
Vehicle Edge Computing improves the Quality of Service of vehicular applications by offloading tasks to the VEC server. However, with the continuous development of computation-intensive vehicular applications, the limited resources of the VEC server will not be enough to support these applications. Volunteer Computing-Based Vehicular Ad-hoc Networking (VCBV) proposes a concept of using vehicles as resources, which is considered to be a promising solution. In this paper, we study the multi-dependent task offloading problem in order to quickly and economically handle the overload task of the requesting vehicle in VCBV. Considering both task execution delay and execution cost, we formulate the problem of offloading the multi-dependent tasks of requesting vehicles to minimize total task completion time and execution cost. Since the offloading problem is NP-hard, an improved multi-objective Ant Colony Optimization algorithm is proposed. Firstly, we use a density-based clustering algorithm to form volunteer alliances that can contribute idle resources. Secondly, based on the volunteer alliances and RSUs, we use Analytic Hierarchy Process (AHP) to initialize pheromone concentration to make better decisions. Then, we design the update strategy of the pheromone concentration and heuristic information. Finally, we introduce Pareto optimal relationship to evaluate the results. A large number of simulation results verify that our algorithm has better performance than other alternatives.
期刊介绍:
Vehicular communications is a growing area of communications between vehicles and including roadside communication infrastructure. Advances in wireless communications are making possible sharing of information through real time communications between vehicles and infrastructure. This has led to applications to increase safety of vehicles and communication between passengers and the Internet. Standardization efforts on vehicular communication are also underway to make vehicular transportation safer, greener and easier.
The aim of the journal is to publish high quality peer–reviewed papers in the area of vehicular communications. The scope encompasses all types of communications involving vehicles, including vehicle–to–vehicle and vehicle–to–infrastructure. The scope includes (but not limited to) the following topics related to vehicular communications:
Vehicle to vehicle and vehicle to infrastructure communications
Channel modelling, modulating and coding
Congestion Control and scalability issues
Protocol design, testing and verification
Routing in vehicular networks
Security issues and countermeasures
Deployment and field testing
Reducing energy consumption and enhancing safety of vehicles
Wireless in–car networks
Data collection and dissemination methods
Mobility and handover issues
Safety and driver assistance applications
UAV
Underwater communications
Autonomous cooperative driving
Social networks
Internet of vehicles
Standardization of protocols.