CN112866960B - D2D communication hierarchical social relationship relay selection method and system in multi-element scene - Google Patents

D2D communication hierarchical social relationship relay selection method and system in multi-element scene Download PDF

Info

Publication number
CN112866960B
CN112866960B CN202110332163.XA CN202110332163A CN112866960B CN 112866960 B CN112866960 B CN 112866960B CN 202110332163 A CN202110332163 A CN 202110332163A CN 112866960 B CN112866960 B CN 112866960B
Authority
CN
China
Prior art keywords
relay
communication
nodes
social relationship
node
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202110332163.XA
Other languages
Chinese (zh)
Other versions
CN112866960A (en
Inventor
李晓滨
刘浩然
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen University
Original Assignee
Shenzhen University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen University filed Critical Shenzhen University
Priority to CN202110332163.XA priority Critical patent/CN112866960B/en
Publication of CN112866960A publication Critical patent/CN112866960A/en
Application granted granted Critical
Publication of CN112866960B publication Critical patent/CN112866960B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W4/00Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/70Services for machine-to-machine communication [M2M] or machine type communication [MTC]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a D2D communication hierarchical social relationship relay selection method and a system under a multivariate scene, wherein the method comprises the following steps: screening out nodes with relay communication capacity according to various indexes in the communication process to obtain a candidate node set; screening the relay nodes in the candidate node set according to the hierarchical social relationship, and selecting the relay nodes under the scene with clear social relationship for relay communication; and if the relay nodes meeting the conditions do not exist in the candidate node set, screening the relay nodes for relay communication under the scene of weak social relationship by using a preset three-party benefit maximization model. The invention can solve the problem of selecting reliable relay nodes for relay communication under the scene of complex and changeable social relations, and improve the overall throughput and the connection establishment success rate of the system.

Description

D2D communication hierarchical social relationship relay selection method and system in multi-element scene
Technical Field
The invention relates to the technical field of relay communication, in particular to a D2D communication hierarchical social relationship relay selection method and system in a multivariate scene.
Background
The communication technology in the 21 st century is rapidly developed, the transmission amount of data is greatly increased due to the popularization of mobile terminals, the requirements of people on the communication technology are increasingly improved, the research of the 5G technology is started on the background, but the further development of the cellular network is limited by the problems of increasingly deficient spectrum resources and the like. A Device-to-Device (D2D) communication technology, which is one of the 5G key technologies, is a terminal-to-Device technology that does not require base station control, and is therefore widely concerned and researched to improve spectrum utilization.
The concept of D2D is similar to M2M (Machine-to-Machine) in the internet of things, and before D2D is a communication technology, similar technologies, such as Bluetooth (Bluetooth), i.e., short-distance time division duplex communication, Wi-Fi Direct with faster transmission speed and longer transmission distance, or Flash LinQ technology proposed by highpass, have appeared in the market, but these technologies do not use authorized frequency band for communication and cannot guarantee the safety and reliability of the communication process, so they are not commercialized in large scale. Compared with other similar communication technologies, the D2D communication technology proposed and researched by the 3GPP organization has higher flexibility, not only works in the licensed frequency band, but also can perform resource allocation management and effective interference control under the control of the base station, thereby ensuring the reliability and effectiveness of the communication process.
In order to expand the application scenario and range of the D2D communication technology, the D2D relay technology becomes one of the research focuses of the D2D communication technology, and the introduction of relay communication improves the success rate of D2D communication connection, improves system capacity, and reduces system interference. Because the distribution and channel conditions of idle relay nodes are relatively uncertain in reality, how to select a proper idle node as the relay node is a main problem of D2D relay communication, introducing social relations into the relay communication is beneficial to searching for more reliable relay nodes, but if the parameters of the social relations are simply weighted and integrated, the stability of the searched relay nodes is not high by the method; and the excitation strategy adopted for relay selection when the social relationship is weak mostly increases interactive signaling, and the burden of the base station is increased.
In addition, the biggest characteristic of modern mobile social network is the instantaneity, and through intelligent mobile terminal equipment, complicated information in the offline life is transferred to an online platform and low-cost management is realized, so that large-scale virtual social is developed, and the deep integration of real life and virtual social is realized. The main behaviors of people in the social network include information searching, webpage browsing, APP downloading and running, character reading, video playing, electronic commerce and the like. As a communication mode of short-distance high-speed transmission, D2D relay communication is bound to be integrated into a modern mobile social network, so as to provide people with more efficient, fast, and convenient social experience, but the mobile social network makes the D2D communication scenario more complicated and changeable, so it is more difficult to ensure the connection establishment success rate of relay transmission, and it is difficult to maintain the throughput of the system at a level that can ensure the communication quality.
Thus, there is a need for improvements and enhancements in the art.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a relay selection method and system for D2D communication hierarchical social relationships in a multi-element scenario, aiming at solving the problem of selecting reliable relay nodes for relay communication in a scenario where social relationships are complex and changeable, and improving the overall throughput and connection establishment success rate of the system.
In order to solve the technical problems, the technical scheme adopted by the invention is as follows:
in a first aspect, the invention provides a D2D communication hierarchical social relationship relay selection method in a multivariate scene, wherein the method comprises the following steps:
screening out nodes with relay communication capacity according to various indexes in the communication process to obtain a candidate node set;
screening the relay nodes in the candidate node set according to the hierarchical social relationship, and selecting the relay nodes under the scene with definite social relationship for relay communication;
and if the relay nodes meeting the conditions do not exist in the candidate node set, screening the relay nodes for relay communication under the scene of weak social relationship by using a preset three-party benefit maximization model.
In one implementation, the screening out nodes with relay communication capability according to various indexes in a communication process to obtain a candidate node set includes:
according to different requirements of communication indexes, capacity limitation is carried out on users in the current communication range, and all idle nodes in a candidate set are ensured to have the capacity of completing the relay communication;
when the idle node meets the limitation of the mobility range, screening out all nodes meeting the limitation that the current communication distance is smaller than the maximum communication distance according to a preset first formula;
calculating nodes meeting the transmission rate requirement according to a preset second formula;
calculating nodes meeting the data processing capacity and the communication time delay according to a preset third formula and a preset fourth formula to obtain remaining idle nodes;
and generating the candidate node set according to the residual idle nodes.
In one implementation, the generating the candidate node set according to the remaining idle nodes includes:
determining the moving distance of the rest idle nodes within a certain time according to the current relative moving speed and moving angle of the rest idle nodes, and limiting the communication distance within the maximum communication distance range;
and ensuring the communication transmission quality of the remaining idle nodes according to the three communication indexes, and putting users meeting the conditions into the candidate node set.
In one implementation, the first formula is:
Figure BDA0002996563000000031
wherein (x) r ,y r ) The position of the rest idle node before moving, t is the movement duration, v is the movement speed, theta is the movement angle, (x) d ,y d ) Is the position of the receiving end of D2D, r max As maximum communication distance, d r ' s The distance between the idle node after moving and the sender of D2D;
the second formula is: the transmission rate of the remaining idle nodes is satisfied
Figure BDA0002996563000000032
Wherein, W is the system bandwidth,
Figure BDA0002996563000000033
for signal-to-noise ratio of relay node, R min Is the lowest transmission rate of the limit;
the third formula is: the total energy consumption of the rest idle nodes for completing the data forwarding task is not more than the rest energy of the rest idle nodes, namely
Figure BDA0002996563000000034
C ri Representing any one relay node r i Number of CPU cycles required to calculate 1bit data, E ri Represents r i Energy consumed per CPU cycle, x 1 Representing the total bit number of the data which needs to be received and forwarded at this time;
the fourth formula is: the total transmission delay should be satisfied
Figure BDA0002996563000000041
Wherein, F ui 、F ri 、F si Respectively representing the data computing capacity of the CPU in each second, Ret being the data forwarding time length, v 1 Representing the speed of light, Delay max The maximum communication transmission delay.
In one implementation, a social relationship scenario includes: a strong social relationship scenario, a weak social relationship scenario, a temporary social relationship scenario.
In one implementation, the screening, according to the hierarchical social relationship, the relay nodes in the candidate node set, and selecting the relay node in the scene with clear social relationship to perform relay communication includes:
screening the relay nodes in the candidate node set according to the classification of the address list or social software in the D2D sending terminal mobile phone, and finding out the node with the direct social relationship and the strongest social relationship;
and if the node with the strongest social relationship exists, performing D2D relay communication by using the node with the strongest social relationship.
In an implementation manner, if there is no relay node meeting the condition in the candidate node set, screening the relay node for relay communication in a scene with a weak social relationship by using a preset three-party benefit maximization model, including:
and if the nodes in the candidate node set have no obvious connection with the D2D sending end in the social relationship, the centrality and the interest similarity, exciting the relay user to participate in the relay communication by using an excitation strategy of a three-party interest maximization model.
In a second aspect, an embodiment of the present invention further provides a D2D communication hierarchical social relationship relay selection system in a multivariate scenario, where the system includes:
the node screening module is used for screening out nodes with relay communication capacity according to various indexes in the communication process to obtain a candidate node set;
the first relay communication module is used for screening the relay nodes in the candidate node set according to the hierarchical social relationship and selecting the relay nodes under the scene with clear social relationship for relay communication;
and the second relay communication module is used for screening the relay nodes to carry out relay communication in a scene with weak social relationship by using a preset three-party benefit maximization model if the relay nodes meeting the conditions do not exist in the candidate node set. In a third aspect, an embodiment of the present invention further provides a terminal device, where the terminal device includes a memory, a processor, and a multi-scenario D2D communication hierarchical social relationship relay selection program that is stored in the memory and is executable on the processor, and when the processor executes the multi-scenario D2D communication hierarchical social relationship relay selection program, the step of implementing the D2D communication hierarchical social relationship relay selection method in the multi-scenario in any one of the foregoing solutions is implemented.
In a fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium, where a multi-scenario D2D communication hierarchical social relationship relay selection program is stored on the computer-readable storage medium, and when the multi-scenario D2D communication hierarchical social relationship relay selection program is executed by a processor, the steps of the multi-scenario D2D communication hierarchical social relationship relay selection method in any one of the foregoing schemes are implemented.
Has the advantages that: compared with the prior art, the invention provides a D2D communication hierarchical social relationship relay selection method under a multivariate scene, which comprises the following steps: screening out nodes with relay communication capacity according to various indexes in the communication process to obtain a candidate node set; screening the relay nodes in the candidate node set according to the hierarchical social relationship, and selecting the relay nodes under the scene with clear social relationship for relay communication; if the relay nodes meeting the conditions do not exist in the candidate node set, screening the relay nodes for relay communication under the scene with weak social relation by using a preset three-party benefit maximization model. The invention can solve the problem of selecting reliable relay nodes for relay communication under the scene of complex and changeable social relations, and improve the overall throughput and the success rate of connection establishment of the system.
Drawings
Fig. 1 is a flowchart of a specific implementation of a D2D communication hierarchical social relationship relay selection method in a multivariate scenario according to an embodiment of the present invention.
Fig. 2 is a connection establishment success rate of the D2D communication hierarchical social relationship relay selection method in the multivariate scene provided by the embodiment of the present invention.
Fig. 3 is an optimal transmission power of a D2D user at different pricing factors β in the D2D communication hierarchical social relationship relay selection method under the multivariate scenario provided by the embodiment of the present invention.
Fig. 4 is a variation of a pricing factor β of a base station for different types of D2D users in the D2D communication hierarchical social relationship relay selection method in the multivariate scenario provided by the embodiment of the present invention.
Fig. 5 is a diagram illustrating utility variation of a base station under different pricing factors in the D2D communication hierarchical social relationship relay selection method in the multivariate scenario according to the embodiment of the present invention.
Fig. 6 is a schematic block diagram of a D2D communication hierarchical social relationship relay selection system in a multivariate scenario provided by an embodiment of the present invention.
Fig. 7 is a schematic block diagram of an internal structure of a terminal device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and effects of the present invention clearer and clearer, the present invention is further described in detail below with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
The communication technology in the 21 st century is rapidly developed, the transmission amount of data is greatly increased due to the popularization of mobile terminals, the requirements of people on the communication technology are increasingly improved, the research of the 5G technology is started on the background, but the further development of the cellular network is limited by the problems of increasingly deficient spectrum resources and the like. A Device-to-Device (D2D) communication technology, which is one of the 5G key technologies, is a terminal-to-Device technology that does not require base station control, and is therefore widely concerned and researched to improve spectrum utilization.
The concept of D2D is similar to M2M (Machine-to-Machine) in the internet of things, and before D2D is a communication technology, similar technologies, such as Bluetooth (Bluetooth), i.e., short-distance time division duplex communication, Wi-Fi Direct with faster transmission speed and longer transmission distance, or Flash LinQ technology proposed by highpass, have appeared in the market, but these technologies do not use authorized frequency band for communication and cannot guarantee the safety and reliability of the communication process, so they are not commercialized in large scale. Compared with other similar communication technologies, the D2D communication technology proposed and researched by the 3GPP organization has higher flexibility, not only works in the licensed frequency band, but also can perform resource allocation management and effective interference control under the control of the base station, thereby ensuring the reliability and effectiveness of the communication process.
In order to expand the application scenario and range of the D2D communication technology, the D2D relay technology becomes one of the research focuses of the D2D communication technology, the success rate of D2D communication connection is improved by introducing relay communication, the system capacity is improved, and the system interference is reduced. Because the distribution and channel conditions of idle relay nodes are relatively uncertain in reality, how to select a proper idle node as the relay node is a main problem of D2D relay communication, introducing social relations into the relay communication is beneficial to searching for more reliable relay nodes, but if the parameters of the social relations are simply weighted and integrated, the stability of the searched relay nodes is not high by the method; and the excitation strategy adopted for relay selection when the social relationship is weak mostly increases interactive signaling, and the burden of the base station is increased.
In addition, the biggest characteristic of modern mobile social network is the instantaneity, and through intelligent mobile terminal equipment, complicated information in the offline life is transferred to an online platform and low-cost management is realized, so that large-scale virtual social is developed, and the deep integration of real life and virtual social is realized. The main behaviors of people in the social network include information searching, webpage browsing, APPA downloading and running, text reading, video playing, electronic commerce and the like. As a communication mode of short-distance high-speed transmission, D2D relay communication is bound to be integrated into a modern mobile social network, so as to provide people with more efficient, fast, and convenient social experience, but the mobile social network makes the D2D communication scenario more complicated and changeable, so it is more difficult to ensure the connection establishment success rate of relay transmission, and it is difficult to maintain the throughput of the system at a level that can ensure the communication quality.
Therefore, the relay selection of the D2D in three scenes under different social relationship strengths is discussed by comprehensively considering the social relationship degree between people, and the relay selection method of the D2D communication hierarchical social relationship under the multivariate scene has very important theoretical and practical significance on the premise of ensuring the performance index of the D2D communication.
The embodiment provides a relay selection method for a D2D communication hierarchical social relationship in a multivariate scene, as shown in fig. 1, the method includes:
s100, screening out nodes with relay communication capacity according to various indexes in the communication process to obtain a candidate node set;
s200, screening relay nodes in the candidate node set according to the hierarchical social relationship, and selecting the relay nodes in the scene with the definite social relationship to carry out relay communication;
step S300, if relay nodes meeting the conditions do not exist in the candidate node set, screening the relay nodes for relay communication in a scene with weak social relation by using a preset three-party benefit maximization model.
In specific implementation, in this embodiment, according to different requirements of communication indexes, capacity limitation needs to be performed on users in a current communication range, so as to ensure that all idle nodes in a candidate set have the capacity of completing the relay communication; and then screening all nodes meeting the limitation that the current communication distance is smaller than the maximum communication distance according to a preset first formula when the idle nodes meet the limitation of the mobility range. Then, calculating nodes meeting the transmission rate requirement according to a preset second formula; and calculating the nodes meeting the data processing capacity and the communication time delay according to a preset third formula and a preset fourth formula to obtain the residual idle nodes. Finally, determining the moving distance of the rest idle nodes within a certain time according to the current relative moving speed and moving angle of the rest idle nodes, and limiting the communication distance within the maximum communication distance range; and ensuring the communication transmission quality of the remaining idle nodes according to the three communication indexes, and putting users meeting the conditions into the candidate node set, thereby realizing the generation of the candidate node set according to the remaining idle nodes.
In specific implementation, before relay selection, in order to ensure the communication quality of D2D relay communication, it is necessary to examine the communication capability of a relay idle node that is going to perform relay communication, i.e. verify whether the relay idle node can meet a series of communication indexes, so as to complete the data forwarding work required by the transmitting end. The series of communication indexes comprise the moving distance limit of the idle node, the data transmission rate of the relay user, the data processing capacity of the terminal held by the relay user and the data transmission delay generated in the transmission process.
First, in order to ensure that the selected relay user can receive the data from the transmitting end, the communication distance is limited, and during the probing time t, the position of a relay idle node at the beginning is assumed to be (x) r ,y r ) The distance between the receiving ends of D2D is (x) d ,y d ) According to the movement speed v and the movement angle theta recorded by the terminal equipment held by the relay idle node, the distance between the mobile relay idle node and the sending end is obtained as
Figure BDA0002996563000000081
And the distance between the relay idle node and the receiving end
Figure BDA0002996563000000091
Setting the maximum communication distance to r max All satisfying the first formula are:
Figure BDA0002996563000000092
i.e. d' ur <r max And d r ' s <r max Will remain in the candidate node set G1.
Second, to ensure the quality of service of the relay communication, candidates need to be restrictedMinimum data transmission rate for all idle relay nodes in the set G1 according to the formula
Figure BDA0002996563000000093
Calculating a reference point path loss, wherein PL 0 Is the reference path loss of near field communication, which can be expressed by the formula PL 0 =40log 10 (d 0 )+7.8-18log 10 (h BS -1)-18log 10 (h UT -1)+2log 10 (f c ) Is calculated to give 0 10m is the reference distance, h BS 20m is the height of the base station, which can also be derived from actual measurements, h UT 1.5m is the height of the terminal device, f c 2GHZ is the carrier frequency,
Figure BDA0002996563000000094
node r is free for relaying i And between the receiving end s i α is a path loss factor.
After the path loss is obtained, the invention adopts the multiplexing mode to multiplex the frequency spectrum resources of the cellular users and utilizes the formula
Figure BDA0002996563000000095
Calculating the signal-to-noise ratio of the relay idle node, wherein
Figure BDA0002996563000000096
For relaying the transmission power of idle nodes, I C Co-channel interference, n, generated for the multiplexed cellular users 0 Setting the channel bandwidth W for white Gaussian noise by formula
Figure BDA0002996563000000097
The throughput, i.e. the transmission rate, is calculated. Therefore, the D2D sending end sets the acceptable minimum communication transmission rate according to the self requirement, and screens the candidate relay idle nodes in the G1, the nodes which do not meet the condition are removed from the candidate set, and the transmission rate meets the second formula
Figure BDA0002996563000000098
Thirdly, the data processing capabilities of the terminals held by the relay users ensure that the node has the capability of forwarding the received data, assuming C ri Representing any one relay node r i Number of CPU cycles required to calculate 1bit data, E ri Represents r i Energy consumed per CPU cycle, x 1 Representing the total number of bits of data to be received and forwarded at this time, so that the total energy consumption should not be greater than the residual energy of the relay node, i.e. the third formula is satisfied
Figure BDA0002996563000000099
All candidate relay-idle nodes that satisfy the above equation will be left in the candidate set G1.
In the third communication index, the quality of the data transmission delay largely affects the actual communication experience of the user, and assume F ui ,F ri ,F si Respectively representing the data computing capacity of the CPU in each second, Ret being the data forwarding time length, v 1 Representing the speed of light, the total propagation delay should satisfy the fourth formula:
Figure BDA0002996563000000101
the first three items are respectively time delay generated by data processing of CPUs of a D2D sending terminal, a D2D relay terminal and a D2D receiving terminal, the fourth item is time delay generated by data forwarding of a relay terminal, and the fifth item is time delay generated by communication distance.
In this embodiment, according to the classification of the address list or the social software in the D2D sending-end mobile phone, the relay nodes in the candidate node set are screened, and the node having the direct social relationship and the strongest social relationship is found. And then if the node with the strongest social relationship exists, performing D2D relay communication by using the node with the strongest social relationship.
The nodes in the relay candidate set screened by the indexes all have relay communication transmission capacity, and then the relay will of users in the candidate set is considered.
Firstly, in order to select a relay node by using a hierarchical social relationship, firstly, common communication scenes in reality are clarified, social relationships in different scenes show great difference, and the communication scenes selected by the D2D relay are divided into three categories according to the degree of the social relationships between people in reality:
(1) a strong social relationship scenario. In real life, people in scenes such as schools, companies and the like have strong social relations, the trust degree between people is high, meanwhile, the social network overlapping degree is high, and people in the types tend to be more willing to communicate with each other. In the D2D relay communication, the strong social relationship is not only beneficial to ensuring a reliable relay communication transmission process, but also can ensure high quality and high effectiveness of information content.
(2) A weak social relationship scenario. People in weak social relationship scenes are often only acquainted relationships, and although people in such scenes do not have higher mutual assistance and mutual assistance willingness as people in strong social relationship, people in weak social relationship can help to transmit information among different groups. Under the strong social relationship, the information obtained by people is often well known, the repetition rate of information forwarding is also high, and the information learned among the crowds under the weak social relationship is greatly different, so that the information is favorably diffused among different crowds. For example, when a user wants to perform D2D relay communication in a weak social scenario, the D2D relay communication can be completed by mining the interests among the users or finding a central node with a wide social range in the group.
(3) Temporary social scenarios (scenarios without social relationships). The users often do not know or only see the scenes in the temporary social scene, which makes great challenge to the D2D relay communication, for example, when the users want to consult with a professional academic expert in the scene, the D2D relay communication is difficult to establish because the users do not have social relationship between the two, so that the nodes can have strong or weak social relationship with the users in the strange environment through a certain intermediate node with the property of a "bridge", and the nodes are stimulated to participate in the relay communication through a certain stimulation strategy, so as to establish the relay communication with the strange node.
Next, the social relationship is prioritized and divided into four levels, the four levels are independent from each other and form a relay selection algorithm, after considering the change of the communication scene, the idle node screened by using the method with high priority is directly selected as the relay node to perform relay communication, and if the method with high priority does not screen a suitable node, the suitable relay node is sequentially found according to the order of priority degradation.
1) Direct social relationships. The social network is developed till now, people are attached with different labels to different social objects in the social process, the invention directly defines the direct social relationship through the labels which are set for different objects by a user in social software or a mobile phone address book, and divides the social relationship into two types,
Figure BDA0002996563000000111
wherein RTrust (u) i ,r i ) Representing the type of social relationship between the sender of D2D and the free node, D RTrust(ui,ri) Representing a direct social relationship, I RTrust(ui,ri) Representing an indirect social relationship, W ui,ri Label indicating that a user has set to a currently idle node having relay communication capability, W ui,ri 1 represents a direct social relationship between two users, W ui,ri 0 represents an indirect social relationship between two users. If there is an idle relay node in the current candidate set and G1 that has a direct social relationship with the D2D sender, for example, the boolean vector Friend of the social software or Friend set in the mobile phone address book of the sender is (f) 1 ,f 2 ,...,f N ) 1×N Wherein a certain f i Is 0 or1, i.e. there is a certain f i When the value of (1) is 1, the relay idle node is directly selected as the relay node for relay communication, so that the relay selection problem under the first kind of scenes is solved, the time for detecting the ground by the node is greatly saved, the stability of the relay node is improved, and the communication process is ensured to be carried out smoothly. If the D2D sender can not detect the nodes with direct social relations under the current scene, or the D2D sender moves the range where the nodes with direct social relations can be detected in a short time, and then the next screening is considered.
(2) Degree of centrality
If no relay idle node having a direct social relationship with the D2D sending end exists in the current communication range, the user may be in a second type of communication scenario, that is, a scenario without a clear social relationship, at this time, the difficulty in detecting the relay node will increase, and meanwhile, the reliability of the relay node is also difficult to guarantee. The invention starts from the importance degree of the user in the group, provides the index of the centrality, and is used for measuring the influence of the idle relay node in the current social network, and the larger the idle influence is, the more idle nodes have direct or indirect social relations with each other, thereby ensuring the reliable transmission of the communication process and improving the system throughput and the connection establishment success rate.
Suppose a relay idle node r i The communication range of (a) includes n users capable of D2D communication, including all D2D transmitters and D2D receivers, and the set U ═ is formed (U ═ is 1 ,u 2 ,...,u n ),i∈[1,n],R=[c rx,ui ] 1×n Indicating a relay idle node r x With user u i A matrix of the number of connections between, [ c ] rx,ui ]Is a free node r x The number of contacts with all D2D users in the user set R is larger, which indicates that the relationship between two nodes is more close.
Firstly, a relay idle node r is calculated x All users u around it that can communicate with D2D i Average number of connections therebetween
Figure BDA0002996563000000121
Wherein cn is ui Indicating a relay idle node r x Using the average number of contacts for the total number of contacts of other users
Figure BDA0002996563000000122
Constructing a Boolean matrix R '═ c' rx,ui ] m×n C of wherein' rx,ui ∈[0,1]By the formula
Figure BDA0002996563000000123
And (4) calculating.
According to the constructed Boolean matrix R', calculating an idle node R x Is given as the user influence matrix W ═ W rx,ui ] m×n Wherein w is rx,ui Indicates a free node r x Influence value of (2)
Figure BDA0002996563000000124
If the node r is idle x For user u i Has an influence value of greater than or equal to the average influence value
Figure BDA0002996563000000131
Then influence factor w' rx,ui 1, indicates that the idle node pair is for user u i Influence is produced, otherwise w' rx,ui 0, indicates that the idle node is coupled to user u i Without influence, i.e.
Figure BDA0002996563000000132
Mean influence value
Figure BDA0002996563000000133
And the calculation formula of the influence factor is as follows
Figure BDA0002996563000000134
Where δ (w) rx,ui ) 1 stands for the relay idle node r x For user u i Has an influence value of more than 0, delta (w) rx,ui ) 0 represents the relay idle node r x For user u i No influence finally, the influence factor of the available idle relay node, i.e. the relay idle node r x Can influenceThe number of the users is increased,
Figure BDA0002996563000000135
therefore, when the D2D sending end is in the second type communication scene, the idle node with the direct social relation cannot be detected, the idle node with the highest influence in the current communication range is selected as the relay node, the connection establishment success rate and the system throughput performance are improved, the node has the direct or indirect social relation with more users in the communication range, and the reliability of the communication process can be effectively guaranteed.
However, the user group in the scene may not have such a central node, and then the method and the system excavate the implicit social relationship among the users from the perspective of interest similarity, and excavate the users which are similar to the D2D sending end, and such users will be more interested in the content and communication process required to be forwarded by the D2D sending end, so that the willingness to participate in relay communication is higher, and the connection establishment success rate is improved to a certain extent.
(3) Similarity of interest
Let us say that for any one D2D sender, the interested contents form a matrix
Figure BDA0002996563000000136
Wherein m is i Indicating the amount of content of interest to the user. The interests of the users may overlap, so that the total interest content is
M total =M ui ∪M r1 ∪M rm ={b 1 ,b 2 ,b 3 ,...,b p Wherein, the position of the base is changed,
Figure BDA0002996563000000137
the base station can measure the interest degree of the user to different interest points by recording the accessed time of each content, the longer the time for accessing the content is, the greater the interest degree of the content is, and the time duration t for accessing the content is used r Total access time t total To obtain the interest degree
Figure BDA0002996563000000141
Thus, the time t total In, user u i Interestingness matrix for all content
Figure BDA0002996563000000142
And is
Figure BDA0002996563000000143
Is limited as follows
Figure BDA0002996563000000144
And is
Figure BDA0002996563000000145
Finally, the interest degree matrix I ═ F of all the current idle users and the sending end of D2D can be obtained ui (t total ),F r1 (t total ),...,F rm (t total )}. At time t total In other words, the interest level of a certain content between the idle node and the D2D sender may not be the same, i.e. the idle node and the D2D sender are not the same
Figure BDA0002996563000000146
Hence, the free node r is defined herein x With user u i Interest similarity between them
Figure BDA0002996563000000147
As can be seen from the above, the smaller the difference between the interests of the sender and an idle node of D2D in the content is, the more interested the two people are in the communication content of each other is, the greater will the idle node will relay, and then the relay will between the sender and the idle user of D2D is defined
Figure BDA0002996563000000148
Wherein theta represents a relay intention influence factor, the relay communication participation attitude of the idle node may not matter when the idle node is usedInter node r x For the content b z When the interest degree of (3) is equal to 0.5, it indicates that the attitude of the free node is insignificant, and when the spatial node r is x For the content b z When the interest degree of the space node r is more than 0.5, the relay participation degree of the relay node is more positive, and when the space node r is more positive x For the content b z When the interest degree of (2) is less than 0.5, the relay participation degree of the relay node is relatively negative, so that the influence factors can be expressed as positive or negative, or do not matter, and the definition
Figure BDA0002996563000000149
And finally, selecting the idle node with the highest relay participation intention as the relay node to finish the relay communication process.
Therefore, the hierarchical social relationship basically solves the problem of selecting reliable relay nodes in the first two communication scenes, but when a user is in a third temporary social relationship scene, idle relay nodes in the current range and a D2D sending end have no social relationship basically, so that the hierarchical social relationship cannot find stable and reliable relay nodes any more, the connection success rate and the throughput of a system are affected, and therefore, a certain incentive strategy is considered to be used, relay selection is performed after the benefits of three parties are balanced, and the three parties mainly comprise a base station, a D2D sending end and a D2D relay end.
(1) D2D sender profit model
The D2D sender is used as a party leasing spectrum resources, and an operator needs to allocate spectrum resources to the D2D communication through a base station in a cell to complete the D2D communication, during the communication, the D2D sender will consume electric quantity, memory, human energy and other costs, and the D2D sender has main benefits derived from the transmission rate, time delay and other indexes of the communication, and these indexes define the user experience (QoS) of the D2D sender in the communication.
Thus, for D2D sender u i In terms of signal-to-noise ratio of
Figure BDA0002996563000000151
Wherein
Figure BDA0002996563000000152
H 0 For the Reyle fading factor, the exponential distribution with 1 is expected, so the average S/H ratio at the D2D sender is known to be
Figure BDA0002996563000000153
For the D2D communication process, since the signal-to-interference ratio affects the transmission rate, the higher the signal-to-interference ratio, the faster the communication transmission rate, and for the D2D transmitting end, it is expected that the communication process will be completed as soon as possible, so the transmitting power will be increased as much as possible within the self-sustaining range. Thus, D2D sends end u i Has a utility function of
Figure BDA0002996563000000154
Wherein s is a correlation coefficient of the drying ratio, and the function of the correlation coefficient is to convert the drying ratio into a measure of the effective form. As can be seen from the formula, the larger the signal to interference ratio, the greater the utility value of the D2D sender, and the communication will be completed in a shorter time; second item
Figure BDA0002996563000000155
The cost generated by the frequency spectrum resources owned by the D2D sending end leasing base station; third term ρ i The sum of the relay service fees paid to the relay end of D2D, which will be explained below; the fourth term is the cost consumption function of the D2D sending terminal, which has a non-negative value and is related to the power P i Monotone increasing, the cost consumption function should be composed of electric quantity, memory and energy consumption of user, the invention uses quadratic function to define the cost consumption function
Figure BDA0002996563000000161
C in the above equation is a coefficient of the cost consumption function, and the function of c is also to convert the physical quantity into a utility function for measurement, so that the utility function of the D2D sender can be finally expressed as
Figure BDA0002996563000000162
That is, the utility function of the D2D sender is equal to the remainder obtained by subtracting the spectrum lease fee from the communication transmission rate of the D2D sender and then subtracting the propagated cost consumption, and as can be seen from the formula, for different D2D senders, the specific change expressions of the utility are different due to different conditions such as distance, channel condition and surrounding interference, so that the type of the D2D sender is defined for different types of D2D users in comparison simulation, and the D2D sender is ordered to compare different types of D2D users in the simulation conveniently
Figure BDA0002996563000000163
To indicate different types of D2D senders, the quality of D2D communication is mainly determined by the magnitude of the transmit power of D2D sender and its type
Figure BDA0002996563000000164
And (4) jointly determining.
(2) D2D relay node interest model
From the above description, in order to find a reliable relay node in a scenario without social relationship, the D2D sender will stimulate an idle relay node to participate in relay communication by paying a certain relay service fee, where the signal-to-noise ratio of the D2D relay end can be expressed as
Figure BDA0002996563000000165
Wherein
Figure BDA0002996563000000166
H 0 For Rayleigh fading factor, obey the exponential distribution expected to be 1, so the average signal-to-drying ratio at the transmitting end of D2D is
Figure BDA0002996563000000167
For the D2D relay terminal, unlike the D2D transmitting terminal, if the transmitting power of the D2D relay terminal becomes large, the cost consumption such as the self-power will be increased, and as a rational node, the D2D relay terminal will save the self-consumption as much as possible to complete the relay transmission. Thus, D2DThe utility function of the relay terminal will be formed by
Figure BDA0002996563000000171
Wherein z is a correlation coefficient of the drying ratio and has the function of converting the drying ratio into a utility form measurement,
Figure BDA0002996563000000172
cost consumption function for D2D relay users, again a quadratic function
Figure BDA0002996563000000173
And also defines the type of relay end
Figure BDA0002996563000000174
Suppose that the transmission rate required by the user at the D2D sender is
Figure BDA0002996563000000175
W is the bandwidth and the size of the forwarded data packet is
Figure BDA0002996563000000176
The service fee paid to the relay user by each D2D sender is
Figure BDA0002996563000000177
Where x is the pricing factor for the charges, the relay may adjust the charges to the D2D sender to change its utility.
So far, we obtain utility models of D2D sending users, D2D relay users and operators, and then solve the optimal behavior under the models.
(3) Mobile phone service operator interest model
The operator, who is the party in the network that owns the spectrum resources, will lease the spectrum to the D2D user to meet their communication demand after receiving the communication request from the D2D user, so one of the operator's major benefits comes from the service charge generated by the spectrum lease, which includes the utility of the cellular network in the compensation system and the rest of the service chargeAdditional profit, the utility function u of the operator is available after considering the cost consumption of the operator itself BS (i)=π i -C(p i )。
In order to improve the utilization rate of frequency spectrum resources, an operator allows D2D users to reuse the resources of a cellular network in a system, so that the interference to cellular users is inevitable, and in order to ensure the communication performance of the cellular network, D2D users accessing the network should compensate the price of the users, so that the invention provides a linear charging mode to charge D2D users accessing the network, and therefore, the utility function of the operator is in
Figure BDA0002996563000000178
Wherein ω is 0 A fixed charging part is used for compensating the cost consumption of an operator, and as long as the D2D user needs to carry out D2D relay communication, the fixed charging part needs to be paid before the communication is started; the latter item
Figure BDA0002996563000000181
For not fixing the charging part, i.e. to vary with future revenue of D2D user, where β ∈ [0,1 ]]To account for the reddening factor, the base station may adjust its size to increase its revenue, but too much will impact the aggressiveness of D2D users to engage in D2D communications.
Once D2D communication is established, D2D users will generate interference to cellular users in the system, and therefore the interference generated by D2D users is incorporated into the cost function of the operator herein to measure the overall benefit of cellular resources in the system, thereby allowing the operator to adjust the red-scoring factor β to achieve greater utility, and therefore the cost function of the operator is defined herein based on the interference generated by D2D users
Figure BDA0002996563000000182
Wherein
Figure BDA0002996563000000183
The distance between the sender and the base station of D2D,
Figure BDA0002996563000000184
for distance between the D2D relay and the base station, both users multiplexing the uplink resources of the cellular user, will result in a size of
Figure BDA0002996563000000185
Mu is a cost factor. It can be seen that the closer the distance between the D2D sender and the base station is, the greater the generated interference is, so the base station can reasonably determine the reddening factor β according to the interference generated by the D2D user to compensate the utility of the cellular network and improve the benefit of the base station, and as a rational participant, the D2D sender can also adjust the communication behavior of the base station according to the pricing policy made by the base station, so the base station should take possible actions taken by the D2D user into account when pricing.
(1) D2D sender optimal behavior solution
As a rational node, the D2D sender only selects to carry out the D2D relay communication when the own utility is greater than 0, so the optimality is that the solution can be converted into u D (i)>0, and because
Figure BDA0002996563000000186
The optimal solution problem then translates into
Figure BDA0002996563000000187
The derivation is carried out on the formula, and the optimal property of the D2D sending end is obtained as a solution, namely the optimal transmitting power
Figure BDA0002996563000000188
Therefore, the optimal transmission power is mainly determined by the pricing factor beta of the base station and the type theta of the transmitting end i And (6) determining.
(2) D2D relay terminal optimal behavior solution
Similarly, the D2D relay terminal, as a rational node, will also maximize its utility, i.e. its optimal behavior solution is transformed into the maximum value of its utility function, while completing the communication forwarding task
Figure BDA0002996563000000191
The transmission power in the above formula is also derived and made equal to 0 to obtain the optimal transmission power of the relay terminal as
Figure BDA0002996563000000192
(3) Optimal behavior solution for mobile phone operators
After obtaining the optimal transmitting power of the D2D sender, the sender has ensured that its own utility is greater than 0, so the base station will price the D2D sender by adjusting β and ω 0 So as to maximize its utility, i.e., max u BS (i) In that respect In an extreme case, in order to make the D2D sender select to perform the communication process, i.e. at least ensure that the utility of the D2D sender is greater than 0, at this time
Figure BDA0002996563000000193
Thereby obtaining
Figure BDA0002996563000000194
The utility function of the base station can then be converted into
Figure BDA0002996563000000195
The optimum transmit power is brought into the above equation,
Figure BDA0002996563000000196
the beta factor of the formula is derived to obtain the optimal pricing factor
Figure BDA0002996563000000201
Then the maximum utility function of the base station is obtained by substituting the maximum utility function into the utility function of the base station
Figure BDA0002996563000000202
In particular applications, the present embodiment provides an example of a particular application of the D2D hierarchical social relationship relay selector in a multivariate scenario, and it should be noted that although a logical order is shown in the flowchart, in some cases, the steps shown or described may be performed in an order different from that here.
Step 1, screening out nodes with relay communication capability according to various indexes in the communication process, setting the maximum communication distance to be R to be 500, obtaining all idle relay nodes meeting the conditions through a formula of moving distance limitation, and putting the idle relay nodes into a candidate set G1.
According to the real-time data transmission rate of the relay idle users in the current G1 candidate set recorded by the base station, for example, the lowest transmission rate of the D2D sending end is set to be 5Mbit/s according to the self requirement, then the idle relay nodes which do not meet the lowest transmission rate in the G1 are moved out of the G1, and similarly, after the data processing capacity II and the communication delay are limited, a new candidate set G2 is obtained.
Step 2, screening all idle relay nodes in G2 in a hierarchical social relationship, firstly, according to the classification of an address list or social software in a D2D sending terminal mobile phone, finding out the node with the strongest social relationship of the direct social relationship, if the node exists, finishing detection, directly carrying out D2D relay communication, if the node does not exist, calculating the Influence of all users in G2 through the calculation method recorded by an operator according to a user contact time matrix recorded by the operator, and adding inflence rx And the largest idle relay node is used as the relay node to participate in the relay communication. However, if the influence of the idle relay nodes in the current communication scene is low and the idle relay nodes do not have strong centrality, the interest similarity is calculated from the medium interest matrix recorded by the operator end and is converted into the relay intention, and the maximum relay intention is achieved
Figure BDA0002996563000000203
The user of (2) will be selected as the relay node, and fig. 2 shows the connection establishment success rate of the system in this example.
Step 3, if the nodes in the G2 have no obvious connection with the D2D sender no matter in social relation, centrality or interest similarity, then the examination is carried outThe incentive strategy of using the benefit maximization of three parties is considered to stimulate the relay users to participate in the relay communication, and meanwhile, the utility of the D2D sender and the operator is improved. Respectively calculating the optimal transmitting power P of the initial D2D transmitting end and the optimal transmitting power P of the D2D relay end ui And P ri And a pricing factor beta for the base station, thereby maximizing the utility of the base station. Fig. 3 shows the optimal transmission power of D2D users at different pricing factors, fig. 4 shows the variation of the pricing factor β of the base station for different types of D2D users, and fig. 5 shows the variation of the utility of the base station at different pricing factors.
Exemplary devices
As shown in fig. 6, the present embodiment further provides a D2D communication hierarchical social relationship relay selection system in a multivariate scenario, where the system includes: a node screening module 10, a first relay communication module 20 and a second relay communication module 30. Specifically, the node screening module 10 is configured to screen out a node with relay communication capability according to each index in a communication process, so as to obtain a candidate node set. The first relay communication module 20 is configured to screen relay nodes in the candidate node set according to the hierarchical social relationship, and select a relay node in a scene with a clear social relationship to perform relay communication. The second relay communication module 30 is configured to, if no relay node that meets the condition exists in the candidate node set, screen out a relay node for relay communication in a scenario where a social relationship is weak by using a preset three-party benefit maximization model.
Based on the above embodiment, the present invention further provides a terminal device, and a schematic block diagram thereof may be as shown in fig. 7. The terminal equipment comprises a processor, a memory, a network interface, a display screen and a temperature sensor which are connected through a system bus. Wherein the processor of the terminal device is configured to provide computing and control capabilities. The memory of the terminal equipment comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The network interface of the terminal device is used for connecting and communicating with an external terminal through a network. The computer program is executed by a processor to implement a D2D communication hierarchical social relationship relay selection method in a multivariate scenario. The display screen of the terminal equipment can be a liquid crystal display screen or an electronic ink display screen, and the temperature sensor of the terminal equipment is arranged in the terminal equipment in advance and used for detecting the operating temperature of the internal equipment.
It will be understood by those skilled in the art that the block diagram of fig. 7 is only a block diagram of a part of the structure related to the solution of the present invention, and does not constitute a limitation to the terminal device to which the solution of the present invention is applied, and a specific terminal device may include more or less components than those shown in the figure, or may combine some components, or have different arrangements of components.
In one embodiment, a terminal device is provided, the terminal device includes a memory, a processor, and a D2D communication hierarchical social relationship relay selection program stored in the memory and executable on the processor, and when the processor executes the D2D communication hierarchical social relationship relay selection program in the multi-scenario, the following operation instructions are implemented:
screening out nodes with relay communication capacity according to various indexes in the communication process to obtain a candidate node set;
screening the relay nodes in the candidate node set according to the hierarchical social relationship, and selecting the relay nodes under the scene with definite social relationship for relay communication;
and if the relay nodes meeting the conditions do not exist in the candidate node set, screening the relay nodes for relay communication under the scene of weak social relationship by using a preset three-party benefit maximization model.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware related to instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, databases, or other media used in embodiments provided herein may include non-volatile and/or volatile memory. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
In summary, the invention discloses a relay selection method and a system for D2D communication hierarchical social relationship in a multivariate scene, wherein the method comprises the following steps: screening out nodes with relay communication capacity according to various indexes in the communication process to obtain a candidate node set; screening the relay nodes in the candidate node set according to the hierarchical social relationship, and selecting the relay nodes under the scene with clear social relationship for relay communication; and if the relay nodes meeting the conditions do not exist in the candidate node set, screening the relay nodes for relay communication under the scene of weak social relationship by using a preset three-party benefit maximization model. The invention can solve the problem of selecting reliable relay nodes for relay communication under the scene of complex and changeable social relations, and improve the overall throughput and the connection establishment success rate of the system.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.

Claims (7)

1. A D2D communication hierarchical social relation relay selection method in a multivariate scene is characterized by comprising the following steps:
screening out nodes with relay communication capacity according to various indexes in the communication process to obtain a candidate node set;
screening the relay nodes in the candidate node set according to the hierarchical social relationship, and selecting the relay nodes under the scene with clear social relationship for relay communication;
if the relay nodes meeting the conditions do not exist in the candidate node set, screening the relay nodes for relay communication under the scene of weak social relationship by using a preset three-party benefit maximization model;
the screening out the nodes with the relay communication capacity according to each index in the communication process to obtain a candidate node set comprises the following steps:
according to different requirements of communication indexes, capacity limitation is carried out on users in the current communication range, and all idle nodes in a candidate set are ensured to have the capacity of completing the relay communication;
when the idle node meets the limitation of the mobility range, screening out all nodes meeting the limitation that the current communication distance is smaller than the maximum communication distance according to a preset first formula;
calculating nodes meeting the transmission rate requirement according to a preset second formula;
calculating nodes meeting the data processing capacity and the communication time delay according to a preset third formula and a preset fourth formula to obtain remaining idle nodes;
generating the candidate node set according to the residual idle nodes;
the generating the candidate node set according to the remaining idle nodes includes:
determining the moving distance of the rest idle nodes within a certain time according to the current relative moving speed and moving angle of the rest idle nodes, and limiting the communication distance within the maximum communication distance range;
ensuring the communication transmission quality of the rest idle nodes according to the communication indexes, and putting users meeting conditions into the candidate node set;
the first formula is:
Figure RE-FDA0003772174750000021
wherein (x) r ,y r ) The position of the rest idle node before moving, t is the movement time length, v is the movement speed, theta is the movement angle, (x) d ,y d ) Is the location of the receiving end of D2D, rmax being the maximum communication distance, D' rs The distance between the idle node after moving and the sender of D2D;
the second formula is: the transmission rate of the remaining idle nodes is satisfied
Figure RE-FDA0003772174750000022
Wherein, W is the system bandwidth,
Figure RE-FDA0003772174750000023
for signal-to-noise ratio of relay node, R min Is the lowest transmission rate of the limit;
the third formula is: the total energy consumption of the rest idle nodes for completing the data forwarding task is not more than the rest energy of the rest idle nodes, namely
Figure RE-FDA0003772174750000024
Cr i Representing any one relay node r i Number of CPU cycles required to calculate 1bit data, E ri Represents r i Energy consumed per CPU cycle, x 1 Representing the total bit number of the data which needs to be received and forwarded at this time;
the fourth formula is: the total transmission delay should satisfy
Figure RE-FDA0003772174750000025
Wherein, F ui 、F ri 、F si Respectively representing the data computing capacity of the CPU in each second, Ret being the data forwarding time length, v 1 Representing the speed of light, Delay max For maximum communication transmission delay, x 1 Representing the total number of bits of data to be received and forwarded this time, t total As a total access duration, C ui Represents the number of CPU cycles required by any transmitting end ui to calculate 1bit data, C si Representing the receiving end s i The number of CPU cycles required to calculate 1bit data,
Figure RE-FDA0003772174750000031
is a relay node r i And the distance between the transmitting end ui, d ui,si For the transmitting end ui and the receiving end s i The distance between them.
2. The multi-element scenario D2D communication hierarchical social relationship relay selection method according to claim 1, wherein the social relationship scenario includes: a strong social relationship scenario, a weak social relationship scenario, a temporary social relationship scenario.
3. The relay selection method for D2D communication hierarchical social relations under the multivariate scene as recited in claim 1, wherein the step of screening the relay nodes in the candidate node set according to the hierarchical social relations and selecting the relay nodes under the scene with clear social relations for relay communication comprises the steps of:
screening the relay nodes in the candidate node set according to the classification of the address list or social software in the D2D sending terminal mobile phone, and finding out the node with the direct social relationship and the strongest social relationship;
and if the node with the strongest social relationship exists, performing D2D relay communication by using the node with the strongest social relationship.
4. The method for relay selection of D2D communication hierarchical social relationship under the multivariate scenario of claim 1, wherein if no relay node meeting the condition exists in the candidate node set, a preset three-party benefit maximization model is used to screen out relay nodes for relay communication under the scenario of weak social relationship, comprising:
and if the nodes in the candidate node set have no obvious connection with the D2D sending end in the social relationship, the centrality and the interest similarity, exciting the relay user to participate in the relay communication by using an excitation strategy of a three-party interest maximization model.
5. A D2D communication hierarchical social relationship relay selection system under a multivariate scene, the system comprising:
the node screening module is used for screening out nodes with relay communication capacity according to various indexes in the communication process to obtain a candidate node set;
the first relay communication module is used for screening the relay nodes in the candidate node set according to the hierarchical social relationship and selecting the relay nodes in the scene with definite social relationship for relay communication;
the second relay communication module is used for screening out relay nodes for relay communication in a scene with weak social relationship by using a preset three-party benefit maximization model if the relay nodes meeting the conditions do not exist in the candidate node set;
the node screening module includes:
according to different requirements of communication indexes, capacity limitation is carried out on users in the current communication range, and all idle nodes in a candidate set are ensured to have the capacity of completing the relay communication;
when the idle node meets the limitation of the mobility range, screening out all nodes meeting the limitation that the current communication distance is smaller than the maximum communication distance according to a preset first formula;
calculating nodes meeting the transmission rate requirement according to a preset second formula;
calculating nodes meeting the data processing capacity and the communication time delay according to a preset third formula and a preset fourth formula to obtain remaining idle nodes;
generating the candidate node set according to the residual idle nodes;
the generating the candidate node set according to the remaining idle nodes includes:
determining the moving distance of the rest idle nodes within a certain time according to the current relative moving speed and moving angle of the rest idle nodes, and limiting the communication distance within the maximum communication distance range;
ensuring the communication transmission quality of the rest idle nodes according to the communication indexes, and putting users meeting conditions into the candidate node set;
the first formula is:
Figure RE-FDA0003772174750000041
wherein (x) r ,y r ) The position of the rest idle node before moving, t is the movement duration, v is the movement speed, theta is the movement angle, (x) d ,y d ) Is the position of the receiving end of D2D, r max Is the maximum communication distance, d' rs The distance between the idle node after moving and the sender of D2D;
the second formula is: the transmission rate of the remaining idle nodes is satisfied
Figure RE-FDA0003772174750000051
Wherein, W is the system bandwidth,
Figure RE-FDA0003772174750000052
for signal-to-noise ratio of relay node, R min Is the lowest transmission rate of the limit;
the third formula is: the total energy consumption of the rest idle nodes for completing the data forwarding task is not more than the rest energy of the rest idle nodes, namely
Figure RE-FDA0003772174750000053
C ri Representing any one relay node r i Number of CPU cycles required to calculate 1bit data, E ri Represents r i Energy consumed per CPU cycle, x 1 Representing the total bit number of the data which needs to be received and forwarded at this time;
the fourth formula is: the total transmission delay should be satisfied
Figure RE-FDA0003772174750000054
Wherein, F ui 、F ri 、F si Respectively representing the data computing capacity of the CPU in each second, Ret being the data forwarding time length, v 1 Representing the speed of light, Delay max For maximum communication transmission delay, x 1 Representing the total number of bits, t, of data that needs to be received and forwarded this time total As a total access duration, C ui Represents the number of CPU cycles required by any transmitting end ui to calculate 1bit data, C si Representing the receiving end s i The number of CPU cycles required to calculate 1bit data,
Figure RE-FDA0003772174750000061
as a relay node r i And the distance between the transmitting end ui, d ui,si For the transmitting end ui and the receiving end s i The distance between them.
6. A terminal device, characterized in that the terminal device comprises a memory, a processor and a multi-scenario D2D communication hierarchical social relationship relay selection program stored in the memory and operable on the processor, and the processor implements the steps of the D2D communication hierarchical social relationship relay selection method according to any one of claims 1-4 when executing the multi-scenario D2D communication hierarchical social relationship relay selection program.
7. A computer readable storage medium, characterized in that the computer readable storage medium has stored thereon a D2D communication hierarchical social relationship relay selection program under multivariate scenarios, which D2D communication hierarchical social relationship relay selection program under multivariate scenarios when executed by a processor implements the steps of the D2D communication hierarchical social relationship relay selection method under multivariate scenarios as claimed in any one of claims 1-4.
CN202110332163.XA 2021-03-29 2021-03-29 D2D communication hierarchical social relationship relay selection method and system in multi-element scene Active CN112866960B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110332163.XA CN112866960B (en) 2021-03-29 2021-03-29 D2D communication hierarchical social relationship relay selection method and system in multi-element scene

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110332163.XA CN112866960B (en) 2021-03-29 2021-03-29 D2D communication hierarchical social relationship relay selection method and system in multi-element scene

Publications (2)

Publication Number Publication Date
CN112866960A CN112866960A (en) 2021-05-28
CN112866960B true CN112866960B (en) 2022-09-27

Family

ID=75993086

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110332163.XA Active CN112866960B (en) 2021-03-29 2021-03-29 D2D communication hierarchical social relationship relay selection method and system in multi-element scene

Country Status (1)

Country Link
CN (1) CN112866960B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113543054B (en) * 2021-06-25 2022-08-12 中国联合网络通信集团有限公司 Relay service method and device

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105960024A (en) * 2016-06-08 2016-09-21 北京邮电大学 User discovery and resource allocation method based on social perception in D2D communication
CN108924797A (en) * 2018-06-11 2018-11-30 西安交通大学 A kind of D2D network security transmission method with social awareness
CN109600793A (en) * 2018-12-24 2019-04-09 电子科技大学 D2D communication dynamics relay selection method based on social relationships

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6961367B2 (en) * 2003-02-24 2005-11-01 Qualcomm, Incorporated Forward link repeater frequency watermarking scheme
US20120135677A1 (en) * 2010-04-16 2012-05-31 Samsung Electronics Co., Ltd. Method and system for relay-initiated relay teardown operations in wireless communication networks
CN104640123B (en) * 2015-01-30 2018-07-27 南京邮电大学 A kind of motivational techniques of more relay node non-cooperative games
CN105657777B (en) * 2016-03-14 2018-11-20 西安电子科技大学 Design of Routing Protocol method based on link-quality and node transfer capability
CN110839270B (en) * 2018-08-16 2021-08-06 成都鼎桥通信技术有限公司 Relay node selection method
CN110337092B (en) * 2019-06-24 2022-07-26 南京邮电大学 Low-power-consumption relay selection method based on social trust model

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105960024A (en) * 2016-06-08 2016-09-21 北京邮电大学 User discovery and resource allocation method based on social perception in D2D communication
CN108924797A (en) * 2018-06-11 2018-11-30 西安交通大学 A kind of D2D network security transmission method with social awareness
CN109600793A (en) * 2018-12-24 2019-04-09 电子科技大学 D2D communication dynamics relay selection method based on social relationships

Also Published As

Publication number Publication date
CN112866960A (en) 2021-05-28

Similar Documents

Publication Publication Date Title
Xu et al. Social network-based content delivery in device-to-device underlay cellular networks using matching theory
Xia et al. Federated-learning-based client scheduling for low-latency wireless communications
Sodhro et al. Link optimization in software defined IoV driven autonomous transportation system
CN107295109A (en) Task unloading and power distribution joint decision method in self-organizing network cloud computing
Chakraborty et al. Sustainable task offloading decision using genetic algorithm in sensor mobile edge computing
CN112866960B (en) D2D communication hierarchical social relationship relay selection method and system in multi-element scene
Sun et al. Equilibriums in the mobile-virtual-network-operator-oriented data offloading
Dai et al. Contract theory based incentive scheme for mobile crowd sensing networks
Wu et al. Social-aware graph-based collaborative caching in edge-user networks
Chen et al. Toward User-Centric Resource Allocation for 6G: An Economic Perspective
CN105263100A (en) Content information transmission method and device
Wu et al. SWIPT-empowered sustainable wireless federated learning: Paradigms, challenges, and solutions
Jiang et al. A heterogenous network selection algorithm for internet of vehicles based on comprehensive weight
Ren et al. Recommender system for mobile users: Enjoy Internet of Things socially with wireless device-to-device physical links
Li et al. Intelligent content caching and user association in mobile edge computing networks for smart cities
Su et al. Dynamic resource allocation in queue-constrained and delay-sensitive vehicular networks
CN111465057B (en) Edge caching method and device based on reinforcement learning and electronic equipment
Song et al. Incentive framework for mobile data offloading market under QoE‐aware users
CN112399388B (en) Method, device and system for realizing edge calculation
Xiong et al. Cooperative caching services on high-speed train by reverse auction
Wang et al. Resource allocation for D2D video multicast using multi-leader multi-follower stackelberg game with personalized incentives
Ren et al. Joint spectrum allocation and power control in vehicular communications based on dueling double DQN
Zheng et al. Incentive mechanism design for green mobile D2D caching networks
Chakraborty et al. A Hybrid GRASP-GA based collaborative task offloading technique in fog computing
Song et al. Incentive mechanism design for two-layer mobile data offloading networks: a contract theory approach

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant