北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2017, Vol. 40 ›› Issue (5): 92-97.doi: 10.13190/j.jbupt.2017-039

• 研究报告 • 上一篇    下一篇

基于D2D通信的V2X资源分配方案

张海波, 向煜, 刘开健, 陈善学   

  1. 重庆邮电大学 移动通信技术重庆市重点实验室, 重庆 400065
  • 收稿日期:2017-03-23 出版日期:2017-10-28 发布日期:2017-11-21
  • 作者简介:张海波(1979-),男,副教授,E-mail:zhanghb@cqupt.edu.cn.
  • 基金资助:
    国家自然科学基金项目(61601071,61301122);长江学者和创新团队发展计划基金项目(IRT16R72);重庆市教委科学技术研究项目(KJ16004012)

V2X Resource Allocation Scheme Based on D2D Communication

ZHANG Hai-bo, XIANG Yu, LIU Kai-jian, CHEN Shan-xue   

  1. Chongqing Key Laboratory of Mobile Communications Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
  • Received:2017-03-23 Online:2017-10-28 Published:2017-11-21

摘要: 针对基于设备到设备(D2D)的汽车间通信复用蜂窝资源带来的干扰问题,考虑在满足车辆用户(V-UEs)的通信要求下,通过一个启发式算法最大化蜂窝用户(C-UEs)总的吞吐量.首先通过图着色原理将没有干扰的车辆分在同一簇;其次根据分簇结果,利用改进的匈牙利指派算法为V-UEs分配信道;最后通过调整功率最大化C-UEs总的吞吐量.仿真结果表明,此算法能够很好地解决车通信(V2X)的同层干扰和跨层干扰问题,在保证V-UEs通信可靠性的前提下,提高了频谱利用率.

关键词: 车通信, 设备到设备, 资源分配, 图着色, 指派算法

Abstract: Large amount of interference, due to share the cellular network resources, exists in device-to-device (D2D) based vehicular communication system with heavy load. A heuristic algorithm is proposed to maximize the total throughput of cellular-users (C-UEs) while meeting the minimum security communication requirements of vehicular-users (V-UEs) at the same time. Firstly, the vehicles without interference are divided into the same cluster by principle of graph coloring. Secondly, according to the clustering 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 spectrum utilization so as to ensure the reliability of V-UEs communication.

Key words: vehicle-to-everything, device-to-device, resource allocation, graph coloring, assignment algorithm

中图分类号: