Efficient approaches for task offloading in point-of-interest based vehicular fog computing

The Journal of Supercomputing(2023)

引用 0|浏览0
暂无评分
摘要
Vehicular fog computing (VFC), as the extension of the mobile cloud, has been widely investigated. However, in most existing VFC works, the scenario with point-of-interests (PoIs) is rarely considered, which can lead to underutilization of vehicle computing resources and overloading of the computing load for roadside units (RSUs). Therefore, this paper focuses on improving the quality of services for PoI-based VFC by utilizing the computation capabilities of vehicles to assist the RSU. An NP-hard problem is formulated to maximize the number of tasks completed within the duration of delay constraints. To solve the problem, a delay-aware task offloading algorithm, named Delay-Aware Task Offloading (DTO), is proposed. DTO preferentially operates on tasks with tighter delay constraints. To minimize the completion delay for each offloaded task, DTO selects the set of service vehicles to perform tasks. Moreover, a vehicle-resource-aware task offloading algorithm, named Vehicle-Resources-Aware Task Offloading (VRTO), is proposed to maximize the number of tasks completed within the duration of delay constraints by efficiently utilizing the available resource of the vehicle. Specifically, VRTO allocates the data to each service vehicle according to the service configuration of vehicles and the delay constraints of tasks. Finally, extensive experiments are carried out to evaluate the effectiveness of the proposed algorithms. The performance is successfully improved by more than 30% compared with the baselines in terms of the number of completed tasks.
更多
查看译文
关键词
Vehicular fog computing,Point of interest,Task offloading,Delay constraints
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要