海报：车辆侧链路广播通信的资源分配与冲突解决
Poster: Resource Allocation with Conflict Resolution for Vehicular Sidelink Broadcast Communications
摘要：
在本文中，我们提出了一种基于图的资源分配方案的侧链路广播V2V通信。利用关于车辆的地理位置和频谱资源利用的可用信息，eNodeB能够将相同的侧链路资源集合分配给分布在若干通信集群中的不同车辆。在通信集群内，防止时域分配冲突是至关重要的，因为车辆不能同时发送和接收，即，它们必须在正交的时间资源中发送。在这项研究中，我们提出了一个解决方案的基础上的二分图，其中车辆和频谱资源表示的顶点，而边缘表示在每个资源的基础上的SINR，每个车辆感知的可实现的速率。上述时间正交性约束可以通过将冲突顶点聚合成宏顶点来接近，这另外降低了搜索复杂度。我们通过数学和模拟表明，所提出的方法产生一个最佳的解决方案。此外，我们提供的模拟表明，该方法优于其他竞争的方法，特别是在高车辆密度的情况下。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
