Resource Allocation Algorithms of Vehicle Networks with Stackelberg Game

With the emergence and development of the Internet of Vehicles (IoV), higher demands are placed on the response speed and ultra-low delay of the vehicle. Cloud computing services are not friendly to reducing latency and response time. Mobile Edge Computing (MEC) is a promising solution to this problem. In this paper, we introduce MEC into the IoV to propose a specific vehicle edge resource management framework, which consists of fog nodes (FN), data service agents (DSA), and cars. We proposed a dynamic service area partitioning algorithm that enables the DSA to adjust the service area and provide a more efficient service for the vehicle. A resource allocation framework based on Stackelberg game model is proposed to analyze the pricing problem of FN and data resource strategy of DSA. We use the distributed iterative algorithm to solve the problem of game equilibrium. Our proposed resource management framework is finally verified by numerical results, which show that the allocation efficiency of FN resources among the cars is ensured, and we also get a subgame perfect nash equilibrium.