A Graph-Based Resource Sharing and Admission Control for Vehicular Networks

As The 3rd Generation Partnership Project(3GPP) introduces sidelink in Release 12, which enables communication between device and device (D2D) without going through the eNB, D2D-based vehicle-to-everything(V2X) communication has drawn more and more attention. Particularly, vehicle-to-vehicle(V2V) communication has attracted extensive research both in academy and industry, which is believed to have great potential to reduce traffic congestion and accidents. V2V communication has stringent requirements on latency and access availability. In this paper, we study the joint admission control and resource allocation problem in V2V networks with the objective to maximize the number of concurrent V2V transmissions, where we classify vehicles users as safety V-UEs and non-safety V-UEs. Firstly, we construct the conflict graph based on the interference relations of vehicles. And then we model the problem as a graph coloring problem(GCP), which is an NP-complete problem. Finally, a resource sharing and admission control(RSAC) algorithm is proposed to solve this problem. Simulation results shows that the proposed algorithm outperforms the existing scheme in terms of both throughput and capacity performance.