A Fast and Effective Graph-Based Resource Allocation and Power Control Scheme in Vehicular Network Slicing

The concept of network slicing will play an important role in network architecture for the foreseeable future since it is able to handle a wide range of scenarios. However, given the changing traffic demands and mobility in vehicular networks, determining how to efficiently assign the network resources to the vehicular users in order to provide steady quality of service (QoS) for connected vehicles with specific slices remains a difficulty. In this paper, we propose a fast and efficient method to address an optimal algorithm based on graph theory to achieve QoS requirements for different types of links, i.e., high capacity for vehicle-to-infrastructure (V2I) links and ultra reliability for vehicle-to-vehicle (V2V) links. The goal was to maximize the sum rate of V2I connections while ensuring reliability guarantee for each V2V link. Our first and optimal algorithm constructs the assignment graph in accordance with specific requirements of the association of vehicle users and solves the maximum clique problem for discovering the valid connections in the network, then optimally calculates the transmitting power of the users. While optimal, this algorithm has performance issues. Hence, a second algorithm is proposed that utilizes a heuristic approach to address the issue.