Research Area:  Fog Computing

Abstract:

Vehicular fog computing has emerged as a cost-efficient solution for task processing in vehicular networks. However, how to realize effective server recruitment and reliable task offloading under information asymmetry and uncertainty remains a critical challenge. In this paper, we adopt a two-stage task offloading framework to address this challenge. First, we propose a convex-concave-procedure-based contract optimization algorithm for server recruitment, which aims to maximize the expected utility of the operator with asymmetric information. Then, a low-complexity and stable task offloading mechanism is proposed to minimize the total network delay based on the pricing-based matching. Furthermore, we extend the work to the scenario of information uncertainty and develop a matching-learning-based task offloading mechanism, which takes both occurrence awareness and conflict awareness into consideration. Simulation results demonstrate that the proposed algorithm can effectively motivate resource sharing and guarantee bounded deviation from the optimal performance without the global information.

Keywords:  

Author(s) Name:  Zhenyu Zhou; Haijun Liao; Xiongwen Zhao; Bo Ai; Mohsen Guizani

Publisher name:  IEEE

DOI:  10.1109/TVT.2019.2926732

Volume Information:  Volume: 68, Issue: 9, Sept. 2019, Page(s): 8322 - 8335

Paper Link:   https://ieeexplore.ieee.org/document/8755474