基于图着色和三维匹配的车联网资源分配算法  

Resource allocation algorithm for internet of vehicles based on graph coloring and three-dimensional matching

作　　者：许耀华[1] 王慧平 王贵竹[1] 朱成龙 丁梦琴 蒋芳[1] 王翊[1] XU Yaohua;WANG Huiping;WANG Guizhu;ZHU Chenglong;DING Mengqin;JIANG Fang;WANG Yi(School of Integrated Circuits,Anhui University,Hefei 230601,China)

机构地区：[1]安徽大学集成电路学院,安徽合肥230601

出　　处：《系统工程与电子技术》2023年第3期869-875,共7页Systems Engineering and Electronics

基　　金：安徽省高校协同创新项目(GXXT-2022-080)资助课题。

摘　　要：车联网通信通过多个车辆对车辆(vehicle to vehicle,V2V)链路复用同一车辆对基础设施(vehicle to infrastructure,V2I)链路的资源来缓解频谱短缺问题,但频谱复用会导致V2I通信服务质量下降,因此降低系统干扰、提高系统容量成为研究热点。提出一种基于图着色和三维匹配的车联网资源分配算法,首先用图着色法对V2V链路分簇,然后求解V2I链路和V2V链路的发射功率,最后通过三维匹配算法对V2I链路、V2V簇和资源块进行信道资源的优化分配,从而降低使用同一资源的链路之间的干扰。理论分析及仿真结果表明,所提方法提高了V2I链路总和速率,并在相对较少的迭代次数下收敛到次优解。The internet of vehicles communications alleviate spectrum shortages by multiplexing the resources of the same vehicle to infrastructure(V2I)links with multiple vehicle to vehicle(V2V)links,but spectrum reuse can cause degradation of V2I communication service quality,so reducing system interference and increasing system capacity has become a hot research topic.A resource allocation algorithm for the internet of vehicles based on graph coloring and three-dimensional matching is proposed.Firstly,the V2V links are clustered by graph coloring,then the transmit power of the V2I links and V2V links are solved,and finally the channel resources are optimally allocated by a three-dimensional matching algorithm for V2I links,V2V clusters and resource blocks,for reducing the interference between links using the same resource.Theoretical analysis and simulation result show that the proposed method improves the sum rate of V2I links and converges to a suboptimal solution with a relatively small number of iterations.

关 键 词：资源分配 频谱复用 图着色 三维匹配 

分 类 号：TN929.5[电子电信—通信与信息系统]