Research On D2D Communication Relay Selection Algorithm Based On Social Awareness

As a technology to improve spectrum utilization,reduce energy consumption,and reduce the load on base stations and users,cooperative D2D communication can not only improve service quality for cell edge users,but also significantly increase the effective coverage area of D2D communication.In order to achieve the excellent performance of the cooperative D2D communication system,the selection of relay nodes plays an important role.In this paper,the social relationship is used to comprehensively reflect the willingness of nodes to cooperate and the quality of communication,and a two-hop social relationship model is established.In view of the situation that most mobile devices are powered by batteries and have limited battery capacity,in order to maximize the utilization of the device’s power and protect its subsequent communication power requirements,a relay selection algorithm based on secondary sealed auction is proposed.In the actual communication system,when the channel state information feedback is not timely or the effective information is missing due to channel interruption,a single relay cannot meet the communication needs.Taking social relations as supplementary information,a multi-media system based on Q-learning is proposed.Following selection algorithm.Aiming at the problem that the social relationship model reflects social domain information only,a two-hop social relationship model is designed by combining social network information,communication network information and the characteristics of collaborative communication.First,analyze the temporal social factors and interactive social factors that affect social relations,and use the social domain information and physical domain information to define the two,and determine the social relationship model.Secondly,starting from the twohop communication link of cooperative communication,combined with the first-hop social relationship and the second-hop social relationship model,the two-hop social relationship is determined,so as to comprehensively reflect the channel state information and social relationship of each hop communication link.Internet Information.The simulation results show that the relay selection algorithm based on the two-hop social relationship can more comprehensively reflect the communication performance of the entire cooperative communication system.Aiming at the problem that the relay node’s participation in cooperative communication affects its own subsequent communication quality,a relay selection algorithm based on two-level sealed auction is proposed.The algorithm quantifies the node’s communication demand as the remaining power ratio threshold to protect the node’s subsequent communication quality;then selects more intimate users according to social relations to prevent eavesdropping;finally,price compensation is used to obtain higher cooperative transmission power.At the same time,the relay nodes are comprehensively evaluated from the remaining power,social relationship,and price compensation,and then the optimal relay node is determined by using the second-level sealed auction and negotiation theory.The simulation results show that the algorithm can achieve the goal of protecting the relay node’s subsequent communication demand power without reducing the user throughput performance.Aiming at the problem that single-relay cooperation cannot effectively improve communication quality when effective information is missing,a multi-relay selection algorithm based on Q-learning is proposed.The algorithm uses the remaining power to design the reward and reward value,initializes the Q function with interactive social factors,and uses the social relationship weight as an indicator to measure the availability of nodes.From the three aspects of relay node power,interactive social factors and node availability,the cooperative relay set is determined,and the performance gains of different relay nodes are used to improve the communication quality of users.The simulation results show that the proposed algorithm can slightly improve the throughput performance of users without increasing the number of cooperative relays.