Slice Freshness Guaranteed Resource Allocation in Vehicular Networks

Network slicing is becoming an effective solution to meet the heterogeneous quality of service (QoS) requirements in internet of vehicles (IoV). Caused by these, the coupling effect of intra- and inter-slice resource allocation have brought great challenges to IoV.To this end, the intra- and inter-slice resource allocation problems are formulated as hierarchical optimization problem. Further, we propose an one leader and two followers resource allocation (OL-TFRA) algorithm based on Stackelberg game. Firstly, the bandwidth ratio of eMBB slice is determined by the bisection method, then the optimal strategy of inter-slice resource allocation is derived through the leader-follower game. The algorithm identifies the existence and uniqueness of the Stackelberg equilibrium, and takes the equilibrium point as the optimal result of inter- and intra-slice resource allocation. Simulation results reveal the interaction of different slices per-formance. Compared with the exhaustive search algorithm, the proposed algorithm converges faster than the exhaustive search algorithm with 2% utility decreases.