Resource Allocation in C-V2X Mode 3 Based on the Exchanged Preference Profiles

Abstract

In this paper, we investigate the resource block (RB) allocation problem in cellular vehicle-to-everything (C-V2X) networks mode 3, where the cellular networks schedule the RBs for direct vehicular communications. First, we establish the communication model and introduce the effective capacity and queuing theory to describe the reliability of vehicle-to-vehicle (V2V) links. Then, we introduce the α-fair function and formulate the joint power control and RB allocation problem considering the allocation fairness and the different quality-of-service (QoS) requirements for vehicle-to-infrastructure (V2I) and V2V links. Our objective is to maximize the sum capacity of all V2I links with the α-fair function while guaranteeing the allocation fairness among V2I links and the transmission reliability for each V2V pair. To achieve this objective, we propose a novel matching game theory algorithm based on the exchanged preference profiles between the two participant sets, i.e., V2V and V2I links. Simulation results show that our proposed algorithm is adaptive to the dynamic vehicular network and achieves better efficiency and fairness trade-offs, outperforming the classic allocation method.