Resource allocation algorithm for internet of vehicles based on graph coloring and three-dimensional matching

Abstract

The internet of vehicles communications alleviate spectrum shortages by multiplexing the resources of the same vehicle to infrastructure (V2I) links with multiple vehicle to vehicle (V2V) links, but spectrum reuse can cause degradation of V2I communication service quality, so reducing system interference and increasing system capacity has become a hot research topic. A resource allocation algorithm for the internet of vehicles based on graph coloring and three-dimensional matching is proposed. Firstly, the V2V links are clustered by graph coloring, then the transmit power of the V2I links and V2V links are solved, and finally the channel resources are optimally allocated by a three-dimensional matching algorithm for V2I links, V2V clusters and resource blocks, for reducing the interference between links using the same resource. Theoretical analysis and simulation result show that the proposed method improves the sum rate of V2I links and converges to a suboptimal solution with a relatively small number of iterations.