Publication | Closed Access
A Novel Distributed Task Scheduling Framework for Supporting Vehicular Edge Intelligence
26
Citations
28
References
2022
Year
Vehicle CommunicationInternet Of VehicleEngineeringIntelligent SystemsVehicular Edge IntelligenceSystems EngineeringVehicle NetworkInternet Of ThingsTransportation EngineeringTraffic EfficiencyTransportation SystemsEdge IntelligenceComputer EngineeringMobile ComputingComputer ScienceEdge ArchitectureEdge ComputingCloud ComputingBusinessMulti-access Edge ComputingOnline TaskEdge Artificial IntelligenceStorage Capacity
In recent years, data-driven intelligent transportation systems (ITS) have developed rapidly and brought various AI-assisted applications to improve traffic efficiency. However, these applications are constrained by their inherent high computing demand and the limitation of vehicular computing power. Vehicular edge computing (VEC) has shown great potential to support these applications by providing computing and storage capacity in close proximity. For facing the heterogeneous nature of in-vehicle applications and the highly dynamic network topology in the Internet-of-Vehicle (IoV) environment, how to achieve efficient scheduling of computational tasks is a critical problem. Accordingly, we design a two-layer distributed online task scheduling framework to maximize the task acceptance ratio (TAR) under various QoS requirements when facing unbalanced task distribution. Briefly, we implement the computation offloading and transmission scheduling policies for the vehicles to optimize the onboard computational task scheduling. Meanwhile, in the edge computing layer, a new distributed task dispatching policy is developed to maximize the utilization of system computing power and minimize the data transmission delay caused by vehicle motion. Through single-vehicle and multi-vehicle simulations, we evaluate the performance of our framework, and the experimental results show that our method outperforms the state-of-the-art algorithms. Moreover, we conduct ablation experiments to validate the effectiveness of our core algorithms.
| Year | Citations | |
|---|---|---|
Page 1
Page 1