基于超图划分的车联网V2I/V2V资源共享机制研究

Research on Resource-Sharing Mechanism of Vehicular Network V2I/V2V Based on Hypergraph Partition

  • 摘要: 针对车联网V2I/V2V用户异构性需求以及V2V用户复用V2I链路引起的复杂干扰,本文基于超图划分的思想,提出了预先V2V用户分簇、允许接入多V2I链路的资源共享机制。首先,在被动簇集模型基础上依赖车辆节点干扰强度将车辆划分为不同的簇,从而减少了同簇车辆节点的相互干扰;然后,通过最大化V2I总吞吐量来设计车辆节点的最佳功率;最后,利用3维匹配算法完成基站、资源块和车辆节点三者之间的匹配。仿真结果表明,所提机制满足V2V链路可靠性,同时使得V2I链路总吞吐量最大,分析结论为智能交通中车联网通信应用提供了理论参考。

     

    Abstract: For the heterogeneous requirement of Vehicle-to-Vehicle (V2V) user equipment and Vehicle-to-Infrastructure (V2I) user equipment, and the complex interference is caused by V2V user equipment reuses V2I link. Based on the theory of hypergraph partitioning, a resource sharing mechanism is proposed, which utilizes prior V2V users clustering and allows access to multiple V2I link. Firstly, depending on passive cluster model, vehicle nodes are divided into different clusters relying on the interference intensity of vehicle nodes, so as to reduce the mutual interference of vehicle nodes in the same cluster. Then, the optimal power allocation of the vehicle node is designed by maximizing the total throughput of V2I links. Finally, 3D-matching algorithm is used to achieve the associations among base stations, resource blocks and vehicle nodes. Simulation results show that the proposed mechanism satisfies the reliability of V2V link and maximizes the total throughput of V2I link, and the conclusion of the analysis provides a theoretical reference for the Internet of Things (IoT) applications in intelligent transportation systems.

     

/

返回文章
返回