CN107426820A - Multi-user's game improves the resource allocation methods of efficiency in a kind of cognition D2D communication systems - Google Patents
Multi-user's game improves the resource allocation methods of efficiency in a kind of cognition D2D communication systems Download PDFInfo
- Publication number
- CN107426820A CN107426820A CN201710391811.2A CN201710391811A CN107426820A CN 107426820 A CN107426820 A CN 107426820A CN 201710391811 A CN201710391811 A CN 201710391811A CN 107426820 A CN107426820 A CN 107426820A
- Authority
- CN
- China
- Prior art keywords
- mrow
- msubsup
- user
- efficiency
- pair
- 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.)
- Granted
Links
Classifications
-
- 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/53—Allocation or scheduling criteria for wireless resources based on regulatory allocation policies
-
- 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/54—Allocation or scheduling criteria for wireless resources based on quality criteria
- H04W72/541—Allocation or scheduling criteria for wireless resources based on quality criteria using the level of interference
-
- 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/54—Allocation or scheduling criteria for wireless resources based on quality criteria
- H04W72/542—Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality
-
- 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/14—Spectrum sharing arrangements between different networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/70—Services for machine-to-machine communication [M2M] or machine type communication [MTC]
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Quality & Reliability (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The resource allocation methods that multi-user's game in a kind of cognition D2D communication systems improves efficiency are claimed in the present invention, are related to cognition wireless network.For the relatively low scene of the efficiency of the frequency spectrum that multiple D2D users are multiplexed multiple phone users in cognition network, the present invention proposes a kind of Resource Allocation Formula of the raising D2D communication system efficiencies based on game theoretical model, in the interference threshold constraints to be communicated no more than user, the resource of system is allocated using Noncooperative game model, and the equilibrium of efficiency and spectrum efficiency come being optimal user efficiency and is reached using Lagrange duality method and KKT alternative manners.
Description
Technical field
The present invention relates to cognition radio communication field, more particularly to the resource allocation techniques in cognitive radio technology.
Background technology
Cognitive radio (CR) is that solve a kind of nervous effective ways of current spectral resource.D2D(Device-to-
Device) communication technology can promote more easily to carry out data information exchange between mobile device similar in geospatial location.Recognize
Know radiotechnics communicated with D2D combine to form cognition D2D communication there is lot of advantages, it has also become future mobile communication system
Key technology.The Resource Allocation Formula of D2D communication systems still has extensive space in research cognitive radio networks.At present
The Resource Allocation Formula of traditional communications of the D2D based on cognitive radio concentrates on greatly raising spectrum efficiency, and Optimized model is more single
One.And in the prior art, more limit to for the method for the Energy design of user in raising system, do not consider overall efficiency
Raising, and scheme complexity is higher.
In D2D communication systems are recognized, D2D user be multiplexed in a manner of underlay phone user's frequency spectrum bring it is much good
Place, such as adjacent to gain, spatial multiplexing gain and jump gain etc..Because spectrum reuse can cause cochannel interference and user equipment
Limited battery life can influence telecommunication service quality, so D2D communication can be also faced with new challenges on resource allocation problem
[Wang M,Yan Z.A survey on security in D2D communications[J].Mobile Networks
and Applications,2016:1-14.].Optimize the method for user's efficiency in many literature research cognition D2D communications, use
The D2D user of context-aware has found method and the resource allocation methods based on iterative power matching, hierarchy optimization user's energy
Method [Zhou Z, Ma G, Zhang D, the et al.Energy-efficient context-aware resource of effect
allocation in D2D communications:An iterative matching approach[C]//
Information and Communication Technology Convergence(ICTC),2016International
Conference on.IEEE,2016:90-96.].Efficiency resource allocation is possessed some special knowledge in spite of part document, but to most
The satisfaction and fairness of number user is not considered.There is document to solve D2D user to honeycomb using Lagrange duality theory
The interference problem of user and efficiency [Mumtaz S, Huq K M S, the Rodriguez J, et for carrying out combined optimization user
al.Energy-efficient interference management in LTE-D2D communication[J].IET
Signal Processing,2016,10(3):197-202.].But many documents do not have the competitive relation considered between user
And the balanced situation of the spectrum efficiency of system utility, and only focus on how maximum spectral efficiency or how limiting user
Between interference and ignore self-characteristic [Golrezaei N, Mansourifard P, Molisch A F, the et of user
al.Base-station assisted device-to-device communications for high-throughput
wireless video networks[J].IEEE Transactions on Wireless Communications,2014,
13(7):3665-3676]。
The content of the invention
In view of the disadvantages described above present invention in the interference threshold constraints to be communicated no more than user, utilizes Noncooperative game mould
Type come being optimal user efficiency and reaches the equilibrium of efficiency and spectrum efficiency to the resource allocation of system.So as to propose one
Multi-user's game improves the resource allocation methods of efficiency in kind cognition D2D communication systems, considers in D2D traffic models are recognized,
D2D user is multiplexed phone user's frequency spectrum in a manner of underlay, and D2D user forms with phone user in order to maximize respective efficiency
Noncooperative game problem, by improving user and link efficiency, improve the performances such as the handling capacity of total system power consumption and system.
The technical solution of the present invention comprises the following steps：
Multi-user's game improves the resource allocation methods of efficiency in a kind of cognition D2D communication systems, it is characterised in that including
Following steps：
S1：By several D2D users in cognition wireless network with the spectral model of underlay mode multiplexing phone users
The Noncooperative game model for being equivalent to several rationality participant and being formed to maximize respective efficiency；Single in this model
1 base station, multiple phone users and multipair D2D user in OFDM cellular cells be present and carry out communication scenes and M bar cellular communications
Link and N bar D2D communication links.Wherein phone user preferentially obtains leader of the frequency spectrum resource as game decision-making, D2D user
In order to strive for follower of the frequency spectrum resource as game decision-making after the decision-making of phone user is understood.
S2：It is maximum that the efficiency of D2D user and nest user in cognition wireless network are obtained according to Noncooperative game modelling
Change problem；The efficiency maximization problems of wherein i-th pair D2D user is
The efficiency maximization problems of k-th of phone user is
In formula：For the efficiency of i-th pair D2D user, ri dFor i-th pair D2D transmission rate,Sent out for i-th pair D2D
The transmit power of sending end,Constrained for the maximum transmit power of D2D user,For the efficiency of k-th of phone user,For
The transmission rate of k-th of phone user,For the transmit power of k-th of phone user,For the transmission that phone user is maximum
Power constraint,For the minimum transmission rate of i-th pair D2D user,For the minimum transmission rate of k-th of phone user,For the strategy of the transmitting terminal of i-th pair D2D user,For in N to D2D pairs in other D2D in addition to i-th pair D2D user use
The strategy of family transmitting terminal,For the strategy of k-th of phone user,For removed in M phone user k-th phone user it
The strategy of other outer phone users.
S3：Using the efficiency maximization problems in Lagrange duality method solution procedure S2.Including finding maximization energy
The power of effect and find minimum two contents of Lagrange factor corresponding to optimal power.
It is individual in above scheme, it is additionally included under the interference threshold constraints of phone user and builds based on interference threshold
Efficiency maximization problems, convex optimization problem will be converted into the problem of maximizing system energy efficiency by introducing convex optimum theory；It is based on
The efficiency maximization problems of interference threshold isFor the transmission of i-th pair D2D transmitting terminals
Power,For in kth bar channel, the interference channel gain between i-th pair D2D transmitting terminals and base station,For k-th of honeycomb
The patient maximum interference of user.
The acquisition process of the efficiency maximization problems of D2D user and nest user is in the cognition wireless network：
First, the Signal to Interference plus Noise Ratio SINR of D2D user and phone user are calculated respectively；
The Signal to Interference plus Noise Ratio SINR of D2D pairs of i-th pair is on kth bar channel：
Wherein,It is the transmit power of i-th pair D2D transmitting terminals,It is the transmit power of k-th of phone user,It is
J to the transmit powers of D2D transmitting terminals,It is the channel gain between i-th pair D2D,It is k-th of phone user to i-th pair
The interference channel gain of D2D receiving terminals,It is jth to interference channel gain of the D2D transmitting terminal to i-th pair D2D receiving terminals, N0
For noise power；
The Signal to Interference plus Noise Ratio SINR that base station receives k-th of phone user is：
Wherein,It is the channel gain between k-th of phone user and base station,In kth bar channel, i-th pair D2D is to hair
Interference channel gain between sending end and base station；
Calculate the general power consumed of D2D user and phone user respectively again；
I-th pair D2D transmission rate isThe general power that i-th pair D2D is consumed is
The transmission rate of k-th of honeycomb isThe circuit power consumption of base station is not considered, and k-th of honeycomb is used
The general power that family is consumed is
Wherein, pcirIt is the circuit power consumption of user；D2D transmitting terminals and the equal generation circuit power consumption of receiving terminal, and all users
Circuit power consumption is；η is power amplification coefficient power amplification ratio, 0<η<1；
The efficiency of i-th pair D2D user's transmitting terminal and the efficiency of k-th of phone user are finally calculated respectively；
The strategy of the transmitting terminal of i-th pair D2D user is
Wherein,It is the maximum transmit power constraint of D2D user；
The strategy of k-th of phone user is
Wherein,It is the maximum transmit power constraint of phone user；
It is in the strategy of other D2D user's transmitting terminals during N is to D2D pairs in addition to i-th pair D2D user：
The strategy of other phone users in M phone user in addition to k-th of phone user is：
For in N to D2D pairs in the maximum of other D2D user's transmitting terminals in addition to i-th pair D2D user send work(
Rate,For the maximum transmit power of other phone users in M phone user in addition to k-th of phone user；
The efficiency of i-th pair D2D userFor
The efficiency of k-th of phone userFor
D2D user and the power policy collection P of phone userdAnd PcRespectively
Advantages of the present invention and beneficial effect：
It is of the invention then consider, in the interference threshold constraints to communicate no more than user, to win using non-cooperating on this basis
Play chess model and come being optimal user efficiency and the equilibrium of efficiency and spectrum efficiency is reached to the resource allocation of system, can be very
Solve well in real network as the situation of multi-user resource distribution.Wherein, user's game play mode is employed, effectively improves user's energy
Effect；Using Lagrange duality method, the average efficiency of link can be more effectively improved；Using KKT alternative manners, compared to other
It is more preferable that second-rate optimization method solves efficiency resource allocation problem effect.
Brief description of the drawings
Fig. 1 is the D2D traffic models in cognition network；
Fig. 2 is that different iterationses influence on user's efficiency；
Fig. 3 is influence of the different iterationses to the average efficiency of link；
Fig. 4 is influence of the D2D numbers of users to total system power consumption；
Fig. 5 is influence of phone user's quantity to the average efficiencies of D2D；
The comparison of Fig. 6 the inventive method and other two methods.
Embodiment
In order that the object, technical solutions and advantages of the present invention are clearer, the present invention is made below in conjunction with accompanying drawing into
The detailed description of one step, comprises the following steps：
101st, the system of the program is cognition D2D model of communication systems, as shown in figure 1, it is by single OFDM cellular cells,
1 base station, 2 phone users (CUE1, CUE2) and 2 couples of D2D are to composition.D2D user has a cognitive ability, and D2D user can be with
D2D links are established with the frequency spectrum resource of underlay mode multiplexing phone users.Assuming that M bar cellular communication chains in this model be present
Road and N bar D2D communication links.
102nd, it is according to Fig. 1, present invention Signal to Interference plus Noise Ratio SINR of D2D pairs of i-th pair on kth bar channel：
It is transmit powers of the i-th pair D2D to transmitting terminal；It is the transmit power of k-th of phone user；It is jth pair
Transmit powers of the D2D to transmitting terminal；It is the channel gain between D2D pairs of i-th pair；It is k-th of phone user to i-th pair
Interference channel gains of the D2D to receiving terminal；It is jth to the interference channel of D2D pairs of transmitting terminal to i-th pair D2D to receiving terminal
Gain；N0For noise power；N is D2D communication chain travel permit numbers.
103rd, the Signal to Interference plus Noise Ratio SINR that base station receives k-th of phone user is：
Wherein,It is the channel gain between k-th of phone user and base station；In kth bar channel, i-th pair D2D is to hair
Interference channel gain between sending end and base station.
So, i-th pair D2D is to the transmission rate that can reachK-th of phone user is reachable
To transmission rate beM is cellular communication link bar number.
I-th pair D2D is to the general power that is consumedComprising two parts, part hair total when being to M bar channel multiplexings
Power is sent, a part is D2D pairs of transmitting terminal and the circuit power consumption of receiving terminal.Therefore, i-th pair D2D is to the general power that is consumed
For:
Wherein, pcirIt is the circuit power consumption of user；D2D transmitting terminals and the equal generation circuit power consumption of receiving terminal, and all users
Circuit power consumption is.η is power amplification coefficient power amplification ratio, usually 0<η<1.
The general power that k-th of phone user is consumed includes two parts, and a part is phone user's transmit power, a part
It is the circuit power consumption of phone user's transmitting terminal.The circuit power consumption of base station is not considered herein.Therefore, k-th of phone user is consumed
General power be：
104th, in the Noncooperative game traffic model, each user is selfish to be intended to maximize the energy of oneself
Effect.Therefore the strategy of the transmitting terminal of i-th pair D2D user isWherein,It is the maximum transmit power constraint of D2D user.The strategy of the transmitting terminal of i-th pair D2D user is represented, k-th of honeycomb is used
The strategy at family is：The strategy of k-th of phone user is represented, wherein,
It is the maximum transmit power constraint of phone user.Sent in other D2D users during N is to D2D couples in addition to i-th pair D2D user
The strategy at end is：Represent in N in D2D pairs
The strategy of other D2D user's transmitting terminals in addition to i-th pair D2D user,Represent in N is to D2D pairs except i-th pair D2D is used
The maximum transmit power of other D2D user's transmitting terminals outside family.In M phone user in addition to k-th of phone user
The strategy of other phone users is：Represent in M honeycomb
The strategy of other phone users in user in addition to k-th of phone user,Expression removes k-th of honeybee in M phone user
The transmit power of other phone users outside nest user,Represent in M phone user in addition to k-th of phone user
Other phone users transmit power.
The efficiency of i-th pair D2D userDepend not only on the transmit power of i-th pair D2D userAdditionally depend on except the
I is to the strategy of other D2D user's transmitting terminals outside D2D user：
The efficiency maximization problems of i-th pair D2D user can be expressed as mathematic(al) representation：
So, the efficiency of k-th of phone userFor：
Then, the efficiency maximization problems of corresponding k-th of phone user can be expressed as mathematic(al) representation：
Then, the efficiency of whole system network is：
Wherein, Pd, PcThe respectively power policy collection of D2D user and phone user.
105th, the patient maximum interference of k-th of phone user is defined asTherefore the energy based on interference threshold
Effect maximization problems can be converted to：
Lagrange duality problem is obtained using Lagrange multiplier function and finds out the optimal of function using KKT conditions
Solution.
For it is established above the problem of carry out following solve and analysis.
1. efficiency maximization problems designs
Because formula (6) and formula (10) are respectively provided with fractional form, so its object function is all non-convex.In order to try to achieve target
The closed solutions of function, non-convex function is changed into convex function by us using non-linear fractional programming.Therefore, can be by i-th pair D2D
The maximum efficiency of user is defined asIts expression formula is：
Wherein,It is i-th pair D2D user according to optimal transmit power used by other users strategy.
Lemma 1：The maximum efficiency of i-th pair D2D userAnd if only if, and following formula meets：
Prove：To arbitrary decision setWe can obtain：
Formula (12) is deformed, we can obtain：
Therefore, whenWhen, formulaMaximum be 0, can be obtained by solving formula (6)
ArriveCard is finished.
Lemma 2：To following formula
The solution of existence anduniquess
Prove：From formula (16) it is recognised thatIt is with variableContinuous monotone decreasing.ThereforeThere is unique solutionAnd it can similarly be proved by reduction to absurdity.Card is finished.
Similarly, k-th of maximum efficiency of phone user is defined as by weIt can obtain that same lemma 1 is similar to draw
Reason 3.
Lemma 3：The maximum efficiency of k-th of phone userAnd if only if, and following formula meets：
Wherein,It is k-th of phone user according to optimal transmit power used by other users strategy.And wherein
Not unique [Dinkelbach W.On nonlinear fractional programming [J] .Management of value
science,1967,13(7):492-498.].Card is finished.
2. the maximum efficiency of phone user and D2D user solve
Any cost allocation strategy of i-th pair D2D userFor：
Any cost allocation strategy of k-th of phone userFor：
Therefore, the Lagrange multiplier function of i-th pair D2D user can make work
Wherein, αi, βiIt is the Lagrange factor in formula (20) under constraints.
The dual problem of formula (20) can resolve into two subproblems：First, user takes optimal policy to find maximization energy
The power of effect；Second, find minimum Lagrange factor corresponding to optimal power.It is following problem：
For any givenCorresponding solution can then be obtained：
Wherein, shaped like { a }+Refer to take (0, a) between maximum.
When solving Lagrange factor minimization problem, the present invention is solved using gradient method：
Wherein, τ is iterations；μi,αAnd μi,βIt is very small parameter, μi,α>0, μi,β>0。
Similarly, k-th of phone user is for any given efficiencyOptimal transmit power corresponding to can then obtaining
Solution：
Wherein, δkAnd θkFor the Lagrange factor under constraints in formula (25).
It is known when utility function is a continuous quasiconvex function, and strategy set is a non-NULL closure convex set,
In the presence of a Nash Equilibrium Solution.The molecule r in formula (7)i dBe onConvex function,k∈M.Denominator be on's
Mapping function.Therefore,It is a quasiconvex function.Set of strategies：
It is the closure convex set of a non-NULL.So there is a Nash Equilibrium in non-cooperative game process.It is that the above method can restrain
To Nash Equilibrium, and Nash Equilibrium herein is a power distribution decision-making set.The strategy can reach a kind of balanced, be,
Which user the efficiency of itself can individually be improved by certain power decision without.And the set of strategies is
The Resource Allocation Formula emulation point of efficiency is improved to multi-user's game in the cognition D2D communication systems that are proposed below
Analysis, it is assumed that system bandwidth 10MHz, the radius of this cell is 500m, and phone user and D2D user are randomly dispersed in cell,
Can be re-used link phone user to base station distance in the range of 100m, the peak power of phone userD2D user forms D2D pairs in the range of 50m, the maximum transmit power of D2D user userNoise power spectral density is -174dBm/Hz.In addition, joined according to the communication between base station and all users
Revised COST231-Hata urban propagation model PL=36.7+35 × lg (d) are examined, between phone user and D2D user
Path loss (bibliography [Andrews M, Kumaran K, Ramanan K, et al.Providing quality of
service over a shared wireless link[J].IEEE Communications Magazine,2001,39
(2):150-154.]) propagation model PL=66.5+40 × lg (d), and D2D to the distance between it is smaller, using free space
Model PL=38.4+20 × lg (d).
Fig. 2 discusses influence of the iterations to user's efficiency first.D2D user and phone user are updated certainly by iteration
The efficiency of body, finally all converges on Nash Equilibrium.Can also as seen from the figure, phone user's convergence rate is very fast, and required changes
Generation number is less.And D2D numbers of users are more than the quantity of phone user in network, thus iterations needed for D2D user compared with
More, convergence rate is also slower.
Fig. 3 is influence of the game iterations to the average efficiency of link.Emulation shows, institute's extracting method of the present invention compared to
Random methods and Energy-efficient methods have more excellent performance.This is due to the network model used in the present invention
With preferable neighbouring gain and channel multiplexing gain.Higher neighbouring gain is due to the distance between D2D user of the present invention
It is shorter.Higher channel multiplexing gain is due to that interference threshold setting of the invention is more reasonable.
Fig. 4 is the relation that total system power consumption changes with D2D numbers of users.And by institute's extracting method of the present invention and Random side
Method contrasts.With the increase of number of users, the total power attenuation of system all increases therewith.Institute's extracting method of the present invention is being kept
There is the characteristics of low energy consumption, but the user in Random methods is for their communication of guarantee in the case that number of users is certain
Quality has to consume more power.
Fig. 5 is to compare Energy-efficient methods and the present invention in the case where D2D numbers of users are by 10 and 5 to carry
Method is with the average efficiency relation of D2D user during CUE number changes.When D2D numbers of users reduce to 5 from 10, D2D user
Efficiency also decrease.Because D2D transmitting terminals detect that the D2D receiving terminals quantity more matched declines, so D2D is used
Family efficiency also decreases.And with the increase of CUE numbers of users, the cellular link that can be multiplexed by D2D user increases, so D2D
User's efficiency also increases.
Fig. 6 is the comparison on the CDF curves of overall system capacity on three kinds of methods.In equal probabilities density aggregation function
In the case of, the overall system capacity performance of institute's extracting method of the present invention is better than Energy-efficient methods and Random methods institute
The performance of extracting method, because the inventive method combined optimization transmit power and transmission rate of user, so performance is more
It is good.And Energy-efficient methods are better than Random methods.
Claims (5)
1. in a kind of cognition D2D communication systems multi-user's game improve efficiency resource allocation methods, it is characterised in that including with
Lower step：
S1：Several D2D users in cognition wireless network are of equal value with the spectral model of underlay mode multiplexing phone users
It is several rationality participant to maximize the Noncooperative game model that respective efficiency forms；
S2：The efficiency of D2D user and nest user maximization in cognition wireless network are obtained according to Noncooperative game modelling to ask
Topic；The efficiency maximization problems of wherein i-th pair D2D user is
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<mi>max</mi>
<mrow>
<mo>{</mo>
<mrow>
<msubsup>
<mi>U</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>E</mi>
<mi>E</mi>
</mrow>
<mi>d</mi>
</msubsup>
<mrow>
<mo>(</mo>
<mrow>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mi>d</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>p</mi>
<mrow>
<mo>-</mo>
<mi>i</mi>
</mrow>
<mi>d</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>p</mi>
<mi>k</mi>
<mi>c</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>p</mi>
<mrow>
<mo>-</mo>
<mi>k</mi>
</mrow>
<mi>c</mi>
</msubsup>
</mrow>
<mo>)</mo>
</mrow>
</mrow>
<mo>}</mo>
</mrow>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mtable>
<mtr>
<mtd>
<mrow>
<mi>s</mi>
<mo>.</mo>
<mi>t</mi>
<mo>.</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<mi>C</mi>
<mn>1</mn>
<mo>:</mo>
<msubsup>
<mi>r</mi>
<mi>i</mi>
<mi>d</mi>
</msubsup>
<mo>&GreaterEqual;</mo>
<msubsup>
<mi>R</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>min</mi>
</mrow>
<mi>d</mi>
</msubsup>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow></mrow>
</mtd>
<mtd>
<mrow>
<mi>C</mi>
<mn>2</mn>
<mo>:</mo>
<mn>0</mn>
<mo>&le;</mo>
<munderover>
<mi>&Sigma;</mi>
<mrow>
<mi>k</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>M</mi>
</munderover>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mi>k</mi>
</msubsup>
<mo>&le;</mo>
<msubsup>
<mi>p</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>max</mi>
</mrow>
<mi>d</mi>
</msubsup>
</mrow>
</mtd>
</mtr>
</mtable>
</mtd>
</mtr>
</mtable>
</mfenced>
The efficiency maximization problems of k-th of phone user is
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<mi>m</mi>
<mi>a</mi>
<mi>x</mi>
<mo>{</mo>
<msubsup>
<mi>U</mi>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mi>E</mi>
<mi>E</mi>
</mrow>
<mi>c</mi>
</msubsup>
<mrow>
<mo>(</mo>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mi>d</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>p</mi>
<mrow>
<mo>-</mo>
<mi>i</mi>
</mrow>
<mi>d</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>p</mi>
<mi>k</mi>
<mi>c</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>p</mi>
<mrow>
<mo>-</mo>
<mi>k</mi>
</mrow>
<mi>c</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>}</mo>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mtable>
<mtr>
<mtd>
<mrow>
<mi>s</mi>
<mo>.</mo>
<mi>t</mi>
<mo>.</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<mi>C</mi>
<mn>3</mn>
<mo>:</mo>
<msubsup>
<mi>r</mi>
<mi>k</mi>
<mi>c</mi>
</msubsup>
<mo>&GreaterEqual;</mo>
<msubsup>
<mi>R</mi>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mi>min</mi>
</mrow>
<mi>c</mi>
</msubsup>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow></mrow>
</mtd>
<mtd>
<mrow>
<mi>C</mi>
<mn>4</mn>
<mo>:</mo>
<mn>0</mn>
<mo>&le;</mo>
<msubsup>
<mi>p</mi>
<mi>k</mi>
<mi>c</mi>
</msubsup>
<mo>&le;</mo>
<msubsup>
<mi>p</mi>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mi>max</mi>
</mrow>
<mi>d</mi>
</msubsup>
</mrow>
</mtd>
</mtr>
</mtable>
</mtd>
</mtr>
</mtable>
</mfenced>
In formula：For the efficiency of i-th pair D2D user, ri dFor i-th pair D2D transmission rate,For i-th pair D2D transmitting terminals
Transmit power,Constrained for the maximum transmit power of D2D user,For the efficiency of k-th of phone user,For k-th
The transmission rate of phone user,For the transmit power of k-th of phone user,For the transmit power that phone user is maximum
Constraint,For the minimum transmission rate of i-th pair D2D user,For the minimum transmission rate of k-th of phone user,For
The strategy of the transmitting terminal of i-th pair D2D user,For in N to D2D pairs in addition to i-th pair D2D user other D2D users hair
The strategy of sending end,For the strategy of k-th of phone user,For in M phone user in addition to k-th of phone user
The strategy of other phone users；
S3：Using the efficiency maximization problems in Lagrange duality method solution procedure S2.
2. multi-user's game improves the resource allocation methods of efficiency in a kind of cognition D2D communication systems according to claim 1,
It is characterized in that：Efficiency maximization of the structure based on interference threshold under the interference threshold constraints of phone user is additionally included in ask
Topic, convex optimization problem will be converted into the problem of maximizing system energy efficiency by introducing convex optimum theory；Energy based on interference threshold
Imitating maximization problems is For the transmit power of i-th pair D2D transmitting terminals,For
K bar channels, the interference channel gain between i-th pair D2D transmitting terminals and base station,It is patient most for k-th of phone user
Big interference.
3. multi-user's game improves the resource allocation methods of efficiency in a kind of cognition D2D communication systems according to claim 1,
It is characterized in that：The acquisition process of the efficiency maximization problems of D2D user and nest user is in the cognition wireless network：
First, the Signal to Interference plus Noise Ratio SINR of D2D user and phone user are calculated respectively；
The Signal to Interference plus Noise Ratio SINR of D2D pairs of i-th pair is on kth bar channel：
<mrow>
<msubsup>
<mi>&gamma;</mi>
<mi>i</mi>
<mi>k</mi>
</msubsup>
<mo>=</mo>
<mfrac>
<mrow>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mi>k</mi>
</msubsup>
<msubsup>
<mi>h</mi>
<mi>i</mi>
<mi>k</mi>
</msubsup>
</mrow>
<mrow>
<msubsup>
<mi>p</mi>
<mi>c</mi>
<mi>k</mi>
</msubsup>
<msubsup>
<mi>h</mi>
<mrow>
<mi>c</mi>
<mo>,</mo>
<mi>i</mi>
</mrow>
<mi>k</mi>
</msubsup>
<mo>+</mo>
<msubsup>
<mi>&Sigma;</mi>
<mrow>
<mi>j</mi>
<mo>=</mo>
<mn>1</mn>
<mo>,</mo>
<mi>j</mi>
<mo>&NotEqual;</mo>
<mi>i</mi>
</mrow>
<mi>N</mi>
</msubsup>
<msubsup>
<mi>p</mi>
<mi>j</mi>
<mi>k</mi>
</msubsup>
<msubsup>
<mi>h</mi>
<mrow>
<mi>j</mi>
<mo>,</mo>
<mi>i</mi>
</mrow>
<mi>k</mi>
</msubsup>
<mo>+</mo>
<msub>
<mi>N</mi>
<mn>0</mn>
</msub>
</mrow>
</mfrac>
</mrow>
Wherein,It is the transmit power of i-th pair D2D transmitting terminals,It is the transmit power of k-th of phone user,It is jth pair
The transmit power of D2D transmitting terminals,It is the channel gain between i-th pair D2D,It is that k-th of phone user connects to i-th pair D2D
The interference channel gain of receiving end,It is jth to interference channel gain of the D2D transmitting terminal to i-th pair D2D receiving terminals, N0To make an uproar
Acoustical power；
The Signal to Interference plus Noise Ratio SINR that base station receives k-th of phone user is：
<mrow>
<msubsup>
<mi>&gamma;</mi>
<mi>c</mi>
<mi>k</mi>
</msubsup>
<mo>=</mo>
<mfrac>
<mrow>
<msubsup>
<mi>p</mi>
<mi>c</mi>
<mi>k</mi>
</msubsup>
<msubsup>
<mi>h</mi>
<mi>c</mi>
<mi>k</mi>
</msubsup>
</mrow>
<mrow>
<msubsup>
<mi>&Sigma;</mi>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>N</mi>
</msubsup>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mi>k</mi>
</msubsup>
<msubsup>
<mi>h</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>c</mi>
</mrow>
<mi>k</mi>
</msubsup>
<mo>+</mo>
<msub>
<mi>N</mi>
<mn>0</mn>
</msub>
</mrow>
</mfrac>
</mrow>
Wherein,It is the channel gain between k-th of phone user and base station,In kth bar channel, i-th pair D2D is to transmitting terminal
Interference channel gain between base station；
Calculate the general power consumed of D2D user and phone user respectively again；
I-th pair D2D transmission rate isThe general power that i-th pair D2D is consumed is
<mrow>
<msubsup>
<mi>p</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>t</mi>
<mi>o</mi>
<mi>t</mi>
<mi>a</mi>
<mi>l</mi>
</mrow>
<mi>d</mi>
</msubsup>
<mo>=</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>k</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>M</mi>
</munderover>
<mfrac>
<mn>1</mn>
<mi>&eta;</mi>
</mfrac>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mi>k</mi>
</msubsup>
<mo>+</mo>
<mn>2</mn>
<msub>
<mi>p</mi>
<mrow>
<mi>c</mi>
<mi>i</mi>
<mi>r</mi>
</mrow>
</msub>
</mrow>
The transmission rate of k-th of honeycomb isThe circuit power consumption of base station, k-th of phone user institute are not considered
The general power of consumption is
<mrow>
<msubsup>
<mi>p</mi>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mi>t</mi>
<mi>o</mi>
<mi>t</mi>
<mi>a</mi>
<mi>l</mi>
</mrow>
<mi>c</mi>
</msubsup>
<mo>=</mo>
<mfrac>
<mn>1</mn>
<mi>&eta;</mi>
</mfrac>
<msubsup>
<mi>p</mi>
<mi>c</mi>
<mi>k</mi>
</msubsup>
<mo>+</mo>
<msub>
<mi>p</mi>
<mrow>
<mi>c</mi>
<mi>i</mi>
<mi>r</mi>
</mrow>
</msub>
</mrow>
Wherein, pcirIt is the circuit power consumption of user；D2D transmitting terminals and the equal generation circuit power consumption of receiving terminal, and all subscriber's line circuits
Power consumption is；η is power amplification coefficient power amplification ratio, 0<η<1；
The efficiency of i-th pair D2D user's transmitting terminal and the efficiency of k-th of phone user are finally calculated respectively；
The strategy of the transmitting terminal of i-th pair D2D user is
<mrow>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mi>d</mi>
</msubsup>
<mo>=</mo>
<mo>{</mo>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mi>k</mi>
</msubsup>
<mo>|</mo>
<mn>0</mn>
<mo>&le;</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>k</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>M</mi>
</munderover>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mi>k</mi>
</msubsup>
<mo>&le;</mo>
<msubsup>
<mi>p</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>m</mi>
<mi>a</mi>
<mi>x</mi>
</mrow>
<mi>d</mi>
</msubsup>
<mo>,</mo>
<mi>k</mi>
<mo>&Element;</mo>
<mi>M</mi>
<mo>}</mo>
<mo>,</mo>
<mo>&ForAll;</mo>
<mi>i</mi>
<mo>&Element;</mo>
<mi>N</mi>
</mrow>
Wherein,It is the maximum transmit power constraint of D2D user；
The strategy of k-th of phone user is
<mrow>
<msubsup>
<mi>p</mi>
<mi>k</mi>
<mi>c</mi>
</msubsup>
<mo>=</mo>
<mo>{</mo>
<msubsup>
<mi>p</mi>
<mi>c</mi>
<mi>k</mi>
</msubsup>
<mo>|</mo>
<mn>0</mn>
<mo>&le;</mo>
<msubsup>
<mi>p</mi>
<mi>c</mi>
<mi>k</mi>
</msubsup>
<mo>&le;</mo>
<msubsup>
<mi>p</mi>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mi>m</mi>
<mi>a</mi>
<mi>x</mi>
</mrow>
<mi>c</mi>
</msubsup>
<mo>}</mo>
<mo>,</mo>
<mo>&ForAll;</mo>
<mi>k</mi>
<mo>&Element;</mo>
<mi>M</mi>
</mrow>
Wherein,It is the maximum transmit power constraint of phone user；
It is in the strategy of other D2D user's transmitting terminals during N is to D2D pairs in addition to i-th pair D2D user：
<mrow>
<msubsup>
<mi>p</mi>
<mrow>
<mo>-</mo>
<mi>i</mi>
</mrow>
<mi>d</mi>
</msubsup>
<mo>=</mo>
<mo>{</mo>
<msubsup>
<mi>p</mi>
<mi>j</mi>
<mi>k</mi>
</msubsup>
<mo>|</mo>
<mn>0</mn>
<mo>&le;</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>k</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>M</mi>
</munderover>
<msubsup>
<mi>p</mi>
<mi>j</mi>
<mi>k</mi>
</msubsup>
<mo>&le;</mo>
<msubsup>
<mi>p</mi>
<mrow>
<mi>j</mi>
<mo>,</mo>
<mi>m</mi>
<mi>a</mi>
<mi>x</mi>
</mrow>
<mi>d</mi>
</msubsup>
<mo>,</mo>
<mi>k</mi>
<mo>&Element;</mo>
<mi>M</mi>
<mo>,</mo>
<mi>j</mi>
<mo>&Element;</mo>
<mi>N</mi>
<mo>,</mo>
<mi>j</mi>
<mo>&NotEqual;</mo>
<mi>i</mi>
<mo>}</mo>
<mo>,</mo>
<mo>&ForAll;</mo>
<mi>i</mi>
<mo>&Element;</mo>
<mi>N</mi>
</mrow>
The strategy of other phone users in M phone user in addition to k-th of phone user is：
<mrow>
<msubsup>
<mi>p</mi>
<mrow>
<mo>-</mo>
<mi>k</mi>
</mrow>
<mi>c</mi>
</msubsup>
<mo>=</mo>
<mo>{</mo>
<msubsup>
<mi>p</mi>
<mi>c</mi>
<mi>l</mi>
</msubsup>
<mo>|</mo>
<mn>0</mn>
<mo>&le;</mo>
<msubsup>
<mi>p</mi>
<mi>c</mi>
<mi>l</mi>
</msubsup>
<mo>&le;</mo>
<msubsup>
<mi>p</mi>
<mrow>
<mi>l</mi>
<mo>,</mo>
<mi>m</mi>
<mi>a</mi>
<mi>x</mi>
</mrow>
<mi>c</mi>
</msubsup>
<mo>,</mo>
<mi>l</mi>
<mo>&Element;</mo>
<mi>M</mi>
<mo>,</mo>
<mi>l</mi>
<mo>&NotEqual;</mo>
<mi>k</mi>
<mo>}</mo>
<mo>,</mo>
<mo>&ForAll;</mo>
<mi>k</mi>
<mo>&Element;</mo>
<mi>M</mi>
</mrow>
For in N to D2D pairs in other D2D user's transmitting terminals in addition to i-th pair D2D user maximum transmit power,For the maximum transmit power of other phone users in M phone user in addition to k-th of phone user；
The efficiency of i-th pair D2D userFor
<mrow>
<msubsup>
<mi>U</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>E</mi>
<mi>E</mi>
</mrow>
<mi>d</mi>
</msubsup>
<mrow>
<mo>(</mo>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mi>d</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>p</mi>
<mrow>
<mo>-</mo>
<mi>i</mi>
</mrow>
<mi>d</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>p</mi>
<mi>k</mi>
<mi>c</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>p</mi>
<mrow>
<mo>-</mo>
<mi>k</mi>
</mrow>
<mi>c</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfrac>
<msubsup>
<mi>r</mi>
<mi>i</mi>
<mi>d</mi>
</msubsup>
<msubsup>
<mi>p</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>t</mi>
<mi>o</mi>
<mi>t</mi>
<mi>a</mi>
<mi>l</mi>
</mrow>
<mi>d</mi>
</msubsup>
</mfrac>
<mo>=</mo>
<mfrac>
<mrow>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>k</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>M</mi>
</munderover>
<msub>
<mi>log</mi>
<mn>2</mn>
</msub>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>+</mo>
<msubsup>
<mi>&gamma;</mi>
<mi>i</mi>
<mi>k</mi>
</msubsup>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>k</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>M</mi>
</munderover>
<mfrac>
<mn>1</mn>
<mi>&eta;</mi>
</mfrac>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mi>k</mi>
</msubsup>
<mo>+</mo>
<mn>2</mn>
<msub>
<mi>p</mi>
<mrow>
<mi>c</mi>
<mi>i</mi>
<mi>r</mi>
</mrow>
</msub>
</mrow>
</mfrac>
</mrow>
The efficiency of k-th of phone userFor
<mrow>
<msubsup>
<mi>U</mi>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mi>E</mi>
<mi>E</mi>
</mrow>
<mi>c</mi>
</msubsup>
<mrow>
<mo>(</mo>
<mrow>
<msubsup>
<mi>p</mi>
<mi>i</mi>
<mi>d</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>p</mi>
<mrow>
<mo>-</mo>
<mi>i</mi>
</mrow>
<mi>d</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>p</mi>
<mi>k</mi>
<mi>c</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>p</mi>
<mrow>
<mo>-</mo>
<mi>k</mi>
</mrow>
<mi>c</mi>
</msubsup>
</mrow>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfrac>
<msubsup>
<mi>r</mi>
<mi>k</mi>
<mi>c</mi>
</msubsup>
<msubsup>
<mi>p</mi>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mi>t</mi>
<mi>o</mi>
<mi>t</mi>
<mi>a</mi>
<mi>l</mi>
</mrow>
<mi>c</mi>
</msubsup>
</mfrac>
<mo>=</mo>
<mfrac>
<mrow>
<munderover>
<mi>&Sigma;</mi>
<mrow>
<mi>k</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>M</mi>
</munderover>
<msub>
<mi>log</mi>
<mn>2</mn>
</msub>
<mrow>
<mo>(</mo>
<mrow>
<mn>1</mn>
<mo>+</mo>
<msubsup>
<mi>&gamma;</mi>
<mi>c</mi>
<mi>k</mi>
</msubsup>
</mrow>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<mfrac>
<mn>1</mn>
<mi>&eta;</mi>
</mfrac>
<msubsup>
<mi>p</mi>
<mi>c</mi>
<mi>k</mi>
</msubsup>
<mo>+</mo>
<msub>
<mi>p</mi>
<mrow>
<mi>c</mi>
<mi>i</mi>
<mi>r</mi>
</mrow>
</msub>
</mrow>
</mfrac>
<mo>.</mo>
</mrow>
4. energy is improved according to multi-user's game in a kind of any one of Claim 1-3 cognition D2D communication systems
The resource allocation methods of effect, it is characterised in that：D2D user and the power policy collection P of phone userdAnd PcRespectively
5. the resource point of efficiency is improved according to multi-user's game in a kind of any one of claim 4 cognition D2D communication systems
Method of completing the square, it is characterised in that：Efficiency maximization problems in the S2 using Lagrange duality method solution procedure includes looking for
To the power for maximizing efficiency and find minimum two contents of Lagrange factor corresponding to optimal power.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710391811.2A CN107426820B (en) | 2017-05-27 | 2017-05-27 | Resource allocation method for improving energy efficiency of multi-user game in cognitive D2D communication system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710391811.2A CN107426820B (en) | 2017-05-27 | 2017-05-27 | Resource allocation method for improving energy efficiency of multi-user game in cognitive D2D communication system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107426820A true CN107426820A (en) | 2017-12-01 |
| CN107426820B CN107426820B (en) | 2021-05-18 |
Family
ID=60429246
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710391811.2A Active CN107426820B (en) | 2017-05-27 | 2017-05-27 | Resource allocation method for improving energy efficiency of multi-user game in cognitive D2D communication system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107426820B (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108093411A (en) * | 2018-01-10 | 2018-05-29 | 重庆邮电大学 | Scheduling of resource optimization method based on channel signature in D2D communication networks |
| CN108156624A (en) * | 2018-02-08 | 2018-06-12 | 南京邮电大学 | Interference dynamic optimization method based on game theory in super-intensive networking |
| CN108366427A (en) * | 2018-03-16 | 2018-08-03 | 西安电子科技大学 | Throughput of system and efficiency balance method based on power control in D2D communications |
| CN108377481A (en) * | 2018-02-02 | 2018-08-07 | 东南大学 | A kind of D2D communication spectrum resource allocation methods of energy and rate perception |
| CN108449737A (en) * | 2018-03-08 | 2018-08-24 | 南京航空航天大学 | Downlink high energy efficiency power distribution method based on D2D in a kind of distributing antenna system |
| CN108495339A (en) * | 2018-03-21 | 2018-09-04 | 浙江理工大学 | A kind of wireless network traffic load sharing method for improving Duality Decomposition based on momentum |
| CN108601083A (en) * | 2018-03-16 | 2018-09-28 | 西安电子科技大学 | Method for managing resource based on non-cooperative game in D2D communications |
| CN108718446A (en) * | 2018-05-22 | 2018-10-30 | 吉林大学 | D2D model selections and resource allocation methods in LTE-A network |
| CN110225578A (en) * | 2019-05-30 | 2019-09-10 | 华南师范大学 | A method of the D2D resource allocation based on graph coloring |
| CN110809259A (en) * | 2019-10-28 | 2020-02-18 | 南京邮电大学 | Social relationship-based NOMA enabled D2D communication resource gaming method |
| CN111083668A (en) * | 2020-01-02 | 2020-04-28 | 山东大学 | D2D resource allocation method based on alliance game algorithm in Internet of vehicles |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012066433A1 (en) * | 2010-11-19 | 2012-05-24 | Nokia Corporation | Signaling mixed resource allocations for d2d communications |
| CN104066098A (en) * | 2013-03-18 | 2014-09-24 | 上海贝尔股份有限公司 | Method used for distributed wireless network and equipment thereof |
| CN104796991A (en) * | 2015-04-08 | 2015-07-22 | 南京邮电大学 | OFDMA (orthogonal frequency division multiple access) system resource distributing method based on potential game |
| CN104883727A (en) * | 2015-06-10 | 2015-09-02 | 中国人民解放军理工大学 | Power distribution method for D2D user rate maximization in cellular heterogeneous network |
| CN104954970A (en) * | 2015-05-28 | 2015-09-30 | 中国科学院计算技术研究所 | D2D (device to device) resource allocation method and system |
| WO2015152797A1 (en) * | 2014-04-01 | 2015-10-08 | Telefonaktiebolaget L M Ericsson (Publ) | System and method for obtaining and using device-to-device frequency-related capability and configuration preferences |
| WO2016166705A1 (en) * | 2015-04-15 | 2016-10-20 | Telefonaktiebolaget L M Ericsson (Publ) | Energy-efficient multi-hop communication schemes for wireless networks |
| CN106604398A (en) * | 2016-11-25 | 2017-04-26 | 北京邮电大学 | Resource distribution method and device |
-
2017
- 2017-05-27 CN CN201710391811.2A patent/CN107426820B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012066433A1 (en) * | 2010-11-19 | 2012-05-24 | Nokia Corporation | Signaling mixed resource allocations for d2d communications |
| CN104066098A (en) * | 2013-03-18 | 2014-09-24 | 上海贝尔股份有限公司 | Method used for distributed wireless network and equipment thereof |
| WO2015152797A1 (en) * | 2014-04-01 | 2015-10-08 | Telefonaktiebolaget L M Ericsson (Publ) | System and method for obtaining and using device-to-device frequency-related capability and configuration preferences |
| CN104796991A (en) * | 2015-04-08 | 2015-07-22 | 南京邮电大学 | OFDMA (orthogonal frequency division multiple access) system resource distributing method based on potential game |
| WO2016166705A1 (en) * | 2015-04-15 | 2016-10-20 | Telefonaktiebolaget L M Ericsson (Publ) | Energy-efficient multi-hop communication schemes for wireless networks |
| CN104954970A (en) * | 2015-05-28 | 2015-09-30 | 中国科学院计算技术研究所 | D2D (device to device) resource allocation method and system |
| CN104883727A (en) * | 2015-06-10 | 2015-09-02 | 中国人民解放军理工大学 | Power distribution method for D2D user rate maximization in cellular heterogeneous network |
| CN106604398A (en) * | 2016-11-25 | 2017-04-26 | 北京邮电大学 | Resource distribution method and device |
Non-Patent Citations (4)
| Title |
|---|
| ZHENYU ZHOU ET AL: "Energy-Efficient Resource Allocation for D2D Communications Underlaying Cloud-RAN-Based LTE-A Networks", 《 IEEE INTERNET OF THINGS JOURNAL》 * |
| 肖琦: "基于SCMA的D2D系统中无线资源管理研究", 《西南交通大学硕士学位论文》 * |
| 谢显中，李传文，杨和林: "认知D2D通信中基于博弈论的动态频谱分配方案", 《北京邮电大学学报》 * |
| 谢显中，田瑜，姚鑫凌，雷维嘉: "认知网络中D2D全双工通信的速率最大化功率分配算法", 《电子与信息学报》 * |
Cited By (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108093411B (en) * | 2018-01-10 | 2021-11-16 | 重庆邮电大学 | Resource scheduling optimization method based on channel signature in D2D communication network |
| CN108093411A (en) * | 2018-01-10 | 2018-05-29 | 重庆邮电大学 | Scheduling of resource optimization method based on channel signature in D2D communication networks |
| CN108377481B (en) * | 2018-02-02 | 2019-12-10 | 东南大学 | energy and rate sensing D2D communication spectrum resource allocation method |
| CN108377481A (en) * | 2018-02-02 | 2018-08-07 | 东南大学 | A kind of D2D communication spectrum resource allocation methods of energy and rate perception |
| CN108156624A (en) * | 2018-02-08 | 2018-06-12 | 南京邮电大学 | Interference dynamic optimization method based on game theory in super-intensive networking |
| CN108156624B (en) * | 2018-02-08 | 2020-12-15 | 南京邮电大学 | Interference dynamic optimization method based on game theory in ultra-dense networking |
| CN108449737A (en) * | 2018-03-08 | 2018-08-24 | 南京航空航天大学 | Downlink high energy efficiency power distribution method based on D2D in a kind of distributing antenna system |
| CN108449737B (en) * | 2018-03-08 | 2020-12-25 | 南京航空航天大学 | D2D-based downlink energy-efficient power distribution method in distributed antenna system |
| CN108601083B (en) * | 2018-03-16 | 2019-12-24 | 西安电子科技大学 | Resource management method based on non-cooperative game in D2D communication |
| CN108601083A (en) * | 2018-03-16 | 2018-09-28 | 西安电子科技大学 | Method for managing resource based on non-cooperative game in D2D communications |
| CN108366427A (en) * | 2018-03-16 | 2018-08-03 | 西安电子科技大学 | Throughput of system and efficiency balance method based on power control in D2D communications |
| CN108366427B (en) * | 2018-03-16 | 2021-06-25 | 西安电子科技大学 | System throughput and energy efficiency balancing method based on power control in D2D communication |
| CN108495339B (en) * | 2018-03-21 | 2021-07-20 | 浙江理工大学 | Wireless network traffic load sharing method based on momentum improved dual decomposition |
| CN108495339A (en) * | 2018-03-21 | 2018-09-04 | 浙江理工大学 | A kind of wireless network traffic load sharing method for improving Duality Decomposition based on momentum |
| CN108718446B (en) * | 2018-05-22 | 2020-07-14 | 吉林大学 | L TE-A network D2D mode selection and resource allocation method |
| CN108718446A (en) * | 2018-05-22 | 2018-10-30 | 吉林大学 | D2D model selections and resource allocation methods in LTE-A network |
| CN110225578A (en) * | 2019-05-30 | 2019-09-10 | 华南师范大学 | A method of the D2D resource allocation based on graph coloring |
| CN110225578B (en) * | 2019-05-30 | 2022-05-24 | 华南师范大学 | D2D resource allocation method based on graph coloring |
| CN110809259A (en) * | 2019-10-28 | 2020-02-18 | 南京邮电大学 | Social relationship-based NOMA enabled D2D communication resource gaming method |
| CN110809259B (en) * | 2019-10-28 | 2022-08-26 | 南京邮电大学 | Social relationship-based NOMA enabled D2D communication resource gaming method |
| CN111083668A (en) * | 2020-01-02 | 2020-04-28 | 山东大学 | D2D resource allocation method based on alliance game algorithm in Internet of vehicles |
| CN111083668B (en) * | 2020-01-02 | 2021-06-11 | 山东大学 | D2D resource allocation method based on alliance game algorithm in Internet of vehicles |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107426820B (en) | 2021-05-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107426820A (en) | Multi-user's game improves the resource allocation methods of efficiency in a kind of cognition D2D communication systems | |
| CN109729528B (en) | D2D resource allocation method based on multi-agent deep reinforcement learning | |
| CN109474980B (en) | Wireless network resource allocation method based on deep reinforcement learning | |
| CN108600999B (en) | FD-D2D joint optimization method based on channel allocation and power control | |
| He et al. | Resource allocation based on graph neural networks in vehicular communications | |
| CN104796990B (en) | D2D resource allocation methods based on Power Control in honeycomb heterogeneous network | |
| CN107172576B (en) | D2D communication downlink resource sharing method for enhancing cellular network security | |
| CN108924799B (en) | Resource allocation algorithm for D2D communication in cellular network | |
| CN111586646A (en) | Resource allocation method for D2D communication combining uplink and downlink channels in cellular network | |
| CN109788540A (en) | Power control and method for channel allocation in D2D system based on energy acquisition | |
| CN109272167B (en) | Green energy cooperation method based on UUDN and Q neural network | |
| Kumari | Investigation: life-time and stability period in wireless sensor network | |
| Yang et al. | Energy-aware joint power and rate control in overlay cognitive radio networks: a Nash bargaining perspective | |
| CN105979477B (en) | A kind of energy consumption optimization method of the D2D communication based on game theory | |
| El-Nakhla et al. | Stable matching relay selection (SMRS) for TWR D2D network with RF/RE EH capabilities | |
| Sun et al. | Distributed power control for device-to-device network using stackelberg game | |
| CN110139282A (en) | A kind of energy acquisition D2D communication resource allocation method neural network based | |
| Huang et al. | Coalitional games based resource allocation for D2D uplink underlaying hybrid VLC-RF networks | |
| Shaima’S et al. | Energy-efficient resource allocation for 5G cognitive radio NOMA using game theory | |
| CN109547979B (en) | Content distribution method combining energy consumption and user fairness under D2D cache network | |
| CN107567034A (en) | A kind of D2D resource share methods in isomery cellular network | |
| CN114423070B (en) | Heterogeneous wireless network power distribution method and system based on D2D | |
| CN110167171A (en) | A kind of method and system of wireless power communication network resource distribution | |
| Lin et al. | Fast spectrum reuse and power control for device-to-device communication | |
| CN105960005A (en) | Power control method for ensuring user fairness in ultra-dense network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |