Graph-Based Resource Sharing in Vehicular Communication
Graph-Based Resource Sharing in Vehicular Communication
复制标题
DOI：
10.1109/twc.2018.2827958
复制
发表时间：
2018-07-01
影响因子：
10.4
通讯作者：
Yu, Xingxing
中科院分区：
文献类型：
--
作者：
Liang, Le;Xie, Shijie;Yu, Xingxing
本文基于信道状态信息（CSI）的慢衰落统计，研究基于设备到设备的车载通信中的资源分配问题，以减轻报告移动链路快速变化的精确CSI的信令开销。我们考虑每个车到基础设施（V2I）链路与多个车到车（V2V）链路共享频谱的情况。利用移动链路的慢衰落统计CSI，我们在保证所有V2V链路可靠性的同时最大化V2I总容量。我们使用图划分工具将干扰严重的V2V链路划分为不同的簇，然后将频谱共享问题表述为加权三维匹配问题。我们提出了一套算法，包括基于图的基线资源分配算法、贪心资源分配算法和随机资源分配算法，以解决性能 - 复杂度的权衡问题。我们进一步研究了针对所有车载链路的慢衰落CSI的资源分配自适应，并开发了一种低复杂度的随机算法。
This paper investigates the resource allocation problem in device-to-device-based vehicular communications, based on slow fading statistics of channel state information (CSI), to alleviate signaling overhead for reporting rapidly varying accurate CSI of mobile links. We consider the case when each vehicle-to-infrastructure (V2I) link shares spectrum with multiple vehicle-to-vehicle (V2V) links. Leveraging the slow fading statistical CSI of mobile links, we maximize the sum V2I capacity while guaranteeing the reliability of all V2V links. We use graph partitioning tools to divide highly interfering V2V links into different clusters before formulating the spectrum sharing problem as a weighted 3-D matching problem. We propose a suite of algorithms, including a baseline graph-based resource allocation algorithm, a greedy resource allocation algorithm, and a randomized resource allocation algorithm, to address the performance-complexity tradeoffs. We further investigate resource allocation adaption in response to slow fading CSI of all vehicular links and develop a low-complexity randomized algorithm.