Quality-Aware Task Offloading for Cooperative Perception in Vehicular Edge Computing

被引:2
作者
Zaki, Amr M. [1 ]
Elsayed, Sara A. [1 ]
Elgazzar, Khalid [2 ]
Hassanein, Hossam S. [1 ]
机构
[1] Queens Univ, Kingston, ON K7L 2N8, Canada
[2] Ontario Tech Univ, Oshawa, ON L1G 0C5, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Task analysis; Delays; Redundancy; Quality of service; Runtime; Edge computing; Wireless communication; Autonomous vehicles; vehicular edge computing; cooperative perception; task offloading; ALGORITHM;
D O I
10.1109/TVT.2024.3444591
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Task offloading in Vehicular Edge Computing (VEC) can advance cooperative perception (CP) to improve traffic awareness in Autonomous Vehicles. In this paper, we propose the Quality-aware Cooperative Perception Task Offloading (Q-CPTO) scheme. Q-CPTO is the first task offloading scheme that enhances traffic awareness by prioritizing the quality rather than the quantity of cooperative perception. Q-CPTO improves the quality of CP by curtailing perception redundancy and increasing the Value of Information (VOI) procured by each user. We use Kalman filters (KFs) for VOI assessment, predicting the next movement of each vehicle to estimate its region of interest. The estimated VOI is then integrated into the task offloading problem. We formulate the task offloading problem as an Integer Linear Program (ILP) that maximizes the VOI of users and reduces perception redundancy by leveraging the spatially diverse fields of view (FOVs) of vehicles, while adhering to strict latency requirements. We also propose the Q-CPTO-Heuristic (Q-CPTO-H) scheme to solve the task offloading problem in a time-efficient manner. Extensive evaluations show that Q-CPTO significantly outperforms prominent task offloading schemes by up to 14% and 20% in terms of response delay and traffic awareness, respectively. Furthermore, Q-CPTO-H closely approaches the optimal solution, with marginal gaps of up to 1.4% and 2.1% in terms of traffic awareness and the number of collaborating users, respectively, while reducing the runtime by up to 84%.
引用
收藏
页码:18320 / 18332
页数:13
相关论文
共 36 条
[1]   Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem [J].
Aider, Meziane ;
Gacem, Oussama ;
Hifi, Mhand .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2022, 73 (03) :540-557
[2]   Feedbackless Relaying for Enhancing Reliability of Connected Vehicles [J].
Ali, G. G. Md. Nawaz ;
Ayalew, Beshah ;
Vahidi, Ardalan ;
Noor-A-Rahim, Md. .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2020, 69 (05) :4621-4634
[3]   Cooperative Perception for 3D Object Detection in Driving Scenarios Using Infrastructure Sensors [J].
Arnold, Eduardo ;
Dianati, Mehrdad ;
de Temple, Robert ;
Fallah, Saber .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2022, 23 (03) :1852-1864
[4]  
Behrisch M., 2011, SUMO SIMULATION URBA
[5]   An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem [J].
Billionnet, A ;
Soutif, T .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 157 (03) :565-575
[6]  
Business-Wire, Intel editorial: For self-driving cars, there's big meaning behind one big number: 4 terabytes
[7]   Delay-Optimized V2V-Based Computation Offloading in Urban Vehicular Edge Computing and Networks [J].
Chen, Chen ;
Chen, Lanlan ;
Liu, Lei ;
He, Shunfan ;
Yuan, Xiaoming ;
Lan, Dapeng ;
Chen, Zhuang .
IEEE ACCESS, 2020, 8 :18863-18873
[8]   Task Offloading for Mobile Edge Computing in Software Defined Ultra-Dense Network [J].
Chen, Min ;
Hao, Yixue .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2018, 36 (03) :587-597
[9]   F-Cooper: Feature based Cooperative Perception for Autonomous Vehicle Edge Computing System Using 3D Point Clouds [J].
Chen, Qi ;
Ma, Xu ;
Tang, Sihai ;
Guo, Jingda ;
Yang, Qing ;
Fu, Song .
SEC'19: PROCEEDINGS OF THE 4TH ACM/IEEE SYMPOSIUM ON EDGE COMPUTING, 2019, :88-100
[10]   Efficient Multi-User Computation Offloading for Mobile-Edge Cloud Computing [J].
Chen, Xu ;
Jiao, Lei ;
Li, Wenzhong ;
Fu, Xiaoming .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2016, 24 (05) :2827-2840