基于社交关系及能量缓存的D2D通信中继选择算法  

Relay Selection Algorithm for D2D Communication Based on Social Relationship and Energy Cache

作　　者：任晶秋[1] 刘琪 张光华[1] 卢为党[2] REN Jingqiu;LIU Qi;ZHANG Guanghua;LU Weidang(School of Electrical and Information Engineering,Northeast Petroleum University,Daqing 163318,China;College of Information Engineering,Zhejiang University of Technology,Hangzhou 310014,China)

机构地区：[1]东北石油大学电气信息工程学院,黑龙江大庆163318 [2]浙江工业大学信息工程学院,杭州310014

出　　处：《吉林大学学报(信息科学版)》2024年第6期997-1003,共7页Journal of Jilin University(Information Science Edition)

基　　金：国家自然科学基金资助项目(62271447)。

摘　　要：针对D2D(Device-to-Device)通信系统中源节点与目的节点间的距离过大时出现通信时延大、通信过程中断等问题,提出了一种基于社交关系及能量缓存的D2D通信中继选择算法。该算法在限定中继节点的位置前提下,不仅考虑传输速率、中继的剩余能量及剩余缓存空间等常规条件,还考虑了节点间的社交关系以及链路的中断概率,综合计算每条链路权重,权重最高的链路被选中进行数据传输。仿真实验表明,该算法有效降低了D2D通信链路的传输时延,提高了系统成功传输概率,进而提升了中继系统的稳定性。In the D2D(Device-to-Device)communication system,when the distance between the source node and the destination node is too long,the communication delay is large and the communication process is interrupted.A relay selection algorithm for D2D communication based on social relationship and energy cache is proposed.Under the premise of limiting the location of the relay node,the algorithm considers the conventional conditions such as transmission rate,residual energy of the relay and residual buffer space,and considers the social relationship between nodes and the outage probability of the link.The weight of each link is calculated comprehensively,and the link with the highest weight is selected for data transmission.The simulation results show that the proposed algorithm effectively reduces the transmission delay of D2D communication link,improves the successful transmission probability of the system,and improves the stability of the relay system.

关 键 词：社交关系 中断概率 中继选择 能量感知 D2D通信 

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