Graph-Based Radio Resource Management for Vehicular Networks
Graph-Based Radio Resource Management for Vehicular Networks
复制标题
DOI：
10.1109/icc.2018.8422585
复制
发表时间：
2018-01
期刊：
影响因子：
--
通讯作者：
Le Liang;Shijie Xie;Geoffrey Y. Li;Z. Ding;Xingxing Yu
中科院分区：
文献类型：
--
作者：
Le Liang;Shijie Xie;Geoffrey Y. Li;Z. Ding;Xingxing Yu
本文基于信道状态信息（CSI）的慢衰落统计，研究了基于设备到设备（D2D）的车辆通信中的资源分配问题，以减少报告移动链路快速变化的精确CSI所带来的信令开销。我们考虑每个车到基础设施（V2I）链路与多个车到车（V2V）链路共享频谱的情况。利用移动链路的慢衰落统计CSI，我们在保证所有V2V链路可靠性的同时最大化V2I链路的总容量。我们提出了一种基于图的算法，该算法使用图划分工具将干扰严重的V2V链路划分为不同的簇，然后将频谱共享问题表述为一个加权三维匹配问题，再通过采用一种高性能近似算法来解决该问题。
This paper investigates the resource allocation problem in device-to-device (D2D)-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 propose a graph- based algorithm that uses graph partitioning tools to divide highly interfering V2V links into different clusters before formulating the spectrum sharing problem as a weighted 3-dimensional matching problem, which is then solved through adapting a high-performance approximation algorithm.