基于D2D通信的V2X资源分配方案-北京邮电大学学报.PDF

2017年10月 北 京 邮 电 大 学 学 报 Oct.2017 第40卷 第5期 Journal of Beijing University of Posts and Telecommunications Vol.40 No.5 摇 摇 文章编号:1007鄄5321(2017)05鄄0092鄄06 DOI:10.13190/ j.jbupt.2017鄄039 基于D2D通信的V2X资源分配方案 张海波,摇 向摇 煜,摇 刘开健,摇 陈善学 (重庆邮电大学 移动通信技术重庆市重点实验室,重庆400065) 摘要:针对基于设备到设备(D2D)的汽车间通信复用蜂窝资源带来的干扰问题,考虑在满足车辆用户(V鄄UEs)的 通信要求下,通过一个启发式算法最大化蜂窝用户(C鄄UEs)总的吞吐量. 首先通过图着色原理将没有干扰的车辆 分在同一簇;其次根据分簇结果,利用改进的匈牙利指派算法为V鄄UEs分配信道;最后通过调整功率最大化C鄄UEs 总的吞吐量. 仿真结果表明,此算法能够很好地解决车通信(V2X)的同层干扰和跨层干扰问题,在保证V鄄UEs通 信可靠性的前提下,提高了频谱利用率. 关摇 键摇 词:车通信;设备到设备;资源分配;图着色;指派算法 中图分类号:TN929郾5摇 摇 摇 摇 文献标志码:A V2X Resource Allocation Scheme Based on D2D Communication ZHANG Hai鄄bo,摇 XIANG Yu,摇 LIU Kai鄄jian,摇 CHEN Shan鄄xue (Chongqing Key Laboratory of Mobile CommunicationsTechnology,Chongqing University of Posts and Telecommunications,Chongqing400065,China) Abstract:Large amount of interference,dueto sharethe cellular networkresources,existsin device鄄to鄄 device (D2D) based vehicular communication systemwith heavy load. A heuristic algorithm isproposed to maximizethetotalthroughputof cellular鄄users (C鄄UEs)whilemeetingtheminimumsecuritycommuni鄄 cation requirements of vehicular鄄users (V鄄UEs) at the same time. Firstly,the vehicles without interfer鄄 ence are divided into the same cluster by principle of graph coloring. Secondly,according to the cluste鄄 ring results,the improved Hungarian assignment algorithm is used to allocate the channel. Finally,the power is adjusted to maximize total throughput of C鄄UEs. Simulations show that the proposed algorithm can effectively solve the vehicle鄄to鄄everything (V2X) co鄄layer and cross鄄layer interference problem,and improve the sp