Digitally Annealed Solution for the Maximum Clique Problem with Critical Application in Cellular V2X

Cellular V2X, the “Vehicle to Everything” standard, defines a framework for practically feasible information exchange among vehicles and other network entities. This interaction is proved to bring in substantial economic and ecological benefits. LTE V2X uses a portion of uplink frame as a resource pool and in the main mode, relies on a central scheduler for allocating these resources to the users. As an important resource management problem, besides the optimal resource scheduling, finding a proper lower bound for required resources in this mode is NP-hard. Network management entities and service providers require this lower bound to determine the minimum size of the uplink frame slice to be allocated to the V2X resource pool. In this paper, we take advantage of Digital Annealer potentials to target this problem at a new size range with considerably enhanced level of optimality that has not been achievable so far due to computational complexities. The Digital Annealer enables us to find the minimum required size of the V2X slice in the uplink frame with high speed through our maximum clique and minimum cover graph theoretic formulations of this problem. Our approach considerably enhances performance compared to its closest alternatives in the literature.