CN105813129B - A kind of resource allocation methods based on D2D sub-clustering - Google Patents
A kind of resource allocation methods based on D2D sub-clustering Download PDFInfo
- Publication number
- CN105813129B CN105813129B CN201610338825.3A CN201610338825A CN105813129B CN 105813129 B CN105813129 B CN 105813129B CN 201610338825 A CN201610338825 A CN 201610338825A CN 105813129 B CN105813129 B CN 105813129B
- Authority
- CN
- China
- Prior art keywords
- user
- resource
- interference
- cluster
- sub
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/10—Scheduling measurement reports ; Arrangements for measurement reports
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/535—Allocation or scheduling criteria for wireless resources based on resource usage policies
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of resource allocation methods based on D2D sub-clustering, belong to mobile communication technology field.This method mainly comprises the steps that (1) UE measurement reports；(2) it constructs interference figure and sub-clustering is carried out based on graph coloring；(3) resource allocation；(4) relay forwarding scheme, according to resources costs consumed by forwarding to D2D to progress relay forwarding.The resource allocation methods that the present invention designs are under the premise of guaranteeing each D2D couples of phone user of Qos, it is interfered between considering D2D pairs, and sub-clustering is carried out based on graph coloring, multiple D2D links are allowed to be multiplexed the RB of the same phone user, consider that D2D forwards data as relay node, to improve the availability of frequency spectrum of user satisfaction and cellular system.
Description
Technical field
The invention belongs to mobile communication technology fields, are related to a kind of based on D2D (Device-to-Device, terminal direct connection)
The resource allocation methods of sub-clustering.
Background technique
With the arrival of Internet era, people start to pursue the mobile data services of higher rate, limited frequency spectrum money
Source can no longer meet growing business demand, and frequency spectrum resource shortage then becomes the severe challenge that mobile communication faces, section
Learning reasonable frequency spectrum resource allocation plan becomes the emphasis of next generation mobile communication research.One of effective method is in bee
D2D (Device-to-Device, terminal direct connection) technology is introduced in nest network, i.e., it is a kind of to allow eventually under the control of cellular system
End subscriber carries out the new technology of direct communication by sharing cell spectrum resource, it is improved the availability of frequency spectrum, increases communication and holds
The advantages that amount, mitigation load of base station, in addition, the D2D communication technology can also reduce the transmission power of terminal by power control,
To improve the service life of end cell.It is as shown in Figure 1 using D2D communication scheme in cellular networks.
D2D resource allocation mode is related to the influence to phone user, thus D2D resource allocation is to answer in cellular networks
With the critical issue of D2D.There are three types of modes: honeycomb mode, orthogonal mode for the resource allocation mode of D2D communication in cellular networks
Formula, multiplexer mode.Fig. 2 illustrates the interference scene under multiplexer mode:
When D2D uses multiplexer mode: D2D communication will cause the D2D pairs of interference mutual with base station.In current D2D
In Communication Studies, most research is for D2D to the frequency resource of multiplexing CUE (Celluar UserEquipment).
What is be disturbed when D2D multiplexing CUE uplink resource is base station side, and what multiplexed downlink resource was disturbed is the side CUE.By
It is more idle in uplink resource, therefore most research is all multiplexed uplink resource using D2D.Existing research is usual
It is to carry out resource allocation by power control to communicate interference to cellular network communication with this to reduce D2D, such as considers distance
To control power.Cellular system will not all be interfered using honeycomb mode and dedicated mode, but raising resource cannot be reached
The purpose of utilization rate.
Currently, existing technical solution has the drawback that and uses multiplexer mode, although mutual interference can only pass through
Reasonable resource allocation weakens but cannot completely eliminate, and inevitably causes adverse effect to cellular communication.Majority research
Model is all that a phone user can only be multiple CUE in practical application scene and D2D pairs multipair by a D2D to multiplexing
It exists simultaneously.
Summary of the invention
In view of this, the purpose of the present invention is to provide a kind of resource allocation methods based on D2D sub-clustering, specifically include as
Lower technical solution:
A kind of resource allocation methods based on D2D sub-clustering, method includes the following steps:
S1:UE measurement reports: base station reports the interference information between obtaining D2D pairs by user terminal UE measurement, and judges
Whether there are intolerable interference between two D2D pairs；
S2: building interference figure simultaneously carries out sub-clustering based on graph coloring: atlas is interfered according to the interference constructing between D2D pairs, wherein
One node indicates a D2D communication pair, has line to indicate that two D2D communication presence between can not be held between node and node
The interference born cannot use identical resource；There is no line to indicate that interference is smaller between two nodes, identical money can be multiplexed
Then source carries out sub-clustering to interference atlas according to graph coloring；
S3: resource allocation: considering interference of the phone user to D2D pairs, selection and meanwhile meet D2D to and phone user Qos
D2D pairs, and update interference figure, sub-clustering again, wherein the D2D user in each cluster is multiplexed identical sub-band resources；
S4: relay forwarding scheme: can not be assigned to resource since above-mentioned Resource Allocation Formula will lead to part D2D user,
Using the user for being successfully assigned to resource as relay node, forwarded by the user that D2D chain road direction is assigned to resource not successfully
Data, and frequency efficiency is maximumlly improved according to relay forwarding scheme.
Further, in step sl, the UE measurement, which reports, includes:
Base station preset one D2D pairs between interference threshold value δth, and this threshold value is broadcast to all D2D and is used
Family pair, if δdi≤δth, then it is assumed that D2D to i and to D2D to i interfere maximum D2D between j there are intolerable interference,
And D2D is put into D2D to the interference collection of i to j；
If formula δdi≥δthIt is invalid, then illustrate that D2D user is currently also unable to satisfy QoS request to i, should remove at this time pair
D2D interferes strongest D2D user to be put into D2D user to the interference collection I of i to k to K, and by D2D user iiIn, while by D2D
User is to there are intolerable interference, removing D2D user to calculating δ again after k between i and kdiValue, until the value is greater than
Given threshold value δth。
Further, in step s 2, the building interference figure and based on graph coloring carry out sub-clustering, comprising: by D2D user couple
It is divided into several disjoint clusters, using graph coloring algorithm is D2D user to sub-clustering, respectively represents one using different colors
Cluster；The theory of sub-clustering are as follows: there are sides, i.e. l if D2D user is between i and kdi,dk=1, then D2D cannot divide k i and D2D
For the same cluster, and the quantity of cluster is reduced under given disturbed condition as far as possible, even if being interference figure with color as few as possible
In each node-coloring；It is first the most node-coloring in side, then considers the more node in side time, according to present node and
The interference relationships of color node determine its color, and so on, until the success of all node-colorings.
Further, in step s3, the resource allocation is the scheme based on signal-to-noise ratio SINR, presets a SINR
Threshold value, it is first assumed that all D2D exist between that is, all D2D pairs and interfere with each other to identical resource is multiplexed,
Resource allocation phase screens the D2D user in each cluster, only those QoS requests for being able to satisfy D2D itself, simultaneously
It can guarantee the D2D not impacted to the normal communication of phone user to could finally access network again；The same cluster gkNot
With resource block on can and phone user's shared resource D2D to being different.
Further, as follows for can finally access the screening process of the D2D user of network in cluster:
1) it initializes: considering some specific cluster gkThe case where shared RBj, and create two new cluster gkjAnd gkjs；
2) cluster g is considered simultaneouslykIn interference of the phone user to D2D to i on other D2D and RBj, calculate D2DiSINR,
If γdi≥γdth, then D2DiIt is put into cluster gkjIn；
3) D2D is calculatediTo the interference value of the phone user on RBj, and by interference value in the way of ascending order, by gkjIn
D2D user rearranges；
4) according to the sequence sequenced, the SINR of phone user after current D2D is added is calculated, until γci≤γcth, then stop
Only；So by γci≥γcthWhen the D2D user that is added be added to set gkjsIn, expression can be with share spectrum resources.
Further, in step s 4, the relay forwarding scheme is to be assigned to resource to failing due to part D2D,
Firstly, in order to make, using the user for being successfully assigned to resource as relay node, to be passed through in cluster with base station data is obtained per family
The failed user of D2D chain road direction forwards data:
Assuming that a cluster including x user, wherein a user is successfully assigned to resource, is denoted as sA={ x1,x2,...,
xa, b user fails distribution, is denoted as sNA={ y1,y2,...,yb, it is assumed that channel quality is between D2D user in cluster
Know, then for x ∈ sAWith y ∈ sNA, link-quality matrix is constructed, as follows:
Wherein txyIndicate D2D user x and y between spectrum efficiency, that is, between the x and y of the D2D link it is achievable
Data rate；It is as follows then to transmit consumed running time-frequency resource cost formula when data:
Above formula describes D2D couples of number L (1≤L≤S as relay node forwardingA) corresponding when taking different numerical value
Resources costs, wherein C is the information bit to be transmitted, nkIt is D2D pairs as relay node；
Following formula situation corresponding when indicating using resources costs as optimization aim solution resources costs minimum, as optimal turn
Hair routing:
Wherein: FoptIndicate least resource cost when optimal forwarding routing.
Secondly, presetting a certain data rate threshold in order to further increase resource efficiency, preferentially selecting channel quality
Well the D2D link of (namely running time-frequency resource consumption is minimum) is forwarded, specific to implement step to realize higher data rate
It is rapid as follows:
1) link-quality matrix T is constructed, and resources costs are initialized, f=0 is set.
2) by mass matrix txyIn element by ascending order arrange, be denoted as t={ t1,t2,…,tk(assuming that total k value).
3) data rate threshold t is enabled respectively0=ti(1≤i≤k), and Data Data relay forwarding in cluster successively has been calculated
Consumed resources costs fi, at this point, it is exactly optimal data rate threshold value that consumption resources costs are the smallest, i.e.,
4) t is chosenbestAs threshold value, data relay forwarding, search quality matrix t are carried outxyIn all meet txy≥tbest
Element, corresponding x composition setCorresponding y composition set
5) to x ∈ XAWith y ∈ YNAIt is calculated using sub-clustering relay forwarding scheme, and according to running time-frequency resource costing formula
Resources costs f, at this time least resource cost are as follows:
tbest=min { f1,f2,…,fk}
6) it at this point, the unallocated D2D user to resource in part has been successfully received data, and is carried out them as relaying
Data forwarding, the resources costs that add up at this time are f(k)=f(k-1)+ f (wherein k indicates forwarding series).
The beneficial effects of the present invention are: 1) resource allocation methods based on D2D sub-clustering that the present invention use, based on dry
In the case where disturbing collection sub-clustering, allows multiple D2D communication links to be multiplexed the same phone user, system can be increased to greatest extent
Handling capacity；2) resource allocation methods based on D2D sub-clustering that use of the present invention, guarantee phone user and D2D to itself
While Qos, the interference between the interference between phone user and D2D user and D2D pairs in cluster is fully considered, has improved
User satisfaction；3) resource allocation methods based on D2D sub-clustering that use of the present invention have fully considered part D2D to failing into
The case where distribution of work is to resource, is added D2D relay forwarding scheme, increase to greatest extent can be successfully accessed channel D2D it is logical
Believe number of links, improves the availability of frequency spectrum of whole network.
Detailed description of the invention
In order to keep the purpose of the present invention, technical scheme and beneficial effects clearer, the present invention provides following attached drawing and carries out
Illustrate:
Fig. 1 is in cellular network application D2D communication scheme；
Fig. 2 is schematic diagram of a scenario of the present invention；
Fig. 3 is the specific example figure of sub-clustering；
Fig. 4 is flow chart of the present invention.
Specific embodiment
Below in conjunction with attached drawing, a preferred embodiment of the present invention will be described in detail.
Fig. 2 is schematic diagram of a scenario of the present invention, as shown, D2D user is total to (D2D-Tx and D2D-Rx) and phone user
Local resource is enjoyed, forwards data without base station, compared with down-chain resource, ascending resource is simultaneously underutilized, so
What is considered in the present invention is uplink resource of the D2D to shared phone user.When D2D-Tx (transmitting terminal of D2D) can be to honeycomb
Cause co-channel interference in the receiving end (i.e. eNB) of user uplink.Meanwhile D2D-Rx (receiving end of D2D) also will receive and be multiplexed with it
The interference of the phone user of same spectrum resources.
In the present embodiment, consider single cell pattern, wherein M is randomly distributed over small to D2D user, N number of phone user
Qu Zhong, D2D user pair set are D={ 1,2 ..., M }, and phone user's collection is combined into C={ 1,2 ..., N }, by all D2D users couple
Method based on graph coloring carries out sub-clustering, is denoted as gi.It is shared in addition to needing to consider under this many-to-one D2D sub-clustering mode
Outside interference between the D2D and phone user of resource, also need to consider the co-channel interference between the D2D user couple in the same cluster.
There are three kinds of different interference for the scene considered from the above: interference of the D2D transmitting terminal to cellular system, honeycomb
User is to the interference between D2D pairs in the interference of the receiving end D2D and the same cluster.It is used to meet phone user and D2D
The QoS at family, in order to maximize the handling capacity of system, maximization objective function of the invention be may be expressed as:
Wherein, γCi、γDiRespectively indicate the SINR of phone user i and D2D user j, pci、pdjRespectively indicate phone user i
With D2D user to the actual emission power of j, gci,eIndicate the channel gain between phone user and base station.gdj,ci、gdj,dj、
gdk,dj、gci,djIndicate the channel gain between user, xi,jFor a binary value, if the resource of phone user i and D2D user
J is shared, then xi,j=1, it is otherwise 0.pcmax、pdmaxRespectively indicate the maximum transmission power of phone user Yu D2D user.γcth、
γdthRespectively indicate the minimum Signal to Interference plus Noise Ratio for meeting phone user and D2D user's progress normal communication, N0For white Gaussian noise.
Fig. 4 is flow chart of the present invention, as shown, the resource allocation based on D2D sub-clustering in cellular network of the invention
Method includes the following steps:
Step 1: UE measurement reports: UE measurement reports the interference reported for base station by UE measurement between can obtaining D2D pairs
Information, and there are intolerable interference between judging whether two D2D pairs.Use δdiValue come judge D2D user to i whether by
From other D2D to intolerable interference, δdiIt is defined as follows, wherein di∈{1,2,…,k}。
δdi≥δth
Wherein, pdmaxIndicate the maximum transmission power of D2D.δdiMeaning are as follows: all D2D with maximum transmission power emit believe
Number, and do not consider phone user interference in the case where, D2D user to i and other D2D users to shared resource when it is obtained
SINR。δthIt is D2D to the SINR threshold value reached when by maximum interference.
Step 2: building interference figure simultaneously carries out sub-clustering based on graph coloring: both the interference value size between node will determine
Between whether there is side, if D2D user to i and D2D user between j there are intolerable interference, between two nodes
There is no sides.And D2D user is put into D2D user to the interference collection I of i to jiIn.According to the method described above, by D2D user to point
For several disjoint clusters, the theory of sub-clustering are as follows: if D2D user is between i and j, there are sides, cannot be by D2D to i and to k
It is divided into the same cluster, and reduces the quantity of cluster as far as possible under given disturbed condition, even if is interference with color as few as possible
Each node-coloring in figure.The graph coloring algorithm of use are as follows: then node-colorings first most for side considers the more section in side time
Point determines its color according to the interference relationships of present node and colored node, and so on, until all node-colorings at
Function.It is illustrated in figure 3 the specific example of the D2D sub-clustering based on graph coloring.
Step 3: resource allocation: through the above scheme, all D2D users are known as g to k cluster, each cluster is divided intok, by
In at each TTI the disturbed condition of D2D it is different, therefore the number of cluster and the size of cluster and be not fixed.Assuming that phone user has divided
Prepare resource, and each phone user occupies a RB, single D2D cluster can be multiplexed the frequency spectrum resource of multiple users, and a bee
The frequency spectrum resource of nest user can only be multiplexed by a cluster, with matrix H=[hkn] indicate channel distribution situation, element hkn=1 indicates
Channel n distributes to D2D cluster k, is otherwise equal to 0.It although ensure that D2D user to by from other in the above-mentioned sub-clustering stage
The sum of D2D pairs interference does not consider interference of the phone user to it within the scope of tolerable, therefore is not cluster gkIn institute
There is D2D that can share the same RB, therefore, in resource allocation phase, the D2D user in each cluster need to be screened, only
Those are able to satisfy the QoS request of D2D itself, while can guarantee D2D pairs not impacted to the normal communication of phone user again
Network could finally be accessed.Therefore, the same cluster gkOn different resource blocks can and phone user's shared resource D2D to being
Different.
It is as follows for the screening process that can finally access the D2D user of network in cluster:
1) it initializes: considering some specific cluster gkThe case where shared RBj, and create two new cluster gkjAnd gkjs。
2) cluster g is considered simultaneouslykIn interference of the phone user to D2D to i on other D2D and RBj, calculate D2DiSINR,
If γdi≥γdth, then D2DiIt is put into cluster gkjIn.
3) D2D is calculatediTo the interference value of the phone user on RBj, and by interference value in the way of ascending order, by gkjIn
D2D user rearranges.
4) according to the sequence sequenced, the SINR of phone user after current D2D is added is calculated, until γci≤γcth, then stop
Only.So by γci≥γcthWhen the D2D user that is added be added to set gkjsIn, expression can be with share spectrum resources.
Step 4: set point relay forwarding scheme: is formed the user that the distribution of work is assigned to resource and not successfully is had become
S is not denoted as itAAnd sNA, number is denoted as N respectivelyAAnd NNA。
In order to make in cluster with obtaining base station data per family, using being successfully assigned to the user of resource as relay node,
By D2D chain road direction, failed user forwards data.
Assuming that a cluster including x user, wherein a user is successfully assigned to resource, is denoted as sA={ x1,x2,…,
xa, b user fails distribution, is denoted as sNA={ y1,y2,…,yb, it is assumed that channel quality is between D2D user in cluster
Know, then for x ∈ sAWith y ∈ sNA, link-quality matrix is constructed, as follows:
Wherein txyIndicate D2D user x and y between spectrum efficiency, that is, between the x and y of the D2D link it is achievable
Data rate；It is as follows then to transmit consumed running time-frequency resource cost formula when data:
Above formula describes D2D couples of number L (1≤L≤S as relay node forwardingA) corresponding when taking different numerical value
Resources costs, wherein C is the information bit to be transmitted, nkIt is D2D pairs as relay node；
Following formula situation corresponding when indicating using resources costs as optimization aim solution resources costs minimum, as optimal turn
Hair routing:
Wherein: FoptIndicate least resource cost when optimal forwarding routing.
Secondly, presetting a certain data rate threshold in order to further increase resource efficiency, preferentially selecting channel quality
Well the D2D link of (namely running time-frequency resource consumption is minimum) is forwarded, specific to implement step to realize higher data rate
It is rapid as follows:
1) link-quality matrix T is constructed, and resources costs are initialized, f=0 is set.
2) by mass matrix txyIn element by ascending order arrange, be denoted as t={ t1,t2,…,tk(assuming that total k value).
3) data rate threshold t is enabled respectively0=ti(1≤i≤k), and data relay forwarding in cluster successively has been calculated and is disappeared
The resources costs f of consumptioni, at this point, it is exactly optimal data rate threshold value that consumption resources costs are the smallest, i.e.,
4) t is chosenbestAs threshold value, data relay forwarding, search quality matrix t are carried outxyIn all meet txy≥tbest
Element, corresponding x composition setCorresponding y composition set
5) to x ∈ XAWith y ∈ YNAIt is calculated using sub-clustering relay forwarding scheme, and according to running time-frequency resource costing formula
Resources costs f, at this time least resource cost are as follows:
tbest=min { f1,f2,…,fk}
6) it at this point, the unallocated D2D user to resource in part has been successfully received data, and is carried out them as relaying
Data forwarding, the resources costs that add up at this time are f(k)=f(k-1)+ f (wherein k indicates forwarding series).
Finally, it is stated that preferred embodiment above is only used to illustrate the technical scheme of the present invention and not to limit it, although logical
It crosses above preferred embodiment the present invention is described in detail, however, those skilled in the art should understand that, can be
Various changes are made to it in form and in details, without departing from claims of the present invention limited range.
Claims (5)
1. a kind of resource allocation methods based on D2D sub-clustering, it is characterised in that: method includes the following steps:
S1:UE measurement reports: base station reports the interference information between obtaining D2D pairs by user terminal UE measurement, and judges whether
There are intolerable interference between two D2D pairs；
S2: building interference figure simultaneously carries out sub-clustering based on graph coloring: atlas is interfered according to the interference constructing between D2D pairs, one of them
Node indicates a D2D communication pair, and having line to indicate two D2D communications between node and node, there are intolerable between
Interference, cannot use identical resource；There is no line to indicate that interference is smaller between two nodes, identical resource can be multiplexed,
Then sub-clustering is carried out to interference atlas according to graph coloring；
S3: resource allocation: considering interference of the phone user to D2D pairs, selection and meanwhile meet D2D to and phone user Qos D2D
It is right, and interference figure is updated, sub-clustering again, wherein the D2D user in each cluster is multiplexed identical sub-band resources；
S4: relay forwarding scheme: can not be assigned to resource since above-mentioned Resource Allocation Formula will lead to part D2D user, utilize
The user of resource is successfully assigned to as relay node, data are forwarded by the user that D2D chain road direction is assigned to resource not successfully,
And frequency efficiency is maximumlly improved according to relay forwarding scheme；
In step s 4, the relay forwarding scheme is to be assigned to resource to failing due to part D2D, firstly, in order to make
With obtaining base station data per family in cluster, using being successfully assigned to the user of resource as relay node, not by D2D chain road direction
Successful user forwards data:
Assuming that a cluster including x user, wherein a user is successfully assigned to resource, is denoted as sA={ x1,x2,…,xa, b
User fails distribution, is denoted as sNA={ y1,y2,…,yb, it is assumed that in cluster between D2D user channel quality be it is known, then
For x ∈ sAWith y ∈ sNA, link-quality matrix is constructed, as follows:
Wherein txyIndicate the spectrum efficiency between D2D user x and y, that is, achievable data between the x and y of the D2D link
Rate；It is as follows then to transmit consumed running time-frequency resource cost formula when data:
Above formula describes D2D couples of number L, 1≤L≤S as relay node forwardingA, corresponding resource when taking different numerical value
Cost, wherein C is the information bit to be transmitted, nkIt is D2D pairs as relay node；
Following formula situation corresponding when indicating using resources costs as optimization aim solution resources costs minimum, as optimal forwarding road
By:
Wherein: FoptIndicate least resource cost when optimal forwarding routing；
Secondly, a certain data rate threshold is preset in order to further increase resource efficiency, it is preferential to select channel quality good
Good namely running time-frequency resource consumes the smallest D2D link and is forwarded, to realize higher data rate, specific implementation steps
It is as follows:
1) link-quality matrix T is constructed, and resources costs are initialized, f=0 is set；
2) by mass matrix txyIn element by ascending order arrange, be denoted as t={ t1,t2,…,tk, it is assumed that total k value；
3) data rate threshold t is enabled respectively0=ti, 1≤i≤k, and successively have been calculated in cluster consumed by data relay forwarding
Resources costs fi, at this point, it is exactly optimal data rate threshold value that consumption resources costs are the smallest, i.e.,
4) t is chosenbestAs threshold value, data relay forwarding, search quality matrix t are carried outxyIn all meet txy≥tbestMember
Element, corresponding x form set XA,Corresponding y forms set YNA,
5) to x ∈ XAWith y ∈ YNAIts resource is calculated using sub-clustering relay forwarding scheme, and according to running time-frequency resource costing formula
Cost f, at this time least resource cost are as follows:
tbest=min { f1,f2,…,fk}；
At this point, the unallocated D2D user to resource in part has been successfully received data, and they are subjected to data as relaying and is turned
Hair, the resources costs that add up at this time are f(k)=f(k-1)+ f, wherein k indicates forwarding series.
2. a kind of resource allocation methods based on D2D sub-clustering according to claim 1, it is characterised in that: in step sl,
The UE measurement, which reports, includes:
Firstly, defining δdiIt is as follows: δdiIndicate that all D2D are sent out in the case where user interferes between only considering D2D pairs with maximum power
When penetrating signal, D2D user is to i with other D2D users to the Signal to Interference plus Noise Ratio of shared resource；δthD2D to the interference being subject to most
The SINR threshold value reached when big:
Wherein di∈{1,2,…,k}；
Base station preset one D2D pairs between interference threshold value δth, and this threshold value is broadcast to all D2D users
It is right, if δdi≤δth, then it is assumed that the maximum D2D of i interference, between j, there are intolerable interference to i and to D2D by D2D, and
D2D is put into D2D to the interference collection of i to j；
If formula δdi≥δthIt is invalid, then illustrate that D2D user is currently also unable to satisfy the QoS request of itself to i, should remove at this time pair
D2D interferes strongest D2D user to be put into D2D user to the interference collection I of i to k to k, and by D2D user iiIn, indicate that D2D is used
Family is to there are intolerable interference, removing D2D user to calculating δ again after k between i and kdiValue, until the value be greater than give
Fixed threshold value δth。
3. a kind of resource allocation methods based on D2D sub-clustering according to claim 1, it is characterised in that: in step s 2,
The building interference figure simultaneously carries out sub-clustering based on graph coloring, comprising: by D2D user to several disjoint clusters are divided into, uses
Graph coloring algorithm is D2D user to sub-clustering, respectively represents a cluster using different colors；The theory of sub-clustering are as follows: if D2D user
To between i and k, there are sides, i.e. ldi,dk=1, ldi,dkIndicate D2D to i and D2D to the side between j；Side if it exists, then ldi,dk=
1, then D2D cannot divide for the same cluster k i and D2D；It otherwise is 0；And cluster is reduced as far as possible under given disturbed condition
Quantity, even if being each node-coloring in interference figure with color as few as possible；Node-colorings first most for side, is then examined
Consider the more node in side time, determine its color according to the interference relationships of present node and colored node, and so on, until all
Node-coloring success.
4. a kind of resource allocation methods based on D2D sub-clustering according to claim 1, it is characterised in that: in step s3,
The resource allocation is the scheme based on signal-to-noise ratio SINR, presets the threshold value of a SINR, it is first assumed that all D2D
To identical resource is all multiplexed, i.e., exists between all D2D pairs and interfere with each other, in resource allocation phase, in each cluster
D2D user screens, only those QoS requests for being able to satisfy D2D itself, while can guarantee the positive normal open to phone user again
Not believe the D2D that impacts to could finally access network；The same cluster gkIt can be total with phone user on different resource blocks
The D2D of resource is enjoyed to being different.
5. a kind of resource allocation methods based on D2D sub-clustering according to claim 4, it is characterised in that: in cluster most
The screening process that the D2D user of network can be accessed eventually is as follows:
1) it initializes: considering some specific cluster gkThe case where shared resource block RBj, and create two new cluster gkjAnd gkjs；
2) cluster g is considered simultaneouslykIn interference of the phone user to D2D to i on other D2D and RBj, calculate D2DiSINR, if
γDi≥γdth, then D2DiIt is put into cluster gkjIn；
3) D2D is calculatediTo the interference value of the phone user on RBj, and by interference value in the way of ascending order, by gkjIn D2D use
Family rearranges；
4) according to the sequence sequenced, the SINR of phone user after current D2D is added is calculated, until γCi≤γcth, then stop；
So by γCi≥γcthWhen the D2D user that is added be added to set gkjsIn, expression can be with share spectrum resources；
Wherein, γcth、γdthRespectively indicate the threshold value for meeting the SINR of phone user and D2D user QoS:
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610338825.3A CN105813129B (en) | 2016-05-19 | 2016-05-19 | A kind of resource allocation methods based on D2D sub-clustering |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610338825.3A CN105813129B (en) | 2016-05-19 | 2016-05-19 | A kind of resource allocation methods based on D2D sub-clustering |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105813129A CN105813129A (en) | 2016-07-27 |
| CN105813129B true CN105813129B (en) | 2019-06-04 |
Family
ID=56452596
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610338825.3A Active CN105813129B (en) | 2016-05-19 | 2016-05-19 | A kind of resource allocation methods based on D2D sub-clustering |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105813129B (en) |
Families Citing this family (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106507316B (en) * | 2016-11-02 | 2019-03-26 | 西安邮电大学 | User's sub-clustering and resource allocation methods under a kind of D2D multicast scene |
| CN106535203A (en) * | 2017-01-10 | 2017-03-22 | 河海大学 | Method of D2D and WLAN to share ISM spectrum |
| CN106954269B (en) * | 2017-04-05 | 2019-11-19 | 南京邮电大学 | Sub-clustering method for channel allocation of one of the D2D communication system based on QoS |
| CN107396293B (en) * | 2017-08-03 | 2020-12-18 | 重庆邮电大学 | V2X resource allocation method and system based on D2D communication |
| CN107396448B (en) * | 2017-08-15 | 2021-03-12 | 重庆邮电大学 | Resource allocation method in heterogeneous network |
| CN107750056B (en) * | 2017-10-25 | 2020-12-11 | 河南理工大学 | Interference reduction method in ultra-dense network |
| CN108377481B (en) * | 2018-02-02 | 2019-12-10 | 东南大学 | energy and rate sensing D2D communication spectrum resource allocation method |
| CN108924878B (en) * | 2018-07-04 | 2020-11-03 | 北京邮电大学 | Method for eliminating interference between coexisting wireless body area networks based on graph coloring theory |
| CN109041016B (en) * | 2018-07-25 | 2020-04-03 | 河海大学 | Method for optimizing terminal access number of 5G communication system in dense scene |
| CN109451471B (en) * | 2018-09-28 | 2020-04-03 | 广东电网有限责任公司 | Same-frequency channel D2D relay communication method and system, computer equipment and medium |
| CN109982341B (en) * | 2019-02-19 | 2022-03-22 | 重庆邮电大学 | V2V broadcast resource allocation method based on hypergraph theory |
| CN110225578B (en) * | 2019-05-30 | 2022-05-24 | 华南师范大学 | D2D resource allocation method based on graph coloring |
| CN110290508B (en) * | 2019-07-04 | 2022-04-12 | 重庆邮电大学 | M2M communication network combined clustering and power distribution method based on non-orthogonal multiple access technology |
| CN110418399B (en) * | 2019-07-24 | 2022-02-11 | 东南大学 | NOMA-based Internet of vehicles resource allocation method |
| CN110839227B (en) * | 2019-11-25 | 2022-05-10 | 重庆邮电大学 | D2D resource allocation method and device for densely distributed user groups of cellular system |
| CN113038613B (en) * | 2021-03-01 | 2022-06-03 | 中国人民解放军国防科技大学 | Three-dimensional network resource allocation method and device based on graph coloring problem |
| CN116684976B (en) * | 2023-06-16 | 2024-03-26 | 湖北广兴通信科技有限公司 | D2D communication resource allocation method and device and computer equipment |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103596182A (en) * | 2013-11-27 | 2014-02-19 | 北京邮电大学 | Method for managing spectrum resources in D2D communications |
| CN103957518A (en) * | 2014-05-13 | 2014-07-30 | 中国科学院上海微系统与信息技术研究所 | D2D communication method in cellular network |
-
2016
- 2016-05-19 CN CN201610338825.3A patent/CN105813129B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103596182A (en) * | 2013-11-27 | 2014-02-19 | 北京邮电大学 | Method for managing spectrum resources in D2D communications |
| CN103957518A (en) * | 2014-05-13 | 2014-07-30 | 中国科学院上海微系统与信息技术研究所 | D2D communication method in cellular network |
Non-Patent Citations (2)
| Title |
|---|
| LTE网络下基于图着色理论的D2D分簇资源分配方案;何朵奇;《南京邮电大学学报》;20151231;第35卷(第6期);第1.2、2节 |
| 蜂窝和D2D混合通信网络中的干扰协调技术研究;孙科;《中国优秀硕士学位论文全文数据库》;20150815(第8期);第1.2节 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105813129A (en) | 2016-07-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105813129B (en) | A kind of resource allocation methods based on D2D sub-clustering | |
| Romanous et al. | Network densification: Challenges and opportunities in enabling 5G | |
| Pedhadiya et al. | Device to device communication: A survey | |
| Jayakumar et al. | A review on resource allocation techniques in D2D communication for 5G and B5G technology | |
| CN105722236B (en) | Resource allocation method for supporting full-duplex D2D communication in cellular network | |
| Jung et al. | Residual-energy-activated cooperative transmission (REACT) to avoid the energy hole | |
| CN103607750A (en) | Relay selection method based on terminal straight-through communication in next-generation cellular system | |
| CN106507316A (en) | User's sub-clustering and resource allocation methods under a kind of D2D multicasts scene | |
| Simsek et al. | Multiconnectivity in multicellular, multiuser systems: A matching-based approach | |
| EP3404976B1 (en) | Procedure for managing radioelectric resources in 5g cellular networks aiming at the reuse of resources for vehicle-to-vehicle, v2v, communications | |
| Jiang et al. | A relay-aided device-to-device-based load balancing scheme for multitier heterogeneous networks | |
| JP4976858B2 (en) | Resource allocation method and apparatus in relay-based cellular configuration | |
| Jaber et al. | A multiple attribute user-centric backhaul provisioning scheme using distributed SON | |
| CN107396397B (en) | Heterogeneous multi-port aggregated networked resource sharing method | |
| Chen et al. | Optimal mode selection algorithms in multiple pair device-to-device communications | |
| CN104010344A (en) | Wireless sensor network virtual MIMO communication strategy based on cooperative groups | |
| Das et al. | A location-aware power control mechanism for interference mitigation in M2M communications over cellular networks | |
| JP2013146058A (en) | Radio communication resource management for distributed cellular system | |
| Chen et al. | Load balancing for D2D-based relay communications in heterogeneous network | |
| CN104618934B (en) | A kind of global optimization relay node selecting method based on throughput prediction | |
| CN106912059B (en) | Cognitive relay network joint relay selection and resource allocation method supporting mutual information accumulation | |
| Alexandris et al. | Utility-based resource allocation under multi-connectivity in evolved LTE | |
| Tan et al. | Low‐complexity networking based on joint energy efficiency in ultradense mmWave backhaul networks | |
| Sharma et al. | Overlapping coalition-based resource and power allocation for enhanced performance of underlaying D2D communication | |
| Jiang et al. | Joint mode selection and resource allocation in D2D-enabled vehicular network |
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 |