English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper we present a graph-based resource allocation scheme forsidelink broadcast vehicle-to-vehicle (V2V) communications. Harnessingavailable information on the geographical position of vehicles and spectrumresources utilization, eNodeBs are capable of allotting the same set ofsidelink resources to several different vehicles in order for them to broadcasttheir signals. Hence, vehicles sharing the same resources would ideally be indifferent communications clusters for the interference level-generated due toresource repurposing-to be maintained under control. Within a communicationscluster, it is crucial that vehicles transmit in orthogonal time resources toprevent conflicts as vehicles-with half-duplex radio interfaces--cannottransmit and receive simultaneously. In this research, we have envisaged asolution based on a bipartite graph, where vehicles and spectrum resources arerepresented by vertices whereas the edges represent the achievable rate in eachresource based on the signal-to-interference-plus-noise ratio (SINR) thatvehicles perceive. The aforementioned constraint on time orthogonality ofallocated resources can be approached by aggregating conflicting vertices intomacro-vertices which, in addition, narrows the search space yielding a solutionwith computational complexity equivalent to the conventional graph matchingproblem. We show mathematically and through simulations that the proposedapproach yields an optimal solution. In addition, we provide simulationsshowing that the proposed method outperforms other competing approaches,specially in scenarios with high vehicular density.

Graph-Based Resource Allocation with Conflict Avoidance for V2V Broadcast Communications