Abstract
With the rapid development of Artificial Intelligence (AI) and the Internet of Vehicles (IoV), there is an increasing demand for deploying various intelligent applications on vehicles. Vehicular Edge Computing (VEC) is receiving extensive attention from both the industry and academia due to its benefits from the edge computing paradigm, which pushes computing tasks from the core of the network to the edge of the network. However, in the VEC environment considering vehicles to Road Side Units (RSUs), due to the mobility of vehicles, it is still a challenge to make dynamic and efficient offloading decisions for compute-intensive tasks, especially in the congestion situation. In order to minimize the total delay and waiting time of tasks from moving vehicles, we establish a dynamic offloading model for multiple moving vehicles whose tasks can be divided into sequential subtasks, so that the offloading decisions are more refined. Moreover, the proposed model is frame-based to avoid unnecessary waiting time, which makes offloading decisions when the subtasks of each vehicle are generated rather than offloading subtasks after gathering subtasks of vehicles for a time slot. Aiming to find the optimal offloading decision for sequential subtasks, we propose a Dynamic Framing Offloading algorithm based on Double Deep Q-Network (DFO-DDQN). Extensive experimental results demonstrate the effectiveness and superiority of the proposed DFO-DDQN when compared with other DRL-based methods and greedy-based methods.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEE Transactions on Network Science and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.