基于社交网络结合贪心策略的车辆D2D通信中继选择算法  

Relay Selection Algorithm Based on Social Network Combined with Greedy Strategy for Vehicle D2D Communication

作　　者：冯泓崭 郁进明[1] 

机构地区：[1]东华大学,上海

出　　处：《无线通信》2021年第3期76-86,共11页Hans Journal of Wireless Communications

摘　　要：在基于车辆的设备到设备(D2D)中继通信系统中,以中断概率最小化为目标提出了一种社交网络结合贪心策略的车辆D2D通信中继选择算法。该算法首先根据物理传输距离和社交关系强度阈值对所有潜在中继节点进行预筛选过程,从而有效降低中继节点的平均探测次数;然后根据备选中继集合的大小进行选择优先权的排序,并结合贪心策略进行最优中继节点的选择。仿真结果表明,与已有中继选择算法相比,所提出的算法能够有效降低系统的中断概率,实现较好的连通性。In vehicle-based device-to-device (D2D) relay communication system, a vehicle D2D communication relay selection algorithm based on social networks combined with greedy strategy is proposed with the goal of minimizing the probability of interruption. The algorithm first performs a pre- screening process on all potential relay nodes according to the physical transmission distance and the threshold of social relationship strength, thereby effectively reducing the average probing times of the relay nodes;then, the selection priority is sorted according to the size of the candidate relay set. And combined with the greedy strategy, the optimal relay node is selected. The simulation results show that compared with the existing relay selection algorithm, the proposed algorithm can effectively reduce the system outage probability and achieve better connectivity.

关 键 词：D2D中继通信 社交关系强度 中断概率 贪心策略 

分 类 号：TN9[电子电信—信息与通信工程]