Mobility-Aware Multi-Hop Task Offloading for Autonomous Driving in Vehicular Edge Computing and Networks

Vehicular Edge Computing (VEC) has gained increasing interest due to its potential to provide low latency and reduce the load in backhaul networks. In order to meet drastically increasing computation demands from emerging ever-growing vehicular applications, e.g., autonomous driving, abundant comput...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on intelligent transportation systems Vol. 24; no. 2; pp. 2169 - 2182
Main Authors Liu, Lei, Zhao, Ming, Yu, Miao, Jan, Mian Ahmad, Lan, Dapeng, Taherkordi, Amirhosein
Format Journal Article
LanguageEnglish
Published New York IEEE 01.02.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Vehicular Edge Computing (VEC) has gained increasing interest due to its potential to provide low latency and reduce the load in backhaul networks. In order to meet drastically increasing computation demands from emerging ever-growing vehicular applications, e.g., autonomous driving, abundant computation resources of individual vehicles can play a crucial role in task execution in a VEC scenario, that can further contribute in considerably improving user experience. This is however an extremely challenging task due to high mobility of vehicles that can easily lead to intermittent connectivity, thereby disrupting on-going task processing. In this paper, we propose a task offloading scheme by exploiting multi-hop vehicle computation resources in VEC based on mobility analysis of vehicles. In addition to the vehicles within one hop from the task vehicle that generates computation tasks, certain multi-hop vehicles that meet the given requirements in terms of link connectivity and computation capacity, are also leveraged to carry out the tasks offloaded by the task vehicle. An optimization problem is formulated for the task vehicle to minimize the weighted sum of execution time and computation cost of all tasks. A semidefinite relaxation approach with an adaptive adjustment procedure is proposed to solve the formulated optimization problem for obtaining the corresponding offloading decisions. The simulation results show that our proposed offloading scheme can achieve significant improvement in terms of response delay by at least 34% compared with the other algorithms (e.g., local processing and random offloading).
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1524-9050
1558-0016
DOI:10.1109/TITS.2022.3142566