CN104320772B - D2D communication nodes clustering method and device based on degree of belief and physical distance - Google Patents

D2D communication nodes clustering method and device based on degree of belief and physical distance Download PDF

Info

Publication number
CN104320772B
CN104320772B CN201410540028.4A CN201410540028A CN104320772B CN 104320772 B CN104320772 B CN 104320772B CN 201410540028 A CN201410540028 A CN 201410540028A CN 104320772 B CN104320772 B CN 104320772B
Authority
CN
China
Prior art keywords
mrow
user
mtd
belief
degree
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
CN201410540028.4A
Other languages
Chinese (zh)
Other versions
CN104320772A (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.)
Beijing University of Posts and Telecommunications
Original Assignee
Beijing University of Posts and Telecommunications
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 Beijing University of Posts and Telecommunications filed Critical Beijing University of Posts and Telecommunications
Priority to CN201410540028.4A priority Critical patent/CN104320772B/en
Publication of CN104320772A publication Critical patent/CN104320772A/en
Application granted granted Critical
Publication of CN104320772B publication Critical patent/CN104320772B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/18—Network planning tools
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimising operational condition

Abstract

The present invention provides a kind of D2D communication nodes clustering method and device based on degree of belief and physical distance, and methods described includes：Obtain the physical distance between the first user and second user；Obtain the degree of belief between the first user and second user；Select probability value between first user and the second user is calculated according to the degree of belief between the physical distance between first user and second user and first user and second user, and thus obtains the select probability value in cell between each two user；D2D communication node clusters are carried out to all users in cell according to the select probability value between each two user in the cell.The method and apparatus of the embodiment of the present invention give the clustering method based on degree of belief and physical distance in the D2D communications fields, effectively realize the lifting of throughput of system and efficiency.

Description

D2D communication nodes clustering method and device based on degree of belief and physical distance
Technical field
The present invention relates to communication technical field, more particularly to a kind of D2D communication nodes based on degree of belief and physical distance Clustering method and device.
Background technology
D2D (Device to Device) communications are widely used in hot spot region and serviced, usual shape between adjacent user Into D2D clusters and communicated.Due to the difference of frequency spectrum share mode, D2D communications have different mode of operations.Overlay frequency spectrums Sharing mode is the special frequency spectrum resource of D2D communication reservations, and D2D user is ensureing not disturb honeycomb to use in Underlay modes Family is multiplexed the frequency spectrum resource of phone user on the premise of communicating.Because the equipment of D2D communications is mostly handheld device, these equipment Degree of belief between holder also functions to very crucial effect to D2D communications.Therefore, in the D2D communications between user equipment, Need in view of the influence indispensable to this of the degree of belief between user.In the correlative study with D2D clusters, what is mostly considered is The discussion of other problemses under D2D cluster scenes, the joint precoding strategy of such as power distribution, D2D and co-channel cellular transmission, only singly Cluster and the technical scheme of D2D communications is carried out between equipment similar in pure consideration physical distance, but do not consider that these users are No to have a mind to cooperate or directly simply assume all users all cooperatives, this is not consistent with actual conditions. In the research of some D2D clusters, do not have to the tool of degree of belief and the degree of belief for indicating degree of belief between D2D equipment holders Body research report, also rarely has the gain that article analyzes D2D communication node clusters more specificly.
The content of the invention
The present invention provides a kind of D2D communication nodes clustering method and device based on degree of belief and physical distance, is applied to Overlay and Underlay frequency spectrum share modes, to solve the research to D2D communication node clustering methods in the prior art not It is related to the technical problem of degree of belief between D2D equipment holders.
In order to solve the above technical problems, the present invention provide it is a kind of based on the D2D communication nodes of degree of belief and physical distance into Cluster method, including：
Obtain the physical distance between the first user and second user；
Obtain the degree of belief between the first user and second user；
According to the physical distance between first user and second user and first user and second user it Between degree of belief calculate select probability value between first user and the second user, and thus obtain every two in cell Select probability value between individual user；
D2D communication sections are carried out to all users in cell according to the select probability value between each two user in the cell Point cluster.
Further, the physical distance according between first user and second user and first user The select probability value that degree of belief between second user is calculated between first user and the second user includes：
Based on Chinese restaurant's process that division customer is distributed according to dining table, according between first user and second user Physical distance and first user and second user between degree of belief calculate first user and used with described second Select probability value between family.
Further, the physical distance obtained between the first user and second user includes：Obtain i-th user and Physical distance between j-th of user, and it is denoted as d (i, j)；
The degree of belief obtained between the first user and second user includes：Obtain i-th of user and j-th user it Between degree of belief, and be denoted as p (i, j), wherein p (i, j) ∈ [0,1].
Further, the physical distance according between first user and second user and first user The select probability value that degree of belief between second user is calculated between first user and the second user also includes：
I-th of user and j-th of use are calculated according to the degree of belief p (i, j) between i-th of user and j-th of user Trust distance between family：S (i, j)=- log2P (i, j), obtain the matrix that the trust distance between each two user is formed S；
J-th of user is selected to be expressed as the probability of its D2D communication parter i-th of user：
Wherein, ciRepresent the D2D communication parters selected by i-th of user, physical distance institutes of the D between each two user The matrix of composition, α be Chinese restaurant's process scalar parameter, function f2The definition of (s (i, j)) is：
dmaxGreatest physical distance between D2D communication nodes.
Further, the degree of belief between first user and second user be used for represent two users between file and/ Or the probability of resource-sharing：When the degree of belief is bigger, file and/or the probability of resource-sharing are bigger between two users；Instead It, then file and/or the probability of resource-sharing are smaller between two users；
The D2D Overlay frequency spectrum shares modes suitable for cellular network and Underlay frequency spectrums are total to methods described simultaneously Enjoy mode.
On the other hand, the present invention also provides a kind of D2D communication node cluster devices based on degree of belief and physical distance, wraps Include：
Physical distance acquiring unit, for obtaining the physical distance between the first user and second user；
Degree of belief acquiring unit, for obtaining the degree of belief between the first user and second user；
Select probability value computing unit, for first user and obtained according to the physical distance acquiring unit Between physical distance and first user of degree of belief acquiring unit acquisition and second user between two users Degree of belief, the select probability value between first user and the second user is calculated, and thus obtain each two in cell Select probability value between user；
Into cluster unit, for according to the select probability value between each two user in the cell to all users in cell Carry out D2D communication node clusters.
Further, the select probability value computing unit is used for：
Based on Chinese restaurant's process that division customer is distributed according to dining table, according between first user and second user Physical distance and first user and second user between degree of belief calculate first user and used with described second Select probability value between family.
Further, the physical distance acquiring unit is used for：Obtain the physics between i-th of user and j-th of user Distance, and it is denoted as d (i, j)；
The degree of belief acquiring unit is used for：Obtain the degree of belief between i-th of user and j-th of user, and by its table It is shown as p (i, j), wherein p (i, j) ∈ [0,1].
Further, the select probability value computing unit is used for：
I-th of user and j-th of use are calculated according to the degree of belief p (i, j) between i-th of user and j-th of user Trust distance between family：S (i, j)=- log2P (i, j), obtain the matrix that the trust distance between each two user is formed S；
J-th of user is selected to be expressed as the probability of its D2D communication parter i-th of user：
Wherein, ciRepresent the D2D communication parters selected by i-th of user, physical distance institutes of the D between each two user The matrix of composition, α be Chinese restaurant's process scalar parameter, function f2The definition of (s (i, j)) is：
dmaxGreatest physical distance between D2D communication nodes.
Further, the degree of belief that the degree of belief acquiring unit is used between the first user obtained and second user is used File and/or the probability of resource-sharing between two users are represented：When the degree of belief is bigger, between two users file and/ Or the probability of resource-sharing is bigger；Conversely, then file and/or the probability of resource-sharing are smaller between two users；
The D2D Overlay frequency spectrum shares modes suitable for cellular network and Underlay frequency spectrums are total to described device simultaneously Enjoy mode.
It can be seen that provided by the invention based in the D2D communication nodes clustering method and device of degree of belief and physical distance, In view of the influence of degree of belief and physical distance to D2D communication node clusters, joint consider to trust distance and physical distance because Element with improve D2D clusters communication performance；Trust distance between two users is defined based on degree of belief, to assess it to cluster Influence；Based on a kind of random process-Chinese restaurant's process that division customer is distributed according to dining table, the present invention is drawn to user It is divided into cluster, and using the thought of the related Chinese restaurant's process of distance, defines some specific user and select other users conduct The probability of its D2D communication parter；Greatest physical distance is double between the number of users upper limit of each D2D cluster and D2D communication nodes Weigh about under beam, obtain final D2D communication node cluster results.As a comparison, The present invention gives based on physical distance into Cluster scheme, and the performance of D2D communication node clusters is analyzed by assessing the file resource shared gain brought.The present invention Method and apparatus give the cluster scheme based on degree of belief and physical distance in the D2D communications fields, effectively realize and be The lifting of handling capacity of uniting and efficiency.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing There is the required accompanying drawing used in technology description to be briefly described, it should be apparent that, drawings in the following description are this hairs Some bright embodiments, for those of ordinary skill in the art, on the premise of not paying creative work, can be with root Other accompanying drawings are obtained according to these accompanying drawings.
Fig. 1 is the system schematic that D2D communicates in single subdistrict；
Fig. 2 is the basic procedure of D2D communication node clustering method of the embodiment of the present invention based on degree of belief and physical distance Schematic diagram；
Fig. 3 is different dmax、NmaxHandling capacity and the relation of total number of users under value；
Fig. 4 is different dmax、NmaxThe relation of energy expenditure and total number of users under value；
Fig. 5 is different dmax、NmaxEfficiency and the relation of total number of users under value；
Fig. 6 is different q1,q2,q3Handling capacity and the relation of total number of users under value；
Fig. 7 is different q1,q2,q3The relation of energy expenditure and total number of users under value；
Fig. 8 is different q1,q2,q3Efficiency and the relation of total number of users under value；
Fig. 9 is handling capacity and d under different total number of users valuesmaxRelation；
Figure 10 is energy expenditure and d under different total number of users valuesmaxRelation；
Figure 11 is efficiency and d under different total number of users valuesmaxRelation；
Figure 12 is the basic procedure of D2D communication node cluster device of the embodiment of the present invention based on degree of belief and physical distance Schematic diagram.
Embodiment
To make the purpose, technical scheme and advantage of the embodiment of the present invention clearer, below in conjunction with the embodiment of the present invention In accompanying drawing, the technical scheme in the embodiment of the present invention is clearly and completely described, it is clear that described embodiment is Part of the embodiment of the present invention, rather than whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art The every other embodiment obtained under the premise of creative work is not made, belongs to the scope of protection of the invention.
In the environment of single subdistrict, N number of user be present, this N number of user both can directly with BS (base station, Base station) communicated by cellular link, D2D clusters can also be formed according to own situation, D2D can be carried out between the user of D2D clusters Communicate to meet self-demand and reduce communication cost.
The system model schematic diagram is as shown in Figure 1.Assuming that the channel between base station and user obeys large scale path loss mould Type, the channel between D2D user are independent same distribution flat fading channels, channel gain only with distance dependent.The noise of channel is Average is zero, variance σ2Additive white Gaussian noise (AWGN).
The channel response defined between user x and user y is hxy, the number of users upper limit of each D2D cluster is Nmax, it is maximum D2D communication distances are dmax, K is the quantity of D2D clusters.Correspondingly, defineIt is user's set of i-th D2D cluster, NiIt is this The number of users of D2D clusters, PBAnd PDIt is the transmit power of BS and D2D users respectively.
One advantage of D2D communication node clusters is that the user of same D2D clusters can be provided by D2D communication shared files Source, without being obtained via BS, this can improve handling capacity, reduce energy consumption.Only assume that neighboring user is formed however, having studied D2D clusters, it is clear that this does not meet reality.
In practical application scene, the wish degree of different user shared file or resource is different, therefore, also needs to examine Consider the influence of the degree of belief of D2D user, it is very important for how dividing user's cluster to improve performance.
Certainly, except degree of belief, physical distance limitation is also a key factor of D2D communications.Thus, in order to improve The performance of D2D clusters communication, consider that degree of belief and physical distance factor, the embodiment of the present invention provide one kind and be based on first by combining The D2D communication node clustering methods of degree of belief and physical distance, referring to Fig. 2, including：
Step 201：Obtain the physical distance between the first user and second user.
Step 202：Obtain the degree of belief between the first user and second user.
Step 203：According to the physical distance between first user and second user and first user and Degree of belief between two users calculates the select probability value between first user and the second user, and thus obtains small Select probability value in area between each two user.
Step 204：All users in cell are carried out according to the select probability value between each two user in the cell D2D communication node clusters.
It can be seen that provided in an embodiment of the present invention based in the D2D communication node clustering methods of degree of belief and physical distance, Considered degree of belief and physical distance factor with improve D2D clusters communication performance, effectively realize throughput of system with And the lifting of efficiency.
Wherein, degree of belief represents the trust value between intra-cell users, in the cell, information transfer number from each other There is higher degree of belief between user more, frequency is higher, also accordingly possess larger trust value.
Preferably, according to the physical distance between first user and second user and first user and second The select probability value that degree of belief between user is calculated between first user and the second user can include：Based on by Chinese restaurant's process (Chinese Restaurant Process, CRP) of division customer is distributed according to dining table, according to the first user Degree of belief between physical distance and the first user and second user between second user calculate first user with Select probability value between the second user.
Select probability defined in Chinese restaurant process CRP is distributed as：It is right based on the selection situation of above n-1 customer The customer of n-th of arrival defines a select probability distribution
Wherein, k0It is by the dining table quantity of customer's occupancy, mkIt is the Number of Customers of k-th of dining table, Z-nArrived for above n-1 Carry out the distribution condition of user.
Different from traditional Chinese restaurant's process, the think of of the related Chinese restaurant's process of distance is used for reference in the embodiment of the present invention Think：The selection of user is not influenceed by other users, only considers the relation between two users.
Preferably, the physical distance obtained between the first user and second user can include：Obtain i-th of user and Physical distance between j user, and it is denoted as d (i, j).
When only considering the factor of physical distance, namely D-CRP clustering methods are used, then define i-th of user and select to use Family j is as the probability of its D2D communication parter：
Wherein, ciRepresent the D2D communication parters selected by i-th of user, D is by the distance that is formed between any two user Matrix, α be Chinese restaurant's process scalar parameter, function f1The definition of (s (i, j)) is：
dmaxGreatest physical distance between D2D communication nodes.
In D-CRP clustering methods, i-th of user is according to the select probability value between other all users, random choosing Which select with user or alone together.
Preferably, the degree of belief obtained between the first user and second user can include：Obtain i-th of user and jth Degree of belief between individual user, and p (i, j) is denoted as, wherein p (i, j) ∈ [0,1].And according to first user and The degree of belief between physical distance and first user and second user between second user passes through SD-CRP cluster sides Method carries out cluster and specifically may include steps of：
I-th of user and j-th of use are calculated according to the degree of belief p (i, j) between i-th of user and j-th of user Trust distance between family：S (i, j)=- log2P (i, j), obtain the matrix that the trust distance between each two user is formed S, wherein, trusting distance can also be construed to：The radius (the radius of trust) of trust, when trusting distance increase, Degree of belief reduces；
J-th of user is selected to be expressed as the probability of its D2D communication parter i-th of user：
Wherein, ciRepresent the D2D communication parters selected by i-th of user, physical distance institutes of the D between each two user The matrix of composition, α be Chinese restaurant's process scalar parameter, function f2The definition of (s (i, j)) is：
dmaxGreatest physical distance between D2D communication nodes.
Preferably, the degree of belief between the first user and second user can be used to indicate that between two users file and/or The probability of resource-sharing：When the degree of belief is bigger, file and/or the probability of resource-sharing are bigger between two users；Conversely, Then file and/or the probability of resource-sharing are smaller between two users.
Different from traditional Chinese restaurant process, D-CRP to SD-CRP clustering methods utilize the related Chinese restaurant's mistake of distance The thought of journey, to model the cluster process of user, the process is non-swappable.
In the SD-CRP clustering methods that the embodiment of the present invention proposes, except considering physical distance, we will trust simultaneously Degree accounts for.Between D2D communication nodes under the constraint of greatest physical distance, for some user, institute of the embodiment of the present invention The SD-CRP methods of proposition can select the user of more maximum probability shared file resource to be used as partner using greater probability.Therefore, it is right In the scheme that the embodiment of the present invention proposes, their file money can be more effectively shared between the user of same D2D clusters Source, without being obtained by BS, without doubt, this can improve the performance of D2D communication node clusters.
Consider to trust distance and physical distance by combining, the clustering method of the embodiment of the present invention can be from effectively improving The gain of D2D communication node clusters.
The D2D communication node cluster performances based on degree of belief and physical distance of the embodiment of the present invention are divided below Analysis：When a user obtains file resource from BS, it can carry out being total to for resource with other users in need of the D2D clusters Enjoy.Therefore, the performance of D2D communication node clusters under the scene can be analyzed, namely the file resource of assessment cluster is shared Caused gain, including handling capacity, energy consumption and efficiency etc..
For the user of same cluster, using the degree of belief between two users as the general of their shared file resources Rate.
In i-th of D2D cluster, for k-th of user, when it obtains a file from BS, it is logical that the cluster has n user to want Crossing file-sharing can be expressed as to obtain the probability of this document：
Wherein, n=0 ... ..., Ni- 1, NiIt is the number of users of the D2D clusters, υjRepresent the υ of i-th of D2D clusterjIndividual user, pi (κ,υj) represent k-th of user and υjDegree of belief between individual user, pi(κ,υ0)=1.
For k-th of user, it obtains the speed of file from BS and can be calculated by following equation：
Wherein, PBIt is BS transmit power,It is that channel between BS and k-th of user is corresponding, σ2It is AWGN noises Power.
Consider in i-th of D2D cluster, the file resource of k-th of user and n user are shared, and it is in a broadcast manner to this n Individual user sends file, and we can calculate the handling capacity as caused by the file transmission between BS and k-th of user and are：
Wherein, n=0 situation does not account for, because not having file-sharing now, just without the increase of handling capacity yet.This Outside, n user by with k-th user carry out D2D communicate obtain needed for file resource when, caused average throughput is：
Wherein, k-th of user and υjSpeed between individual user is
For all users of i-th of D2D cluster, the handling capacity as caused by BS to these users file transmission can be with table It is shown as：
For all users of K D2D cluster, caused total throughout is represented by：
Assuming that there is identical length (L from the BS files obtained0), each D2D cluster is allocated identical bandwidth (W0)。 Thus, for k-th of user, obtaining the transmission time of file and energy expenditure from BS can be represented sequentially as：
When n user of i-th of D2D cluster wants to obtain this document by the way that file resource is shared, then k-th of user's transmission Average transmission time and energy expenditure required for this document can be calculated by following equation：
Similarly, n=0 situation is not included.Wherein, PDIt is the transmit power of D2D user,It is n user The minimum-rate value in speed set between k-th of user, it can be expressed as：
When k-th of user with broadcast transmission this document to n user when, time required for it is to transmit file institute Need to maximum duration weighed, also i.e. file complete transmission is givenThe time that corresponding user needs.
The energy consumption corresponding to handling capacity as caused by BS to the user of all D2D clusters file transmission, which can be calculated, is：
Although the file resource of D2D clusters is shared can to bring higher handling capacity, corresponding energy expenditure is equally produced.Cause And the performance of D2D communication node cluster schemes can be assessed using efficiency, its definition is represented by：
Without loss of generality, when not utilizing D2D clusters, i.e., in the case of not cluster, user obtains file from BS, we Calculating the in this case handling capacity of i-th D2D cluster and all user's total throughouts respectively is：
Wherein, n user of i-th of D2D cluster from BS obtain the file of k-th of user caused by average throughput be：
And have：υjThe speed that individual user obtains file from BS is
Wherein,It is BS and υjChannel response between individual user.
Likewise, in the case of not cluster can be calculated, when n user of i-th of D2D cluster goes for this document, its Energy expenditure is：
Similarly, the total power consumption of the user of all D2D clusters is：
It is apparent that the efficiency in the case of not cluster can also be obtained：
So far, particularly important D2D communication node cluster results for the embodiment of the present invention, and system have been obtained Handling capacity, energy consumption, efficiency etc. weigh target, and the validity of D2D communication node clustering methods can be assessed according to performance evaluation And feasibility.
, can be to being communicated in the embodiment of the present invention based on the D2D of degree of belief and physical distance according to above-mentioned each measurement target The cluster result of node clustering method and cluster result of the prior art carry out indices assessment and compared.
The embodiment of the present invention respectively for SD-CRP clustering methods, D-CRP clustering methods, random clustering method and not into Cluster method is emulated.Random clustering method and not clustering method are simply introduced first：Random clustering method, as exists Between D2D communication nodes under the limitation of greatest physical distance, user randomly chooses a user as D2D communication parters；Without into Cluster method, namely each user directly interact with BS and communicated.
Under the simulated environment of the present embodiment, it is (100,0), the circle that radius is 100m that user, which is evenly distributed on central point, In region, BS position is (300,0).Also, the large scale decline index between BS and phone user is β=3.5, and D2D Between user is then β=4.Calculated to simplify, we only consider the decline based on distance.Chinese restaurant's process is set in addition The variance of parameter alpha=0.1, AWGN be σ2=-60dBm.The transmit power of BS and D2D user equipmenies is respectively：PB= 0.2W, PD=0.1W.File size is L0=1MB, a width of W of band that each D2D cluster is distributed0=1MHz.
The performance of different schemes is contrasted for simplicity a kind of, it may be considered that special scene：By the letter between user Degree is appointed to be divided into three reliability ratings, the degree of belief corresponding to three reliability ratings is respectively q1,q2,q3Namely i-th user with Degree of belief p (i, j) between j-th of user can be equal to q1Or equal to q2Or equal to q3。
First, we analyze the greatest physical distance d between different D2D communication nodesmaxWith the number of users of each D2D cluster Upper limit NmaxUnder value, performance that Different Strategies change with total number of users, now q1=0.8, q2=0.6, q3=0.4.
From figure 3, it can be seen that in dmax、NmaxWhen taking different numerical value, the handling capacity of SD-CRP clustering methods is always greater than it Handling capacity in his method.When total number of users gradually increases, all corresponding increases therewith of the methodical handling capacity of institute.In addition, dmax Change the influence for handling capacity and be greater than NmaxInfluenceed caused by change.When total number of users is smaller, increase dmaxOr reduce NmaxThe handling capacity of SD-CRP clustering methods and D-CRP clustering methods can be improved, vice versa.
Fig. 4 gives institute methodical Energy Expenditure Levels, and the energy consumption of clustering method is not significantly larger than other clustering methods Energy consumption, this illustrates advantage of the D2D communication node clusters in terms of energy expenditure.In addition, compared to D-CRP clustering methods and Random clustering method, because in method used by the embodiment of the present invention, D2D clusters can be more effectively carried out file resource and be total to Enjoy, so as to result in higher energy consumption.For the performance of more completely appraisal procedure, in Figure 5, the methodical energy of institute is described Effect, from figure 5 it can be seen that compared with other all methods, the clustering method of the embodiment of the present invention has larger efficiency.
Then can analyze in different degree of belief q1,q2,q3Under value, performance that distinct methods change with total number of users, Now maximum D2D communication distances dmaxThe number of users higher limit N of=20m, D2D clustermax=10.
As shown in fig. 6, in two groups of different q1,q2,q3Under value, the handling capacity of SD-CRP clustering methods is all higher than other The handling capacity of method.Meanwhile q1,q2,q3Increase for methodical handling capacity improve and suffer from positive facilitation.
Fig. 7 shows the methodical energy expenditure of institute, and the energy consumption of clustering method is not still bigger than the energy consumption of other method. Similarly, because the file resource of cluster is shared, the clustering method of the embodiment of the present invention has larger energy than other clustering methods Consumption.Fig. 8 gives the efficiency under distinct methods, it can be seen that q1,q2,q3Value it is bigger, SD-CRP clustering methods and D-CRP The efficiency numerical value of clustering method is bigger.The simulation result also demonstrates the clustering method of proposition of the embodiment of the present invention in terms of efficiency There is better performance than other method.
In addition, can also analyze under different total number of users values, distinct methods are with maximum D2D communication distances dmaxBecome The performance of change, now, Nmax=10, q1=0.8, q2=0.6, q3=0.4.
The simulation result curve obtained from Fig. 9, it can be seen that when total number of users is fixed, with dmaxIncrease, SD-CRP The handling capacity of clustering method and D-CRP clustering methods first increases to be reduced afterwards.For all methods, the increase of total number of users can carry High throughput of system.In the method for all contrasts, work as dmaxWhen value is not very big, the SD-CRP clustering methods of proposition are shown More preferable throughput performance.
Figure 10 describes the methodical energy expenditure of institute, and similarly, the energy consumption of clustering method is not more than other method.Scheming In 11, it may be seen that the performance efficiency of all control methods, simulation result curve shows, works as dmaxWhen value is not too big, with Other method is compared, and the SD-CRP clustering methods that the embodiment of the present invention proposes can realize higher efficiency.
The embodiment of the present invention also provides a kind of D2D communication node cluster devices based on degree of belief and physical distance, referring to Figure 12, including：
Physical distance acquiring unit 1201, for obtaining the physical distance between the first user and second user；
Degree of belief acquiring unit 1202, for obtaining the degree of belief between the first user and second user；
Select probability value computing unit 1203, for first user obtained according to the physical distance acquiring unit First user that physical distance between second user and the degree of belief acquiring unit obtain and second user it Between degree of belief, calculate the select probability value between first user and the second user, and thus obtain every in cell Select probability value between two users；
Into cluster unit 1204, for according to the select probability value between each two user in the cell to owning in cell User carries out D2D communication node clusters.
Wherein, select probability value computing unit 1203 respectively with physical distance acquiring unit 1201, degree of belief acquiring unit 1202 are connected with into cluster unit 1204.
Alternatively, select probability value computing unit 1203 can be used for：Based on the China that division customer is distributed according to dining table Restaurant process, according to the physical distance between first user and second user and first user and second user it Between degree of belief calculate select probability value between first user and the second user.
Alternatively, physical distance acquiring unit 1201 can be used for：Obtain the thing between i-th of user and j-th of user Distance is managed, and is denoted as d (i, j)；Degree of belief acquiring unit 1202 can be used for：Obtain i-th of user and j-th of user Between degree of belief, and be denoted as p (i, j), wherein p (i, j) ∈ [0,1].
Alternatively, select probability value computing unit 1203 can be used for：
I-th of user and j-th of use are calculated according to the degree of belief p (i, j) between i-th of user and j-th of user Trust distance between family：S (i, j)=- log2P (i, j), obtain the matrix that the trust distance between each two user is formed S；
J-th of user is selected to be expressed as the probability of its D2D communication parter i-th of user：
Wherein, ciRepresent the D2D communication parters selected by i-th of user, physical distance institutes of the D between each two user The matrix of composition, α be Chinese restaurant's process scalar parameter, function f2The definition of (s (i, j)) is：
dmaxGreatest physical distance between D2D communication nodes.
Alternatively, the degree of belief that degree of belief acquiring unit 1204 can be used between the first user obtained and second user For file and/or the probability of resource-sharing between two users of expression：When the degree of belief is bigger, file between two users And/or the probability of resource-sharing is bigger；Conversely, then file and/or the probability of resource-sharing are smaller between two users.
Thus it is clear that in the D2D communication nodes clustering method provided in an embodiment of the present invention based on degree of belief and physical distance and In device, it is contemplated that the influence of degree of belief and physical distance to D2D communication node clusters, joint consider to trust distance and physics Distance factor with improve D2D clusters communication performance；Trust distance between two users is defined based on degree of belief, it is right to assess its The influence of cluster；Based on a kind of random process-Chinese restaurant's process that division customer is distributed according to dining table, the embodiment of the present invention Division cluster is carried out to user, and using the thought of the related Chinese restaurant's process of distance, defines some specific user selection Probability of the other users as its D2D communication parter；It is maximum between the number of users upper limit of each D2D cluster and D2D communication nodes Under the double constraints of physical distance, final D2D cluster results are obtained.As a comparison, the embodiment of the present invention is given based on thing The cluster scheme of distance is managed, and the performance of D2D communication node clusters is carried out by assessing the file resource shared gain brought Analysis.The method and apparatus of the embodiment of the present invention give the cluster side based on degree of belief and physical distance in the D2D communications fields Case, effectively realize the lifting of throughput of system and efficiency.The method and apparatus of the embodiment of the present invention are applied to honeybee simultaneously D2D Overlay frequency spectrum shares modes and Underlay frequency spectrum share modes in nest network.
Finally it should be noted that：The above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although The present invention is described in detail with reference to the foregoing embodiments, it will be understood by those within the art that：It still may be used To be modified to the technical scheme described in foregoing embodiments, or equivalent substitution is carried out to which part technical characteristic； And these modification or replace, do not make appropriate technical solution essence depart from various embodiments of the present invention technical scheme spirit and Scope.

Claims (4)

  1. A kind of 1. D2D communication node clustering methods based on degree of belief and physical distance, it is characterised in that including：
    Obtain the physical distance between the first user and second user；
    The degree of belief between the first user and second user is obtained, the degree of belief between first user and second user is used for File and/or the probability of resource-sharing between two users of expression：When the degree of belief is bigger, between two users file and/or The probability of resource-sharing is bigger；Conversely, then file and/or the probability of resource-sharing are smaller between two users；
    According between the physical distance between first user and second user and first user and second user Degree of belief calculates the select probability value between first user and the second user, and thus obtains each two in cell and use Select probability value between family；
    All users in cell are carried out according to the select probability value between each two user in the cell D2D communication nodes into Cluster；
    Wherein, the physical distance according between first user and second user and first user and second use The select probability value that degree of belief between family is calculated between first user and the second user includes：
    Based on Chinese restaurant's process that division customer is distributed according to dining table, according to the thing between first user and second user Reason distance and degree of belief between first user and second user calculate first user and the second user it Between select probability value；
    The physical distance obtained between the first user and second user includes：Obtain between i-th of user and j-th of user Physical distance, and be denoted as d (i, j)；
    The degree of belief obtained between the first user and second user includes：Obtain between i-th of user and j-th of user Degree of belief, and p (i, j) is denoted as, wherein p (i, j) ∈ [0,1]；
    The physical distance according between first user and second user and first user and second user it Between the select probability value that calculates between first user and the second user of degree of belief also include：
    According to the degree of belief p (i, j) between i-th of user and j-th of user calculate i-th of user and j-th user it Between trust distance：S (i, j)=- log2P (i, j), obtain the matrix S that the trust distance between each two user is formed；
    J-th of user is selected to be expressed as the probability of its D2D communication parter i-th of user：
    <mrow> <mi>P</mi> <mrow> <mo>(</mo> <msub> <mi>c</mi> <mi>i</mi> </msub> <mo>=</mo> <mi>j</mi> <mo>|</mo> <mi>S</mi> <mo>,</mo> <mi>D</mi> <mo>,</mo> <mi>&amp;alpha;</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mrow> <mfrac> <mrow> <msub> <mi>f</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <mi>s</mi> <mo>(</mo> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> <mo>)</mo> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi>&amp;Sigma;</mi> <mrow> <mi>j</mi> <mo>&amp;NotEqual;</mo> <mi>i</mi> </mrow> </msub> <msub> <mi>f</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <mi>s</mi> <mo>(</mo> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> <mo>)</mo> <mo>)</mo> </mrow> <mo>+</mo> <mi>&amp;alpha;</mi> </mrow> </mfrac> <mo>,</mo> </mrow> </mtd> <mtd> <mrow> <mi>i</mi> <mi>f</mi> </mrow> </mtd> <mtd> <mrow> <mi>i</mi> <mo>&amp;NotEqual;</mo> <mi>j</mi> <mo>,</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mfrac> <mi>&amp;alpha;</mi> <mrow> <msub> <mi>&amp;Sigma;</mi> <mrow> <mi>j</mi> <mo>&amp;NotEqual;</mo> <mi>i</mi> </mrow> </msub> <msub> <mi>f</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <mi>s</mi> <mo>(</mo> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> <mo>)</mo> <mo>)</mo> </mrow> <mo>+</mo> <mi>&amp;alpha;</mi> </mrow> </mfrac> <mo>,</mo> </mrow> </mtd> <mtd> <mrow> <mi>i</mi> <mi>f</mi> </mrow> </mtd> <mtd> <mrow> <mi>i</mi> <mo>=</mo> <mi>j</mi> <mo>,</mo> </mrow> </mtd> </mtr> </mtable> </mfenced> </mrow>
    Wherein, ciThe D2D communication parters selected by i-th of user are represented, D is made up of the physical distance between each two user Matrix, α be Chinese restaurant's process scalar parameter, function f2The definition of (s (i, j)) is：
    <mrow> <msub> <mi>f</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <mi>s</mi> <mo>(</mo> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> <mo>)</mo> <mo>)</mo> </mrow> <mo>=</mo> <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mrow> <mfrac> <mn>1</mn> <mrow> <mi>s</mi> <mrow> <mo>(</mo> <mi>i</mi> <mo>,</mo> <mi>j</mi> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>,</mo> </mrow> </mtd> <mtd> <mrow> <mi>i</mi> <mi>f</mi> </mrow> </mtd> <mtd> <mrow> <mi>d</mi> <mrow> <mo>(</mo> <mi>i</mi> <mo>,</mo> <mi>j</mi> <mo>)</mo> </mrow> <mo>&amp;le;</mo> <msub> <mi>d</mi> <mi>max</mi> </msub> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mn>0</mn> <mo>,</mo> </mrow> </mtd> <mtd> <mrow> <mi>i</mi> <mi>f</mi> </mrow> </mtd> <mtd> <mrow> <mi>d</mi> <mrow> <mo>(</mo> <mi>i</mi> <mo>,</mo> <mi>j</mi> <mo>)</mo> </mrow> <mo>&gt;</mo> <msub> <mi>d</mi> <mi>max</mi> </msub> </mrow> </mtd> </mtr> </mtable> </mfenced> </mrow>
    dmaxGreatest physical distance between D2D communication nodes.
  2. 2. the D2D communication node clustering methods according to claim 1 based on degree of belief and physical distance, its feature exist In：
    Methods described while the D2D Overlay frequency spectrum shares modes suitable for cellular network and Underlay frequency spectrum share sides Formula.
  3. A kind of 3. D2D communication node cluster devices based on degree of belief and physical distance, it is characterised in that including：
    Physical distance acquiring unit, for obtaining the physical distance between the first user and second user；
    Degree of belief acquiring unit, for obtaining the degree of belief between the first user and second user, the degree of belief acquiring unit It is used to representing file and/or resource-sharing between two users for the degree of belief between the first user of acquisition and second user Probability：When the degree of belief is bigger, file and/or the probability of resource-sharing are bigger between two users；Conversely, then two users Between file and/or the probability of resource-sharing it is smaller；
    Select probability value computing unit, used for first user obtained according to the physical distance acquiring unit and second The trust between physical distance and first user of degree of belief acquiring unit acquisition and second user between family Degree, the select probability value between first user and the second user is calculated, and thus obtain each two user in cell Between select probability value；
    Into cluster unit, for being carried out according to the select probability value between each two user in the cell to all users in cell D2D communication node clusters；
    Wherein, the select probability value computing unit is used for：
    Based on Chinese restaurant's process that division customer is distributed according to dining table, according to the thing between first user and second user Reason distance and degree of belief between first user and second user calculate first user and the second user it Between select probability value；
    The physical distance acquiring unit is used for：Obtain the physical distance between i-th of user and j-th of user, and by its table It is shown as d (i, j)；
    The degree of belief acquiring unit is used for：The degree of belief between i-th of user and j-th of user is obtained, and is denoted as p (i, j), wherein p (i, j) ∈ [0,1]；
    The select probability value computing unit is additionally operable to：
    According to the degree of belief p (i, j) between i-th of user and j-th of user calculate i-th of user and j-th user it Between trust distance：S (i, j)=- log2P (i, j), obtain the matrix S that the trust distance between each two user is formed；
    J-th of user is selected to be expressed as the probability of its D2D communication parter i-th of user：
    <mrow> <mi>P</mi> <mrow> <mo>(</mo> <msub> <mi>c</mi> <mi>i</mi> </msub> <mo>=</mo> <mi>j</mi> <mo>|</mo> <mi>S</mi> <mo>,</mo> <mi>D</mi> <mo>,</mo> <mi>&amp;alpha;</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mrow> <mfrac> <mrow> <msub> <mi>f</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <mi>s</mi> <mo>(</mo> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> <mo>)</mo> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi>&amp;Sigma;</mi> <mrow> <mi>j</mi> <mo>&amp;NotEqual;</mo> <mi>i</mi> </mrow> </msub> <msub> <mi>f</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <mi>s</mi> <mo>(</mo> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> <mo>)</mo> <mo>)</mo> </mrow> <mo>+</mo> <mi>&amp;alpha;</mi> </mrow> </mfrac> <mo>,</mo> </mrow> </mtd> <mtd> <mrow> <mi>i</mi> <mi>f</mi> </mrow> </mtd> <mtd> <mrow> <mi>i</mi> <mo>&amp;NotEqual;</mo> <mi>j</mi> <mo>,</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mfrac> <mi>&amp;alpha;</mi> <mrow> <msub> <mi>&amp;Sigma;</mi> <mrow> <mi>j</mi> <mo>&amp;NotEqual;</mo> <mi>i</mi> </mrow> </msub> <msub> <mi>f</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <mi>s</mi> <mo>(</mo> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> <mo>)</mo> <mo>)</mo> </mrow> <mo>+</mo> <mi>&amp;alpha;</mi> </mrow> </mfrac> <mo>,</mo> </mrow> </mtd> <mtd> <mrow> <mi>i</mi> <mi>f</mi> </mrow> </mtd> <mtd> <mrow> <mi>i</mi> <mo>=</mo> <mi>j</mi> <mo>,</mo> </mrow> </mtd> </mtr> </mtable> </mfenced> </mrow>
    Wherein, ciThe D2D communication parters selected by i-th of user are represented, D is made up of the physical distance between each two user Matrix, α be Chinese restaurant's process scalar parameter, function f2The definition of (s (i, j)) is：
    <mrow> <msub> <mi>f</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <mi>s</mi> <mo>(</mo> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> <mo>)</mo> <mo>)</mo> </mrow> <mo>=</mo> <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mrow> <mfrac> <mn>1</mn> <mrow> <mi>s</mi> <mrow> <mo>(</mo> <mi>i</mi> <mo>,</mo> <mi>j</mi> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>,</mo> </mrow> </mtd> <mtd> <mrow> <mi>i</mi> <mi>f</mi> </mrow> </mtd> <mtd> <mrow> <mi>d</mi> <mrow> <mo>(</mo> <mi>i</mi> <mo>,</mo> <mi>j</mi> <mo>)</mo> </mrow> <mo>&amp;le;</mo> <msub> <mi>d</mi> <mi>max</mi> </msub> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mn>0</mn> <mo>,</mo> </mrow> </mtd> <mtd> <mrow> <mi>i</mi> <mi>f</mi> </mrow> </mtd> <mtd> <mrow> <mi>d</mi> <mrow> <mo>(</mo> <mi>i</mi> <mo>,</mo> <mi>j</mi> <mo>)</mo> </mrow> <mo>&gt;</mo> <msub> <mi>d</mi> <mi>max</mi> </msub> </mrow> </mtd> </mtr> </mtable> </mfenced> </mrow>
    dmaxGreatest physical distance between D2D communication nodes.
  4. 4. the D2D communication node cluster devices according to claim 3 based on degree of belief and physical distance, its feature exist In：
    Described device while the D2D Overlay frequency spectrum shares modes suitable for cellular network and Underlay frequency spectrum share sides Formula.
CN201410540028.4A 2014-10-13 2014-10-13 D2D communication nodes clustering method and device based on degree of belief and physical distance Active CN104320772B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410540028.4A CN104320772B (en) 2014-10-13 2014-10-13 D2D communication nodes clustering method and device based on degree of belief and physical distance

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410540028.4A CN104320772B (en) 2014-10-13 2014-10-13 D2D communication nodes clustering method and device based on degree of belief and physical distance

Publications (2)

Publication Number Publication Date
CN104320772A CN104320772A (en) 2015-01-28
CN104320772B true CN104320772B (en) 2018-02-06

Family

ID=52375926

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410540028.4A Active CN104320772B (en) 2014-10-13 2014-10-13 D2D communication nodes clustering method and device based on degree of belief and physical distance

Country Status (1)

Country Link
CN (1) CN104320772B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104936252A (en) * 2015-05-28 2015-09-23 清华大学 Cooperative relay selection method
US20190207946A1 (en) * 2016-12-20 2019-07-04 Google Inc. Conditional provision of access by interactive assistant modules
CN107241219B (en) * 2017-05-26 2019-12-03 广州杰赛科技股份有限公司 Users to trust degree prediction technique and device
CN109413170B (en) * 2018-10-15 2021-03-02 南京邮电大学 D2D seed node cluster generation method, readable storage medium and terminal

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102857874A (en) * 2012-05-18 2013-01-02 北京邮电大学 Distributed management method for direct connection communication users in cellular network
CN104010300A (en) * 2014-06-09 2014-08-27 宇龙计算机通信科技(深圳)有限公司 Data transmission method

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9532302B2 (en) * 2013-03-20 2016-12-27 Broadcom Corporation Communication network having proximity service discovery and device self-organization
CN103428642B (en) * 2013-07-16 2016-01-13 无锡北邮感知技术产业研究院有限公司 Based on relaying bunch in D2D multicasting method
CN103476140B (en) * 2013-09-05 2017-04-12 北京邮电大学 Method for making choice between D2D cooperating multicast mode and fixed relay cooperating multicast mode in cellular system

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102857874A (en) * 2012-05-18 2013-01-02 北京邮电大学 Distributed management method for direct connection communication users in cellular network
CN104010300A (en) * 2014-06-09 2014-08-27 宇龙计算机通信科技(深圳)有限公司 Data transmission method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
Cooperative communications based on trust model for mobile ad hoc networks;K.Wang,M.Wu;《IET Information Security》;20100621;第4卷(第2期);全文 *

Also Published As

Publication number Publication date
CN104320772A (en) 2015-01-28

Similar Documents

Publication Publication Date Title
Han et al. Matching theory for wireless networks
Xu et al. An edge computing-enabled computation offloading method with privacy preservation for internet of connected vehicles
Yuan et al. Meta-reinforcement learning based resource allocation for dynamic V2X communications
Semiari et al. Context-aware small cell networks: How social metrics improve wireless resource allocation
Gu et al. Matching theory for future wireless networks: Fundamentals and applications
Xu et al. Social network-based content delivery in device-to-device underlay cellular networks using matching theory
Liu et al. Joint user association and resource allocation for wireless hierarchical federated learning with IID and non-IID data
CN104320772B (en) D2D communication nodes clustering method and device based on degree of belief and physical distance
Chen et al. Energy-efficient user association and resource allocation for multistream carrier aggregation
He et al. Energy-efficient power allocation with individual and sum power constraints
Dai et al. Energy‐efficient resource allocation for device‐to‐device communication with WPT
CN116579417A (en) Layered personalized federal learning method, device and medium in edge computing network
Ko et al. Joint client selection and bandwidth allocation algorithm for federated learning
Yu et al. Deep reinforcement learning-based RAN slicing for UL/DL decoupled cellular V2X
Wu et al. D2D relay selection based on joint fuzzy and entropy theories with social similarity
Lin et al. Data-driven joint resource allocation in large-scale heterogeneous wireless networks
Yuan et al. Multiobjective optimization of linear cooperative spectrum sensing: Pareto solutions and refinement
Ba et al. Multiservice-based traffic scheduling for 5G access traffic steering, switching and splitting
Zhang et al. Joint Resource Allocation and Reflecting Design in IRS-UAV Communication Networks with SWIPT
Zhang et al. GNN-Based Power Allocation and User Association in Digital Twin Network for the Terahertz Band
Shankar et al. Examination of User Pairing NOMA System Considering the DQN Scheme Over Time-Varying Fading Channel Conditions.
Ma et al. Power allocation for downlink of non-orthogonal multiple access system via genetic algorithm
Wang et al. A novel resource allocation scheme in NOMA-based cellular network with D2D communications
CN107249212B (en) The maximized power distribution method of efficiency in a kind of D2D communication
CN107249213B (en) A kind of maximized power distribution method of D2D communication Intermediate Frequency spectrum efficiency

Legal Events

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