CN110518995A - The federated resource distribution method once auctioned based on Shapley value - Google Patents

The federated resource distribution method once auctioned based on Shapley value Download PDF

Info

Publication number
CN110518995A
CN110518995A CN201910721760.4A CN201910721760A CN110518995A CN 110518995 A CN110518995 A CN 110518995A CN 201910721760 A CN201910721760 A CN 201910721760A CN 110518995 A CN110518995 A CN 110518995A
Authority
CN
China
Prior art keywords
user
user terminal
indicate
channel
value
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
Application number
CN201910721760.4A
Other languages
Chinese (zh)
Other versions
CN110518995B (en
Inventor
李民政
苗春伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai Dianji University
Original Assignee
Shanghai Dianji University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shanghai Dianji University filed Critical Shanghai Dianji University
Priority to CN201910721760.4A priority Critical patent/CN110518995B/en
Publication of CN110518995A publication Critical patent/CN110518995A/en
Application granted granted Critical
Publication of CN110518995B publication Critical patent/CN110518995B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B17/00Monitoring; Testing
    • H04B17/30Monitoring; Testing of propagation channels
    • H04B17/309Measuring or estimating channel quality parameters
    • H04B17/336Signal-to-interference ratio [SIR] or carrier-to-interference ratio [CIR]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B17/00Monitoring; Testing
    • H04B17/30Monitoring; Testing of propagation channels
    • H04B17/382Monitoring; Testing of propagation channels for resource allocation, admission control or handover
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W4/00Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/70Services for machine-to-machine communication [M2M] or machine type communication [MTC]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W76/00Connection management
    • H04W76/10Connection setup
    • H04W76/14Direct-mode setup
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Abstract

The present invention provides a kind of federated resource distribution method once auctioned based on Shapley value, comprising steps of S1: establishing communication system;S2: the Signal to Interference plus Noise Ratio at different user end in same channel is calculated;S3: it establishes user coalitions model: S4: the power of user terminal is initialized;S5: the value of utility after calculating the one target user end of value of utility and removal of whole user terminals of user coalitions model;S6: Shapley value of each user terminal under different channels is calculated;S7: each user terminal is calculated to the bidding strategy of different channels according to Shapley value;S8: user terminal is distributed under highest channel of bidding using bid matrix;S9: the power of user terminal is optimized.A kind of federated resource distribution method once auctioned based on Shapley value of the invention, can effectively solve the problems, such as that interaction complexity is high between base station and user, improve fairness and safety in channel allocation.

Description

The federated resource distribution method once auctioned based on Shapley value
Technical field
The present invention relates to federated resources in D2D communication system to distribute field, more particularly to a kind of primary based on Shapley value The federated resource distribution method of auction.
Background technique
The D2D communication technology is becoming the key technology for improving future network capacity.As D2D user's use and phone user When using identical channel, will cause some need be solved the problems, such as: effective distribution of phone user's channel resource;Channel multiplexing The interference between user is eliminated afterwards;The high complexity that base station is interacted with user-to-user information is effectively reduced.The solution of problem above needs Want combined channel distribution and power control.Existing solution generally passes through complicated mathematical processing methods, such as decomposes non- Convexity resource allocation problem is iterated solution, violates the law to obtain suboptimum power distribution strategies by Lagrange duality, use Dinkelbach and branch and bound method solve the methods of global optimum, and the federated resource assignment problem of high complexity is optimized, Find suboptimal solution.But there is no solve for these schemes: resource allocation fairness, high computation complexity and base station and user Between interactive information high complexity issue.
Summary of the invention
In view of the deficiency of the prior art, the present invention provides a kind of joint money once auctioned based on Shapley value Source distribution method can effectively solve the problems, such as that interaction complexity is high between base station and user, and improve in channel allocation Fairness and safety.
To achieve the goals above, the present invention provides a kind of federated resource distribution side once auctioned based on Shapley value Method, comprising steps of
S1: establishing a communication system, and the communication system includes the base station for being respectively arranged with omnidirectional antenna and multiple use Family end, the user terminal include multiple phone user ends and multiple D2D user terminals, pass through the base between the phone user end It stands communication connection, is communicated to connect two-by-two between the D2D user terminal;It is between the phone user end and the base station and described Channel is formed between D2D user terminal;
S2: the Signal to Interference plus Noise Ratio of the different user terminals in the same channel is calculated;
S3: a user coalitions model is established:
S4: the power of the user terminal is initialized;
S5: calculating the value of utility of whole user terminals of the user coalitions model and removes the value of utility at a target user end;
S6: Shapley value of each user terminal under different channels is calculated;
S7: each user terminal is calculated to the bidding strategy of different channels according to the Shapley value, and forms a bid matrix;
S8: the user terminal is distributed under a highest channel of bidding using the bid matrix, described in update User coalitions model;
S9: the power of the user terminal is optimized.
Preferably, the letter for calculating the different user terminals in the same channel by formula (1) in the S2 step is dry It makes an uproar ratio:
Wherein, γkIndicate the Signal to Interference plus Noise Ratio at phone user end, pkIndicate the transmission power at phone user end, gkeIndicate bee User's gain of channel between nest user terminal and base station, H indicate the pairs of quantity of D2D user terminal, pd、pd′It is different to respectively indicate two The transmission power of D2D user terminal;gdeIndicate user's gain of channel between D2D user terminal and base station;σ2Indicate that the heat of receiving end is made an uproar Acoustical power;γdIndicate the Signal to Interference plus Noise Ratio of D2D user terminal, gddIndicate user's gain of channel between D2D user terminal, gkdIndicate bee User's gain of channel between nest user terminal and D2D user terminal;gd′dUser's gain of channel between two difference D2D user terminals of expression.
Preferably, it in the S3 step, further comprises the steps of:
Define the game of the user coalitions model:
Wherein,Indicating game, I indicates the set of the user terminal,Indicate the policy space of terminal; Indicate effectiveness formula;pjIndicate the transmission power of user j, p-jIndicate the set of remaining users transmission power other than user j;
γjIncluding γkOr γd;R is transmission rate;The bit number of M expression transmission frame;ljIndicate service time of battery;cj (pj, p-j) indicate cost function;
Wherein, C indicates battery capacity, pjIt is the transmission power of jth user terminal, p0It is circuit consumption power, V0It is work Voltage, a expression parameter;
cj(pj, p-j)=cpj(5);
Wherein, c indicates the price of jth user terminal.
Preferably, the power of the user terminal is initialized using the solution of a formula (6) in the S4 step:
Wherein, S indicates the user coalitions model, S=[S1..., Si... SK], K indicates orthogonal channel in the channel Number, SKIndicate the set at phone user end described in K orthogonal channel and the D2D user terminal;
The lower bound of formula (6) disaggregation is calculated by the formula (7) of non-decreasing differentiability condition and is obtained:
Preferably, the effectiveness of whole user terminals of the user coalitions model is calculated in the S5 step according to formula (8) Value v (S(i)) and remove jth user terminal after value of utility v (S(i))-v(S(i)/{j});
Wherein, S(i)Indicate a set in user coalitions model;I ∈ K,j∈H;Wherein, N indicates to use The set number for including in the alliance model of family, H indicate the pairs of quantity of the D2D user terminal.
Preferably, Shapley value of each user terminal under different channels is calculated according to a formula (9) in the S6 step
Wherein, j=1,2 ..., H.
Preferably, in the S7 step, each user terminal pair is calculated according to the Shapley value and using a formula (10) The bidding strategy of different channelsAnd form the bid matrix
Preferably, in the S8 step, the user terminal is distributed in the highest institute that bids using a formula (11) It states under channel;
Wherein, i=1,2 ... K, j=1,2 ... H;j*Indicate user terminal.
Preferably, in the S9 step, the power of presently described user terminal is optimized using formula (6).
The present invention due to use above technical scheme, make it have it is following the utility model has the advantages that
Method of the invention is disposably submitted Any and All Bid, is solved present in channel distribution by establishing utility function The high problem of interaction complexity;And there is the property of resource allocation fairness using Shapley value, to solve for channel distribution Inequitable problem.The fairness and peace of bid are improved according to the bid of the value calculation user of channel using relative bid method Quan Xing avoids illegitimate competition.
Detailed description of the invention
Fig. 1 is the flow chart for the federated resource distribution method of the embodiment of the present invention once auctioned based on Shapley value;
Fig. 2 is the structural schematic diagram of the communication system of the embodiment of the present invention;
Fig. 3 is the total utility value of the equal-wattage strategy of the embodiment of the present invention with D2D logarithm change curve schematic diagram;
Fig. 4 is that the complete algorithm of the embodiment of the present invention compares total utility value with D2D logarithm change curve schematic diagram;
Fig. 5 is the general power of the embodiment of the present invention with the change curve schematic diagram of D2D logarithm;
Fig. 6 is that the terminal of the embodiment of the present invention uses the time with D2D logarithm change curve schematic diagram;
Fig. 7 is the Signal to Interference plus Noise Ratio of the embodiment of the present invention with the change curve schematic diagram of D2D logarithm.
Specific embodiment
Below according to attached FIG. 1 to FIG. 7, presently preferred embodiments of the present invention is provided, and is described in detail, is enabled more preferable geographical Solve function of the invention, feature.
Please refer to Fig. 1 and Fig. 2, a kind of federated resource distribution once auctioned based on Shapley value of the embodiment of the present invention Method, comprising steps of
S1: establishing a communication system, and communication system includes the base station 1 for being respectively arranged with omnidirectional antenna and multiple users End, user terminal include multiple phone user ends 2 and multiple D2D user terminals 3, pass through 1 communication link of base station between phone user end 2 It connects, is communicated to connect two-by-two between D2D user terminal 3;Channel is formed between phone user end 2 and base station 1 and between D2D user terminal 3.
Base station 1 is set to the center of housing estate with multi-user.Cell includes multiple phone user ends 2 and multiple D2D users Hold the pairs of direct communication of 3, D2D user terminal 3 and close enough.Wherein, the quantity at phone user end 2 is K, the number of D2D user terminal 3 Amount is H.As cell has K orthogonal channel, and each phone user end 2 occupies an orthogonal channel, and D2D user terminal 3 can be with 2 channel resource of phone user end is reused, and multiple D2D user terminals 3 to can share identical channel simultaneously.
In the scene that uplink resource is shared, phone user end 2 transmits data to base station, and base station is come from The interference of D2D user terminal 3.In the communications, receiver is by from D2D user terminal 3 and other D2D user terminals for D2D user terminal 3 The interference of 3 transmitters.Orthogonal channel is used between the user coalitions that each D2D user terminal 3 forms, and does not consider disturbed condition.
S2: the Signal to Interference plus Noise Ratio at different user end in same channel is calculated.
The Signal to Interference plus Noise Ratio at different user end in same channel is calculated in S2 step by formula (1):
Wherein, γkIndicate the Signal to Interference plus Noise Ratio at phone user end 2, pkIndicate the transmission power at phone user end 2, gkeIt indicates User's gain of channel between phone user end 2 and base station 1, H indicate the pairs of quantity of D2D user terminal 3, pd、pd′Respectively indicate two The transmission power of different D2D user terminals 3;gdeIndicate user's gain of channel between D2D user terminal 3 and base station 1;σ2It indicates to receive The thermal noise power at end;γdIndicate the Signal to Interference plus Noise Ratio of D2D user terminal 3, gddIndicate that the user of channel between D2D user terminal 3 increases Benefit, gkdIndicate user's gain of channel between phone user end 2 and D2D user terminal 3;gd′dBetween two difference D2D user terminals 3 of expression User's gain of channel.
S3: a user coalitions model is established:
In S3 step, further comprise the steps of:
Define the game of user coalitions model:
Wherein,Indicating game, I indicates the set of user terminal,Indicate the policy space of terminal;Table Show effectiveness formula;pjIndicate the transmission power of user j, p-jIndicate the set of remaining users transmission power other than user j;
γjIncluding γkOr γd;R is transmission rate;The bit number of M expression transmission frame;ljIndicate service time of battery;cj (pj, p-j) indicate cost function;
Wherein, C indicates battery capacity, pjIt is the transmission power of jth user terminal, p0It is circuit consumption power, V0It is work Voltage, a expression parameter;
cj(pj, p-j)=cpj(5);
Wherein, c indicates the price of jth user terminal.
S4: the power of user terminal is initialized.
The power of user terminal is initialized using the solution of a formula (6) in S4 step:
Wherein, S indicates user coalitions model, S=[S1..., Si... SK], K indicates the number of orthogonal channel in channel, SK Indicate the set at phone user end 2 and D2D user terminal 3 in K orthogonal channel;
The lower bound of formula (6) disaggregation is calculated by the formula (7) of non-decreasing differentiability condition and is obtained:
In the present embodiment, all D2D user terminals 3 for participating in auction can be indicated with j, j ∈ H, calculate value of utility and submission pair The bid of each channel i, the bid are the assessment that user is worth channel.It is asked to solve interaction complexity and fairness in distribution Topic, using calculating bid based on the method for opposite Shapley value.Auctioner selects the highest (i that bids*, j*), then by bee Nest user i*The channel distribution occupied gives bidder j*, j*User coalitions S is addedi*In;
S5: the value of utility v (S of whole user terminals of user coalitions model is calculated according to formula (8)(i)) and removing jth user Value of utility v (S behind end(i))-v(S(i)/{j});
Wherein, S(i)Indicate a set in user coalitions model;I ∈ K,j∈H;Wherein, N indicates to use The set number for including in the alliance model of family, H indicate the pairs of quantity of D2D user terminal 3.
Can be used for indicating in formula (8) disposably auctioning optimization problem, alliance S includes | N |=2HA combination, S(i)It is | N | One in a combination alliance, N indicates the set of all possible alliances of user terminal composition.
S6: Shapley value of each user terminal under different channels is calculated according to a formula (9)
Wherein, j=1,2 ..., H.
Wherein, v (S(i))-v(S(i)/ { j }) indicate jth user terminal to alliance S in the i-th channel(i)Contributrion margin;| S | table Show user's number in alliance, M indicates maximum user's number, M=H+1 in an alliance.
S7: each user terminal is calculated to the bidding strategy of different channels according to Shapley value and using a formula (10)And form bid matrix
In the present embodiment, in order to ensure user bid fairness and bid data safety, avoid information leakage and Wrongful competition;The present invention is further improved bidding strategy, uses Indicate all D2D user terminals 3 to the bid vector of channel i, in which:
S8: user terminal is distributed under a highest channel of bidding using a formula (11), updates user coalitions model;
Wherein, i=1,2 ... K, j=1,2 ... H;j*Indicate user terminal.
S9: the power at active user end is optimized using formula (6).
By gameIt is modeled as equilibria of Supermodular Games, passes through equilibria of Supermodular Games theoretical researchIn receive it is assorted Existence of equilibrium problem simultaneously obtains its analytic solutions pcbest.Power control is carried out to user using the solution, interference is reduced, promotes user The total utility value of alliance, the solution are expressed as:
Wherein, the minimum power p of strategy set_j, by non-decreasing differentiability conditionIt is calculated.
For example, it is contemplated that single circular cell, phone user end 2 and D2D user terminal 3 to it is uniformly distributed wherein, due to imitative True condition limits, and sets K=2 for 2, phone user end number in simulation process, only considers that D2D user terminal 3 divides in two channels With problem.System operates in uplink periods, it is assumed that all channels, gain follow simple path loss modelWherein A=0.097 is a constant, dijIndicate the distance between different terminals.Other parameters are shown in Table 1, foundation The method of above-described embodiment then has:
1 parameter list of table
(1) traffic model is established as shown in Figure 1, the quantity of phone user end 2 and D2D user terminal 3 is K and H respectively.Honeycomb There is K orthogonal channel in cell, and each phone user end 2 occupies an orthogonal channel.D2D user terminal 3 can reuse bee The channel resource that nest user terminal 2 occupies, and multiple D2D user terminals 3 to can share identical channel simultaneously.
(2) phone user end 2 transmits data to base station 1 in the scene that uplink resource is shared, and base station 1 by Interference from 3 transmitter of D2D user terminal.D2D user terminal 3 is in the communications, and receiver is by from 2 He of phone user end The interference of other 3 transmitters of D2D user terminal.Orthogonal channel is used between the user coalitions that each phone user end 2 forms, and is not examined Consider disturbed condition.Therefore the Signal to Interference plus Noise Ratio of different user is respectively as follows: in the same channel
Wherein p represents transmission power, and subscript k, d, d ' respectively indicate phone user end 2 and different D2D user terminals 3.gij Indicate that the channel gain between different user, subscript i, j indicate user terminal to the letter between base station 1 or customer edge-to-customer edge Road.σ2Indicate the thermal noise power of receiving end.
(3) user coalitions are defined as game by the utility function for constructing resource allocation Its Middle I represents the set of user in game, shown in designed utility function such as formula (12):
The utility function can be realized terminal and use the maximization of handling capacity in the time.Wherein:
uj(pj, p-j)=Rf (γj)lj;Rf (γ in formulaj)ljIndicating handling capacity, R is transmission rate, For the probability for accurately receiving data frame, M is the bit number of transmission frame, γjFor phone user end or D2D user The Signal to Interference plus Noise Ratio at end.For service time of battery, middle C is battery capacity, pjIt is the transmitting function of terminal user j Rate, p0It is circuit consumption power, V0It is operating voltage, a is constant of the value near 1.3.cj(pj, p-j) it is cost function, it uses The linear function of power calculates i.e. cj(pj, p-j)=cpj, optimal price cbest is obtained using iterative algorithm, thus most The total utility value of bigization user.
(4) channel distribution is carried out, the combination that phone user end 2 under the same channel and D2D user terminal 3 are formed is defined as Alliance S.Then K phone user end 2 occupies K orthogonal channel, forms K user coalitions i.e.: [S1..., Si... SK].All ginsengs It is expressed as j, j ∈ H with the D2D user terminal 3 of auction, calculate value of utility and submits the bid to each channel i, which is user Assessment to channel value.In order to solve the problems, such as interaction complexity and fairness in distribution, the side based on opposite Shapley value is used Method is bid to calculate.Auctioner selects the highest (i that bids*, j*), then by phone user i*The channel distribution occupied is to auction Person j*, j*S in user coalitions is addedi*
(5) v (S) is the utility function of alliance, and disposable optimization problem of auctioning indicates are as follows:
In formula, alliance S includes | N |=2HA combination, S(i)It is | N | one in a combination alliance, N indicates user's composition All possible alliances set.It enablesIndicate all D2D user terminals 3 in channel i Shapley value vector.The Shapley value of user j in channel iIt calculates as follows:
Wherein, j=1,2 ..., H.
v(S(i))-v(S(i)/ { j }) indicate user terminal j to alliance S in channel i(i)Contributrion margin, | S | indicate alliance in User terminal number, M indicate maximum user's number, M=H+1 in an alliance;
(6) in order to ensure the fairness of user's bid and the safety of bid data, information leakage and wrongful is avoided Competition is further improved bidding strategy, usesIndicate all D2D users Hold the bid vector of 3 couples of channel i, in which:
After all users submit bid, bid matrix is obtainedBase station is according to formula (11) channel is distributed for user;
Wherein, i=1,2 ... K, j=1,2 ... H;j*Indicate user terminal.
(7) power control, by gameIt is modeled as equilibria of Supermodular Games, passes through equilibria of Supermodular Games theory ResearchMiddle Nash Equilibrium Existence problems simultaneously obtain its analytic solutions pcbest.Power control is carried out to user using the solution, is reduced Interference, promotes the total utility value of user coalitions, which is expressed as:
Wherein, the minimum power p of strategy set-j, by non-decreasing differentiability conditionIt is calculated.
(8) basic ideas of this method are: assuming that all alliances combine etc. and to be likely to occur, using Shapley valueTo indicate that D2D user terminal 3 is represented by j to the average contributrion margin of all alliances in channel i.User j's Shapley value accurately reflects the bargaining power of the user and to i-th of channel bring contributrion margin.Then, Bid vector is calculated according to Shapley valueForm bid matrix.Finally, using disposable auction mechanism, from bid matrix In select bid highest (i*, j*), by channel i*Distribute to user j*.The mechanism can be minimized more between user and base station The requirement of secondary interaction, each user once submit the bid of all channels.Detailed process is as follows for method:
Step 1: initialization, according to the solution of formula (6)Initialization is used Family power;
Step 2: the value of utility v (S of all alliances is calculated according to formula (8)(i)), i ∈ K,And it is removed in alliance Value of utility v (S after j-th of user(i)/ { j }), j ∈ H;
Step 3: calculating Shapley value of each user under different channels according to formula (9)I ∈ K, j ∈ H.
Step 4: each user is calculated to the bidding strategy of different channels according to the Shapley value of step 3i∈ K, j ∈ H, composition bid vector
Step 5: according to bid matrixUsing formula (11), user is distributed at it It bids under highest channel, the new alliance of composition.
Step 6: in the new alliance of composition, reusing the solution of formula (6) Optimize user power, method terminates.
A kind of federated resource distribution method once auctioned based on Shapley value of the embodiment of the present invention is communicated for D2D Synchronous interaction complexity is high between base station and user present in system combined resource allocation, channel distribution is unfair and user Between serious interference the problems such as.Using the total utility value for maximizing alliance user as target, propose a kind of based on Shapley value one The federated resource distribution method of secondary auction (Shapley One-shotAuction, SA).Wherein each D2D user is based on Shapley value disposably submits the bid of all channels, and user distributes under the relatively high channel of its bid value.It is based on The effectiveness of shapley value is estimated, it can be estimated that user is and then maximum to contribution by channel distribution to the average contributrion margin of channel User, and promoted user coalitions total utility value, to greatest extent using channel resource and reduce inter-user interference.In order into One-step optimization power distribution in the user coalitions composed by each channel, carries out power control using the Pareto solution that is dominant, into The reduction of one step is interfered.This method, which has, to be reduced interaction complexity, reduces total transmission power, mitigates inter-user interference, may be used also To promote user coalitions total utility value, extend the advantages of terminal is using the time.
That is, the method for the embodiment of the present invention disposably submits Any and All Bid by using disposable auction mechanism, solve The high problem of interaction complexity present in channel distribution.There is the property of resource allocation fairness using Shapley value, to solve Certainly it is directed to the inequitable problem of channel distribution.It is improved out using relative bid method according to the bid of the value calculation user of channel The fairness and safety of valence, avoid illegitimate competition.
Meanwhile Fig. 3~Fig. 7 is please referred to by the simulated effect curve that emulation obtains;
Wherein, SA indicates the federated resource allocation algorithm once auctioned based on Shapley value in Fig. 3~Fig. 5;CA indicates base In the combined resource auction algorithm of Nash Equilibrium Solution;
In Fig. 6 and Fig. 7, k indicates that phone user, d indicate D2D user;SA, k and CA, k are respectively indicated using algorithms of different Phone user;SA, d and CA, d respectively indicate the D2D user using algorithms of different.
By the simulated effect figure of Fig. 3~Fig. 7 as it can be seen that one kind of the embodiment of the present invention is once auctioned based on Shapley value Federated resource distribution method, possess more in terms of system total utility value, terminal use time, time complexity and transmission power Good performance.
The present invention has been described in detail with reference to the accompanying drawings, those skilled in the art can be according to upper It states and bright many variations example is made to the present invention.Thus, certain details in embodiment should not constitute limitation of the invention, this Invention will be using the range that the appended claims define as protection scope of the present invention.

Claims (9)

1. a kind of federated resource distribution method once auctioned based on Shapley value, comprising steps of
S1: establishing a communication system, and the communication system includes being respectively arranged with a base station and a plurality of clients of omnidirectional antenna, The user terminal includes multiple phone user ends and multiple D2D user terminals, is led between the phone user end by the base station Letter connects, and communicates to connect two-by-two between the D2D user terminal;Between the phone user end and the base station and the D2D Channel is formed between user terminal;
S2: the Signal to Interference plus Noise Ratio of the different user terminals in the same channel is calculated;
S3: a user coalitions model is established:
S4: the power of the user terminal is initialized;
S5: the effectiveness after calculating the one target user end of value of utility and removal of whole user terminals of the user coalitions model Value;
S6: Shapley value of each user terminal under different channels is calculated;
S7: each user terminal is calculated to the bidding strategy of different channels according to the Shapley value, and forms a bid matrix;
S8: the user terminal is distributed under a highest channel of bidding using the bid matrix, updates the user Alliance model;
S9: the power of the user terminal is optimized.
2. the federated resource distribution method according to claim 1 once auctioned based on Shapley value, which is characterized in that The Signal to Interference plus Noise Ratio of the different user terminals in the same channel is calculated in the S2 step by formula (1):
Wherein, γkIndicate the Signal to Interference plus Noise Ratio at phone user end, pkIndicate the transmission power at phone user end, gkeIndicate phone user User's gain of channel between end and base station, H indicate the pairs of quantity of D2D user terminal, pd、pa′Two different D2D are respectively indicated to use The transmission power at family end;gdeIndicate user's gain of channel between D2D user terminal and base station;σ2Indicate the thermal noise function of receiving end Rate;γdIndicate the Signal to Interference plus Noise Ratio of D2D user terminal, gddIndicate user's gain of channel between D2D user terminal, gkdIndicate that honeycomb is used User's gain of channel between family end and D2D user terminal;gd′dUser's gain of channel between two difference D2D user terminals of expression.
3. the federated resource distribution method according to claim 2 once auctioned based on Shapley value, which is characterized in that In the S3 step, further comprise the steps of:
Define the game of the user coalitions model:
Wherein,Indicating game, I indicates the set of the user terminal,Indicate the policy space of terminal;Table Show effectiveness formula;pjIndicate the transmission power of user j, p-jIndicate the set of remaining users transmission power other than user j;
γjIncluding γkOr γd;R is transmission rate;The bit number of M expression transmission frame;ljIndicate service time of battery;cj(pj, p-j) indicate cost function;
Wherein, C indicates battery capacity, pjIt is the transmission power of jth user terminal, p0It is circuit consumption power, V0It is work electricity Pressure, a expression parameter;
cj(pj, p-j)=cpj(5);
Wherein, c indicates the price of jth user terminal.
4. the federated resource distribution method according to claim 3 once auctioned based on Shapley value, which is characterized in that The power of the user terminal is initialized using the solution of a formula (6) in the S4 step:
Wherein, S indicates the user coalitions model, S=[S1..., Si... SK], K indicates of orthogonal channel in the channel Number, SKIndicate the set at phone user end described in K orthogonal channel and the D2D user terminal;
The lower bound of formula (6) disaggregation is calculated by the formula (7) of non-decreasing differentiability condition and is obtained:
5. the federated resource distribution method according to claim 4 once auctioned based on Shapley value, which is characterized in that Value of utility v (the S of whole user terminals of the user coalitions model is calculated in the S5 step according to formula (8)(i)) and removal the Value of utility v (S after j user terminal(i))-v(S(i)/{j});
Wherein, S(i)Indicate a set in user coalitions model;I ∈ K,j∈H;Wherein, N indicates user's connection The set number for including in alliance's model, H indicate the pairs of quantity of the D2D user terminal.
6. the federated resource distribution method according to claim 5 once auctioned based on Shapley value, which is characterized in that Shapley value of each user terminal under different channels is calculated according to a formula (9) in the S6 step
Wherein, j=1,2 ..., H.
7. the federated resource distribution method according to claim 6 once auctioned based on Shapley value, which is characterized in that In the S7 step, bid of each user terminal to different channels is calculated according to the Shapley value and using a formula (10) StrategyAnd form the bid matrix
8. the federated resource distribution method according to claim 7 once auctioned based on Shapley value, which is characterized in that In the S8 step, the user terminal is distributed under a highest channel of bidding using a formula (11);
Wherein, i=1,2 ... K, j=1,2 ... H;j*Indicate user terminal.
9. the federated resource distribution method according to claim 8 once auctioned based on Shapley value, which is characterized in that In the S9 step, the power of presently described user terminal is optimized using formula (6).
CN201910721760.4A 2019-08-06 2019-08-06 Combined resource allocation method based on Shapley value one-time auction Active CN110518995B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910721760.4A CN110518995B (en) 2019-08-06 2019-08-06 Combined resource allocation method based on Shapley value one-time auction

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910721760.4A CN110518995B (en) 2019-08-06 2019-08-06 Combined resource allocation method based on Shapley value one-time auction

Publications (2)

Publication Number Publication Date
CN110518995A true CN110518995A (en) 2019-11-29
CN110518995B CN110518995B (en) 2021-06-01

Family

ID=68624528

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910721760.4A Active CN110518995B (en) 2019-08-06 2019-08-06 Combined resource allocation method based on Shapley value one-time auction

Country Status (1)

Country Link
CN (1) CN110518995B (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101277542A (en) * 2008-03-28 2008-10-01 北京邮电大学 Method and system for managing centralized dynamic spectrum among wireless networks
CN104540142A (en) * 2014-12-17 2015-04-22 华中科技大学 Cognition-based macro eNB and femtocell interference management method
CN104660394A (en) * 2015-03-23 2015-05-27 中国矿业大学 Spectrum resource allocation method based on utility function and price mechanism
US9311670B2 (en) * 2004-09-10 2016-04-12 Steven M. Hoffberg Game theoretic prioritization system and method
CN108055095A (en) * 2017-12-08 2018-05-18 武汉大学 A kind of combined spectral matching algorithm of stabilization
CN108391257A (en) * 2018-02-26 2018-08-10 重庆邮电大学 Resource allocation methods based on Game Theory under a kind of community network D2D scenes
CN108901075A (en) * 2018-06-28 2018-11-27 电子科技大学 A kind of resource allocation methods based on GS algorithm

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9311670B2 (en) * 2004-09-10 2016-04-12 Steven M. Hoffberg Game theoretic prioritization system and method
CN101277542A (en) * 2008-03-28 2008-10-01 北京邮电大学 Method and system for managing centralized dynamic spectrum among wireless networks
CN104540142A (en) * 2014-12-17 2015-04-22 华中科技大学 Cognition-based macro eNB and femtocell interference management method
CN104660394A (en) * 2015-03-23 2015-05-27 中国矿业大学 Spectrum resource allocation method based on utility function and price mechanism
CN108055095A (en) * 2017-12-08 2018-05-18 武汉大学 A kind of combined spectral matching algorithm of stabilization
CN108391257A (en) * 2018-02-26 2018-08-10 重庆邮电大学 Resource allocation methods based on Game Theory under a kind of community network D2D scenes
CN108901075A (en) * 2018-06-28 2018-11-27 电子科技大学 A kind of resource allocation methods based on GS algorithm

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
LI MINZHENG 等: "Pareto dominated non-cooperative game power control algorithm in D2D communication", 《SYSTEMS ENGINEERING AND ELECTRONICS》 *
谢东朋: "异构蜂窝网络中基于Gale-Shapley算法的D2D通信资源分配", 《中国优秀硕士学位论文全文数据库 信息科技辑》 *

Also Published As

Publication number Publication date
CN110518995B (en) 2021-06-01

Similar Documents

Publication Publication Date Title
CN105072689B (en) Multicast system radio resource optimizing distribution method based on active antenna array model
Ferdouse et al. Joint communication and computing resource allocation in 5G cloud radio access networks
Li et al. Incentive mechanisms for device-to-device communications
CN104796900B (en) D2D communication resource allocation methods in cellular network based on Game Theory
CN109862584A (en) The multi-beam satellite system of power resource allocation method and application this method
CN106028346B (en) A kind of spectrum auction method of cell
CN111417126A (en) On-demand coverage method and device for space-sky-ground cooperative marine communication network
CN111417125B (en) Method and device for optimizing capacity of space-air-ground cooperative marine communication network
Zhai et al. Truthful double auction for joint internet of energy and profit optimization in cognitive radio networks
CN111405584A (en) Energy efficiency power distribution method based on non-orthogonal multiple access in MIMO system
Cao et al. An iterative auction mechanism for data trading
Wang et al. Power allocation using Vickrey auction and sequential first-price auction games for physical layer security in cognitive relay networks
Xu et al. Intelligent multi-agent based C-RAN architecture for 5G radio resource management
Su et al. Game-based distributed pricing and task offloading in multi-cloud and multi-edge environments
Zhang et al. Spectrum sharing in cognitive radio using game theory--A survey
CN108391257B (en) Resource allocation method based on auction theory in social network D2D scene
CN110518995A (en) The federated resource distribution method once auctioned based on Shapley value
Xu et al. Double auction based spectrum sharing for wireless operators
CN113703970B (en) Auction mechanism-based server resource allocation method, device, equipment and medium
Hoang et al. Dynamic spectrum allocation with second-price auctions: When time is money
Cao et al. An auction approach to resource allocation in OFDM-based cognitive radio networks
CN111642014B (en) Beam determination method, device, base station and electronic equipment
Zhu et al. Game-theory based buffer-space and transmission-rate allocations for optimal energy-efficiency over wireless virtual networks
CN107086921B (en) User identity identification method based on small cell spectrum auction system
CN105959957A (en) Spectrum auction method of CoMP system based on combined beam forming and power control

Legal Events

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