Abstract:
Vehicular fog computing (VFC) has emerged as a cost-efficient solution for task processing in vehicular networks. However, how to realize stable and reliable task offload...Show MoreMetadata
Abstract:
Vehicular fog computing (VFC) has emerged as a cost-efficient solution for task processing in vehicular networks. However, how to realize stable and reliable task offloading under information uncertainty remains a critical challenge. In this paper, we propose a matching-learning-based task offloading algorithm to address this challenge. First, a low-complexity and stable task offloading mechanism is proposed to minimize the total network delay based on the pricing-based matching. Second, we extend the work to the scenario of information uncertainty, and develop a matching-learning-based task offloading algorithm by combining matching theory and upper confidence bound (UCB) algorithm. Simulation results demonstrate that the proposed algorithm can achieve bounded deviation from the optimal performance without the global information.
Date of Conference: 24-28 June 2019
Date Added to IEEE Xplore: 22 July 2019
ISBN Information: