Secure, Resilient and Stable Resource Allocation for D2D-based V2X Communication

Device-to-device (D2D) communication has been utilized in Vehicle-to-Everything (V2X) communication in order to reuse the cellular network resources and increase spectrum efficiency. Existing works however focus on the maximization of throughput solely without considering the security of channels as well as the resilience of the D2D communication. To address that, in this paper, we study the resource allocation problem between the D2D communicating pairs and regular cellular users in a vehicular network. We consider assignment of D2D pairs to both more secure cellular user channels and more than one channel for resilience. We model the problem as a resource allocation problem between competing parties with their own preferences and leverage Stable Matching Theory to obtain a satisfying matching for all involved parties. As existing algorithms that find stable matching do not work for such quota-based systems with multiple level preferences (e.g., secure channel first), we first develop an Integer Linear Programming (ILP) based optimal solution and propose a heuristic based polynomial algorithm that runs much faster than ILP solution. Through simulations, we show that the heuristic based algorithm provides close to optimal results with a much lower complexity and outperforms the existing solutions.