Poster: Resource Allocation with Conflict Resolution for Vehicular Sidelink Broadcast Communications

TL;DR

This paper introduces a graph-based resource allocation method for vehicular sidelink broadcast communications that effectively manages conflicts and improves performance in dense traffic scenarios.

Contribution

It presents a novel bipartite graph approach that accounts for time orthogonality and reduces complexity, outperforming existing methods in high-density vehicular environments.

Findings

The proposed method achieves optimal resource allocation.

It outperforms competing approaches in dense scenarios.

The approach reduces search complexity through macro-vertices.

Abstract

In this paper we present a graph-based resource allocation scheme for sidelink broadcast V2V communications. Harnessing available information on geographical position of vehicles and spectrum resources utilization, eNodeBs are capable of allotting the same set of sidelink resources to different vehicles distributed among several communications clusters. Within a communications cluster, it is crucial to prevent time-domain allocation conflicts since vehicles cannot transmit and receive simultaneously, i.e., they must transmit in orthogonal time resources. In this research, we present a solution based on a bipartite graph, where vehicles and spectrum resources are represented by vertices whereas the edges represent the achievable rate in each resource based on the SINR that each vehicle perceives. The aforementioned time orthogonality constraint can be approached by aggregating conflicting vertices into macro-vertices which, in addition, reduces the search complexity. We show mathematically and through simulations that the proposed approach yields an optimal solution. In addition, we provide simulations showing that the proposed method outperforms other competing approaches, specially in scenarios with high vehicular density.