CN109922461A - D2D cache contents sharing method based on bilateral contract excitation - Google Patents
D2D cache contents sharing method based on bilateral contract excitation Download PDFInfo
- Publication number
- CN109922461A CN109922461A CN201910190129.6A CN201910190129A CN109922461A CN 109922461 A CN109922461 A CN 109922461A CN 201910190129 A CN201910190129 A CN 201910190129A CN 109922461 A CN109922461 A CN 109922461A
- Authority
- CN
- China
- Prior art keywords
- service
- bue
- formula
- user
- sue
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention provides a kind of D2D cache contents sharing method based on bilateral contract excitation, comprising: BUE is to eNB request data package；ENB obtains the geographical location information of BUE and SUE and the historical record of SUE request packet；ENB, which is filtered out, to be the SUE set of BUE service；ENB draws up a contract, and contract set is broadcast to BUE and SUE；Each BUE and SUE chooses contract, and feeds back to eNB；ENB is matched after receiving feedback information, and matching result is broadcasted；If it fails to match, terminate；SUE as agreed shared data packet to BUE；ENB is deducted fees and is rewarded to BUE and SUE execution respectively, completes the shared of cache contents.The present invention provides a kind of D2D cache contents sharing methods based on bilateral contract excitation, otherness of the data packet needed for having fully considered BUE in transmission rate, and data packet at multiple BUE when the problem of being matched, SUE can be effectively motivated to participate in transmission service process, data needed for BUE is obtained from SUE.
Description
Technical field
The present invention relates to mobile communication fields, more particularly in a kind of D2D caching based on bilateral contract excitation
Hold sharing method.
Background technique
In recent years, terminal direct connection communication (Device-to-Device, D2D) is due to that can allow adjacent terminal end equipment not pass through
Base station (eNB) and directly establish communication, thus have mitigate return link load, effectively-increase capacity of cellular networks, become 5G
One of key technology of mobile communication.
With the explosive growth of mobile data flow, the load of cellular network becomes increasing, in order to mitigate this
Content caching to wireless network edge is become a kind of novel technology by burden, and this mode improves spectrum efficiency and reduces
The energy consumption [1] of Radio Network System.Wherein, more typical two ways is cached to the end eNB and terminal respectively
(User Equipment, UE) is examined when caching to the end UE or needing to complete data traffic by UE progress D2D communication to unload
The selfish attribute for considering user needs incentive mechanism to motivate UE to participate in caching.The linear valuation of energisation mode common at present,
Auction the modes such as excitation, game excitation, contract excitation.Wherein contract excitation is widely used between employer and employee, and there are letters
It ceases asymmetric situation [1], i.e. employer does not know all information of employee (such as compared with the personal information of privacy, employee will not be accused
Tell employee).It corresponds in wireless caching system, it is contemplated that UE intrinsic secret attribute, such as state of charge, memory space, ginseng
The information such as the wish communicated with D2D will not generally be reported to eNB.This just constitutes a typical information asymmetry scene.
The existing D2D buffering scheme based on UE incentive mechanism being related under information asymmetry scene, is asked there are still more
Inscribe [2]-[3], such as fail joint in view of data packet server selfish attribute and request data packet whether there is in
At multiple caching persons, or it can not know the problems such as data packet of request whether there is.Document [2] single side stimulus data packet is asked
The person of asking obtains packet by D2D link, and matching stage data packet request person and server are based respectively on itself effectiveness and matching constraint
Condition carries out ordering of optimization preference from high to low, and then requestor selects the matching object of highest effectiveness to match；Server receives
The requesting party is searched for after matching request whether in oneself preference list, if the successful match if, not it fails to match.It should
Scheme does not account for the natural selfish attribute of server, and the initiation request sequence of matching performance and requestor in excitation phase
It is related, there is randomness.The data packet that document [3] assumes that the UE on its periphery has is different, so being not in same
Data packet is stored in the case where at different user.Meanwhile the classification for channel quality, the document only discuss two categories
Situation, and using channel quality as when asymmetric information, then it is considered as between eNB and UE without interaction.ENB can not at this time
Know which kind of probability-distribution function UE belong to, so there may be cannot achieve in the practical application of the model.
On the other hand, document [4] discusses a kind of contract theory excitation, but without reference to the analysis of D2D shared data packet, the document is examined
Consider operator excitation UE and obtain data packet from idle eNB as far as possible, to solve the congestion problems of eNB, and guarantees the steady of network
It is qualitative.Since eNB is considered as the attached of operator side by the program, it is natural obligation that eNB, which services UE, thus being not related to eNB need to
The problem of obtaining excess return.But when the program being such as applied to D2D scene, the main body for providing data service is become by eNB
For the service user (Seller UE, SUE) for being stored with target packet, then selfishness and individuality in view of UE itself are needed,
In addition to the emergencies such as natural calamity, system cannot force any UE to provide D2D service to other UE.Therefore, operator can examine
Consider and pays certain return as the excitation for participating in offer D2D service to SUE.
On the other hand, it is seen from service request user (Buyer UE, the BUE) angle for needing to obtain data service, in micro- bee
There are part BUE in nest base station network, due to a variety of causes such as self secret protections, may only be ready to obtain data from the end eNB
Packet.But eNB can provide certain return in view of the bearing capacity of own service in order to mitigate the congestion of business service amount
It motivates BUE to go to obtain data packet from SUE, while giving the certain compensation of SUE to motivate it to participate in shared transmission data packet.
Summary of the invention
The present invention is to overcome the above-mentioned existing D2D buffering scheme based on UE incentive mechanism, exists and fails in view of BUE institute
Need data packet in transmission rate otherness and data packet at multiple BUE when need to carry out matched technological deficiency,
A kind of D2D cache contents sharing method based on bilateral contract excitation is provided.
In order to solve the above technical problems, technical scheme is as follows:
D2D cache contents sharing method based on bilateral contract excitation, comprising the following steps:
S1: service request user BUE to base station eNB request data package；
S2: base station eNB obtains service request user BUE and services the geographical location information of user SUE, and service user
The historical record of SUE request packet；
S3: base station eNB, which filters out, to be the service user SUE set of service request user BUE service；
S4: base station eNB draws up a contract, and contract set is broadcast to service request user BUE and service user SUE；
S5: each service request user BUE and service user SUE chooses contract, and feeds back to base station eNB；
S6: base station eNB is matched after receiving feedback information, and matching result is broadcasted；If it fails to match, tie
Beam；
S7: servicing user SUE, shared data packet gives service request user BUE as agreed；
S8: base station eNB is deducted fees and is rewarded to service request user BUE and service user SUE execution respectively, is completed in caching
That holds is shared.
Wherein, the step S1 specifically:
S11: parameter definition: there are the phone user CUE of multiple and base station eNB communication for a base station eNB；B have data
The service request user BUE of demand packet, collection are combined into B={ b1,b2,...,bi,...,bB}；S are cached with one or more numbers
According to the service user SUE of packet, collection is combined into S={ s1,s2,...,sj,...,sS}；Packet collection is combined into F={ f1,f2,...,
fk,...,fK, K is the number of data packet；
S12: calculating the requested probability of data packet, is described by Zipf distribution, specifically:
Wherein, pfkIndicate every part of requested probability of data packet,Indicate the profile exponent of data packet set.
Wherein, the step S2 specifically: define request data package set, the service user SUE of service request user BUE
Historical requests packet record:
The potential communication link set S of service request user BUEi: assuming that in each time slot TSIt is interior, each service request user
BUE can only request a data packet, be expressed asAnd it is denoted as the data packet set that user SUE has been cached with is servicedAnd
The probability of service request user BUE and service user SUE request and data cached packet is distributed by Zipf to be described.
Wherein, the step S3 specifically:
S31: will meet in service request user's BUE communication range, i.e. di,j≤dmax, TSS in time slotjAnd biBetween it is logical
Communication distance di,jLess than or equal to D2D maximum communication distance dmax, and it has been cached with service request user's BUE requested data packet
The set of service user SUE be defined as the potential communication link set of service request user BUE, i.e. service request user BUE and
The existing whole D2D communication links for having potential communication capacity, are expressed as set S between service user SUEi, it may be assumed that
Si={ sj；di,j≤dmaxAnd
Potential service user SUE set S0: the collection for defining all potential service user SUE is combined into S0, in which:
If shared S ' a service user SUE, S '=card (S0), wherein card () be set seek gesture operator；
S32: channel transmission rate, the instruction of base station eNB dispatching distribution, expected rate of service request user BUE etc. are defined
Grade and service user SUE service wish degree grade:
Channel transmission rate ri,j: work as biAnd sjBetween there are when potential D2D communication link, defining channel transmission rate is
ri,j, expression are as follows:
Wherein, Pi,jIndicate sjTransmission power, Hi,j=(di,j)-η|hi,j|2Indicate biAnd sjBetween channel gain, di,j
Indicate biAnd sjThe distance between, η is path loss index, | hi,j|2For the rayleigh fading effects factor, n0Indicate that white Gaussian noise, w are
System bandwidth；
Base station eNB dispatching distribution indicates xi,j: definition set X={ xi,j, xi,jFor the instruction of eNB dispatching distribution, xi,j=1
Indicate sjTo biData transport service is provided；It is set in each service request user BUE in a time slot and at most obtains a clothes
The service of business user SUE, each service user SUE to multipotency service nj(nj>=1) a service request user BUE, it may be assumed that
The expected rate grade θ of service request user BUEi: define θi(θiIt > 0) is the expectation speed of service request user BUE
Rate grade, θiIt is bigger, indicate biIt is expected that the transmission rate request of required data packet is higher, it is ready to pay more costs；Instead
It, θiIt is smaller, then it is assumed that biIt can receive lower rate, the cost paid also decreases；Accordingly, be arranged M (1≤M≤
B) a discrete user gradation forms an expected rate class set ΘB, it may be assumed that
Wherein:For m-th of expected rate grade, andThen biExpected rate grade θi
∈ΘB；θiThe intrinsic individual attribute for belonging to service request user BUE changes with the variation of the factors such as user's expectation, time, space
Become；
It services user SUE and services wish degree gradeDefinitionFor sjIt participates in providing the meaning of buffer service
Hope degree,It is bigger, sjThe wish degree for participating in service is higher；Shared N (1≤N≤S ') a service wish degree grade, composition are set
One service wish degree class set ΘS, it may be assumed that
Wherein:For n-th of service wish degree grade, andThen sjService wish degreeBelong to the intrinsic private attribute of service user SUE, information will not be reported to base station eNB；
S33: base station eNB obtains the historical statistical information that service request user BUE obtains data packet, determines different expectation speed
Service request user's BUE proportion of rate grade；
S34: base station eNB obtains service user SUE and obtains the historical statistical information of data packet and participate in D2D service
Statistical information determines service user's SUE proportion of different service wish degree grades；
S35: service request contract is denoted as ∏={ ri,j,πi,j, wherein ri,jFor channel transmission rate, base station eNB is indicated
Dispatch sjCome for biB when data packet transmission service is providediIt is expected that obtainable rate；πi,jIndicate biFrom sjIt is needed when obtaining service
Pay the expense of base station eNB；
biAccording to ri,jAnd the expense π for combining it to need to payi,j, a satisfaction evaluation is obtained, specifically:
Wherein: α (α > 0) is the Price Sensitive factor of service request user BUE,For satisfaction evaluation, i.e. biFrom sjPlace
Obtain utility function when service；By formula (7) it is found thatWith ri,jMonotonic increase shows what service request user BUE was obtained
Packet rate is higher, and satisfaction is higher；And work as ri,jWhen very big, the enough height of the data rate that service request user BUE is obtained,
Satisfaction can then increase more slowly, thereforeIt is ri,jConcave function, on the other hand, with service request user BUE pay
Expense π outi,jIncrease, satisfaction can reduce, i.e.,With πi,jMonotone decreasing；
S36: service contract is denoted asS is worked as in expressionjServe biWhen base station eNB need to pay sj's
Service recompense；
sjAccording to ri,jAnd fee charged is needed in conjunction with itA satisfaction evaluation is obtained, specifically:
Wherein:For satisfaction evaluation, i.e. sjFor biUtility function when service is provided；With remunerationIt is dull
It is incremented by namely the higher service user SUE of price is more satisfied, and with sjPay ri,jBecome larger, satisfaction can reduce；
S37: formula (7) and formula (8) are based on, it is assumed that the mark of deducting fees of the service request user BUE of equating expections speed grade
It is identical, and the incentive standard of the service user SUE of same services wish degree grade is identical, then the overall weight of base station eNB is average
Utility function are as follows:
Therefore, the objective function P1 of optimization can be set are as follows:
Its constraint formula include formula (3), formula (4) and
Wherein:
Constraint formula (2), formula (3) are matching constraint, indicate a time slot TSInterior, each service request user BUE is at most
The service of a service user SUE is obtained, and each service user SUE can service multiple service request user BUE；
Constraint formula (11) and formula (13) indicate the reasonability constraint condition IRC of personal motivation, i.e., each service request user
The effectiveness of BUE and service user SUE should be nonnegative value, guarantee excitation service request user BUE and service the ginseng of user SUE
With；
Constraint formula (12) and formula (14) indicate excitation compatibility condition CIC, right-hand side expression ln (the 1+ θ of the two inequalityiri′,j)-απi′,jWithService request user BUE is respectively indicated by expected rate grade θi′The service request of grade
Effectiveness obtained by the contract of user BUE, and service wish degree grade and beService user SUE take service wish degree etc.
Grade beService user SUE contract obtained by effectiveness；Therefore formula (12), formula (14) show each service request user BUE
Only it is ready to take the contract of oneself corresponding grade with service user SUE.
Wherein, the step S4 specifically:
S41: respectively to the reasonability constraint condition IRC of service request user BUE and service user SUE, the compatible item of excitation
Part CIC is simplified；
S42: using simplified constraint condition, iteration derives π respectivelyi,j、About ri,jExpression formula；
S43: only variable r is converted by problem P1i,jFunctional form；
S44: do not consider ri,jR is solved using method of Lagrange multipliers under the premise of monotonicity constrainti,j；What judgement acquired
Whether solution meets ri,jDullness, satisfaction then terminate；It is unsatisfactory for, is adjusted, make ri,jMeet constraint；
S45: contract set Γ and Π are solved according to obtained solution, completion contract is drafted.
Wherein, the step S41 specifically:
Variable x is not consideredi,jSolution, ignore matching constraint conditional (3), the formula (4) of formula (10), and define:
Problem P2 then is converted by problem P1, specifically:
It is formula (11), formula (12), formula (13) and formula (14) that it, which constrains formula,；
The step S42 specifically:
Meet the feasible whole necessary conditions of contract and adequate condition specifically:
Necessary condition: 1) θiWith ri,jMonotone increasing；2)πi,jWith ri,jMonotone increasing；3)Ubi,jWith θiMonotone increasing； 4)ri,jWith
Monotone increasing；5)With ri,jMonotone increasing；6)Usi,jWithMonotone increasing；Wherein, by condition 1) and condition 4) be respectively defined as taking
Business request user BUE and the monotonicity constraint for servicing user SUE contract, i.e. formula (17) and formula (18) are as follows:
Adequate condition: being θ to expected rate gradeiAnd θi-1Service request user BUE, the two utility function meets formula
(16), and to θiAnd θi+1Service request user BUE, the two utility function meets formula (17)；It is to service wish degree grade
WithService user SUE, the two utility function meets formula (18), and rightWithService user SUE, the two effect
Met formula (19) with function, specific as follows:
Using formula (7) and formula (8), under the constraint for meeting formula (17), formula (18), by the constraint equation of problem P2
(11), formula (12), formula (13), formula (14) are reduced to formula (23), formula (24), formula (25) and formula (26), specific as follows:
Therefore in conjunction with the adequate condition and necessary condition, problem P2-1 is converted by problem P2, expression is as follows:
Its constraint condition is formula (17)~formula (26)；
The step S43 specifically:
According to formula (27) joint type (20) and formula (21), have:
Joint type (22) and formula (23), have:
By formula；(25) it substitutes into problem P2-1, is obtained only with respect to r with formula (26)i,jExpression formula, and constrain formula be formula
(14) and formula (15)；
The step S44 specifically: do not consider formula (14), formula (15), show that this is excellent by method of Lagrange multipliers solution
Change problem without limitation optimal solution；Then examine whether the solution meets formula (14), formula (15) again；Ungratified solution is adjusted
It is whole, so that it is met constraint；
The step S45 specifically: the value r that will be solvedi,jSubstitution formula；(25) and in formula (26), problem is finally obtained
The target solution π of P2-1i,jWithTo solve contract set Γ and Π, completion contract is drafted.
Wherein, the step S6 matches object procedure specifically:
S61: potential matching matrix X is generatedP, find out the utility matrix U of base station eNBP；
S62: the utility matrix U of base station eNB is modifiedP, formation amplification matrix U 'P；
S63: to matrix XPWith U 'PIt is solved using one-to-one matched Hungary Algorithm, the base station after being matched
ENB utility matrix U and matching matrix X；
S64: examining matching matrix X, judge whether to meet matching condition, if potential communication is not present in service request user BU
Link, or there are potential communication link but when not searching out proper fit object, then it is assumed that service request user BUE matching
Failure terminates process；If successful match, obtains service request user BUE and service the matching result of user SUE.
Wherein, the step S6 is specially to solve variable xi,jFormula (10) maximizes, and specific matching process is as follows:
The step S61 specifically: according to the r solvedi,j、πi,jWithIt is solved Lai after by formula (27), by problem P1
Conversion are as follows:
It is formula (2), formula (3) that it, which constrains formula,；
The constraint condition for not considering formula (30) generates each service request user BUE and the potential communication link company of foundation
Potential matching matrix X when connecingP, effectiveness obtained by base station eNB under the match condition is calculated, B × S ' dimension effectiveness square is formed
Battle array, is denoted as UP；
The step S62 specifically: to access nj(nj> 1) the service user SUE of a service request user BUE is equivalent to nj
A service user SUE for only having access one is allocated, i.e. duplication matrix UPJth column, to UPExpand (nj- 1) it arranges, shape
At amplification matrix U 'P；
The step S63 specifically: to matrix XPWith U 'PIt is solved, is obtained using one-to-one matched Hungary Algorithm
Base station eNB utility matrix U and matching matrix X after matching；
The step S64 specifically: variable x is solved according to base station eNB utility matrix U and matching matrix Xi,j, complete
The Optimization Solution of entire objective function, to obtain service request user BUE and service the matching result of user SUE；
If potential communication link is not present in service request user BUE, or does not search out there are potential communication link but conjunction
When suitable matching object, then it is assumed that it fails to match by service request user BUE, terminates process.
Compared with prior art, the beneficial effect of technical solution of the present invention is:
The present invention provides a kind of D2D cache contents sharing methods based on bilateral contract excitation, have fully considered service
Otherness and data packet of the data packet in transmission rate needed for requesting user BUE are at multiple service request user BUE
When the problem of being matched, can effectively motivate service user SUE to participate in transmission service process, so that service request user
Data needed for BUE can be obtained from service user SUE, and then network is enabled to obtain performance boost more fully than conventional method.
Detailed description of the invention
Fig. 1 is steps flow chart schematic diagram of the present invention；
Fig. 2 is model schematic of the present invention；
Fig. 3 is contract delineation process figure；
Fig. 4 is service request user BUE and service user SUE flow chart；
Fig. 5 is the relation schematic diagram of the transmission rate that service request user BUE is obtained and expected rate grade；
Fig. 6 is the relational graph of service request user BUE paid with expected rate grade；
Fig. 7 is to service the return and the relational graph of service wish degree grade that user SUE is obtained；
Fig. 8 is the relational graph of base station eNB effectiveness and service request user BUE expected rate grade；
Fig. 9 be service request user BUE and service user SUE number than with expection can successful match total number relationship
Figure；
Figure 10 is service request user BUE and service user SUE number is than the relational graph with base station eNB effectiveness；
Figure 11 be service all number of data packets of user SUE and expection can successful match total number relational graph；
Figure 12 is the relational graph for servicing user SUE all number of data packets and base station eNB effectiveness.
Specific embodiment
The attached figures are only used for illustrative purposes and cannot be understood as limitating the patent；
In order to better illustrate this embodiment, the certain components of attached drawing have omission, zoom in or out, and do not represent actual product
Size；
To those skilled in the art, it is to be understood that certain known features and its explanation, which may be omitted, in attached drawing
's.
The following further describes the technical solution of the present invention with reference to the accompanying drawings and examples.
Embodiment 1
As shown in Figure 1, the D2D cache contents sharing method based on bilateral contract excitation, comprising the following steps:
S1: service request user BUE to base station eNB request data package；
S2: base station eNB obtains service request user BUE and services the geographical location information of user SUE, and service user
The historical record of SUE request packet；
S3: base station eNB, which filters out, to be the service user SUE set of service request user BUE service；
S4: base station eNB draws up a contract, and contract set is broadcast to service request user BUE and service user SUE；
S5: each service request user BUE and service user SUE chooses contract, and feeds back to base station eNB；
S6: base station eNB is matched after receiving feedback information, and matching result is broadcasted；If it fails to match, tie
Beam；
S7: servicing user SUE, shared data packet gives service request user BUE as agreed；
S8: base station eNB is deducted fees and is rewarded to service request user BUE and service user SUE execution respectively, is completed in caching
That holds is shared.
More specifically, as shown in Fig. 2, the step S1 specifically:
S11: parameter definition: there are the phone user CUE of multiple and base station eNB communication for a base station eNB；B have data
The service request user BUE of demand packet, collection are combined into B={ b1,b2,...,bi,...,bB}；S are cached with one or more numbers
According to the service user SUE of packet, collection is combined into S={ s1,s2,...,sj,...,sS}；Packet collection is combined into F={ f1,f2,...,
fk,...,fK, K is the number of data packet；
S12: calculating the requested probability of data packet, and [3] are described by Zipf distribution, specifically:
Wherein, pfkIndicate every part of requested probability of data packet,Indicate the profile exponent of data packet set.
More specifically, the step S2 specifically: define the potential communication link set of service request user BUE, potential clothes
Be engaged in user SUE set, channel transmission rate, base station eNB dispatching distribution indicate, the expected rate grade of service request user BUE
Wish degree grade is serviced with service user SUE:
The potential communication link set S of service request user BUEi: assuming that in each time slot TSIt is interior, each service request user
BUE can only request a data packet, be expressed asAnd it is denoted as the data packet set that user SUE has been cached with is servicedAnd
The probability of service request user BUE and service user SUE request and data cached packet is distributed by Zipf to be described.
More specifically, the step S3 specifically:
S31: will meet in service request user's BUE communication range, i.e. di,j≤dmax, TSS in time slotjAnd biBetween it is logical
Communication distance di,jLess than or equal to D2D maximum communication distance dmax, and it has been cached with service request user's BUE requested data packet
The set of service user SUE be defined as the potential communication link set of service request user BUE, i.e. service request user BUE and
The existing whole D2D communication links for having potential communication capacity, are expressed as set S between service user SUEi, it may be assumed that
Si={ sj；di,j≤dmaxAnd
In the specific implementation process, BUE3 as shown in Figure 2 is all satisfied to the communication link of SUE5, SUE6 up to item respectively
Part, and when can obtain the data cached from the two SUE, then the potential link set of BUE3 is S3={ s5,s6}；
Potential service user SUE set S0: the collection for defining all potential service user SUE is combined into S0, in which:
If shared S ' a service user SUE, S '=card (S0), wherein card () be set seek gesture operator；
S32: channel transmission rate, the instruction of base station eNB dispatching distribution, expected rate of service request user BUE etc. are defined
Grade and service user SUE service wish degree grade:
Channel transmission rate ri,j: work as biAnd sjBetween there are when potential D2D communication link, defining channel transmission rate is
ri,j, expression are as follows:
Wherein, Pi,jIndicate sjTransmission power, Hi,j=(di,j)-η|hi,j|2Indicate biAnd sjBetween channel gain, di,j
Indicate biAnd sjThe distance between, η is path loss index, | hi,j|2For the rayleigh fading effects factor, n0Indicate that white Gaussian noise, w are
System bandwidth；
Base station eNB dispatching distribution indicates xi,j: definition set X={ xi,j, xi,jFor the instruction of eNB dispatching distribution, xi,j=1
Indicate sjTo biData transport service is provided；It is set in each service request user BUE in a time slot and at most obtains a clothes
The service of business user SUE, each service user SUE to multipotency service nj(nj>=1) a service request user BUE, it may be assumed that
The expected rate grade θ of service request user BUEi: define θi(θiIt > 0) is the expectation speed of service request user BUE
Rate grade, θiIt is bigger, indicate biIt is expected that the transmission rate request of required data packet is higher, it is ready to pay more costs；Instead
It, θiIt is smaller, then it is assumed that biIt can receive lower rate, the cost paid also decreases；Accordingly, be arranged M (1≤M≤
B) a discrete user gradation forms an expected rate class set ΘB, it may be assumed that
Wherein:For m-th of expected rate grade, andThen biExpected rate grade θi
∈ΘB；θiThe intrinsic individual attribute for belonging to service request user BUE changes with the variation of the factors such as user's expectation, time, space
Become；
It services user SUE and services wish degree gradeDefinitionFor sjIt participates in providing the meaning of buffer service
Hope degree,It is bigger, sjThe wish degree for participating in service is higher；Shared N (1≤N≤S ') a service wish degree grade, composition are set
One service wish degree class set ΘS, it may be assumed that
Wherein:For n-th of service wish degree grade, andThen sjService wish degreeBelong to the intrinsic private attribute of service user SUE, information will not be reported to base station eNB；
S33: base station eNB obtains the historical statistical information that service request user BUE obtains data packet, determines different expectation speed
Service request user's BUE proportion of rate grade；
In the specific implementation process, indoors under scene, user may expect higher rate, and in outdoor moving process
In the desired value of rate may be reduced.Alternatively, user may be reluctant for certain non-real-time services sometimes or under occasion
Data or specific data content pay higher expense, and would rather select the transmission service of low rate, cheap rate.Therefore, exist
Under multi-user scene, to avoid a large amount of signaling consumption caused by frequent updating class information, base station eNB can not obtain each in real time
The grade value of BUE, and the historical statistical information of data packet can be obtained by BUE come BUE institute different grades of in inference system
Accounting weight.
S34: base station eNB obtains service user SUE and obtains the historical statistical information of data packet and participate in D2D service
Statistical information determines service user's SUE proportion of different service wish degree grades；
S35: service request contract is denoted as ∏={ ri,j,πi,j, wherein ri,jFor channel transmission rate, base station eNB is indicated
Dispatch sjCome for biB when data packet transmission service is providediIt is expected that obtainable rate；πi,jIndicate biFrom sjIt is needed when obtaining service
Pay the expense of base station eNB；
biAccording to ri,jAnd the expense π for combining it to need to payi,j, a satisfaction evaluation is obtained, specifically:
Wherein: α (α > 0) is the Price Sensitive factor of service request user BUE,For satisfaction evaluation, i.e. biFrom sjPlace
Obtain utility function when service；By formula (7) it is found thatWith ri,jMonotonic increase shows what service request user BUE was obtained
Packet rate is higher, and satisfaction is higher；And work as ri,jWhen very big, the enough height of the data rate that service request user BUE is obtained,
Satisfaction can then increase more slowly, thereforeIt is ri,jConcave function, on the other hand, with service request user BUE pay
Expense π outi,jIncrease, satisfaction can reduce, i.e.,With πi,jMonotone decreasing；
S36: service contract is denoted asS is worked as in expressionjServe biWhen base station eNB need to pay sj's
Service recompense；
sjAccording to ri,jAnd fee charged is needed in conjunction with itA satisfaction evaluation is obtained, specifically:
Wherein:For satisfaction evaluation, i.e. sjFor biUtility function when service is provided；With remunerationIt is dull
It is incremented by namely the higher service user SUE of price is more satisfied, and with sjPay ri,jBecome larger, satisfaction can reduce；
S37: formula (7) and formula (8) are based on, it is assumed that the mark of deducting fees of the service request user BUE of equating expections speed grade
It is identical, and the incentive standard of the service user SUE of same services wish degree grade is identical, then the overall weight of base station eNB is average
Utility function are as follows:
Therefore, the objective function P1 of optimization can be set are as follows:
Its constraint formula include formula (3), formula (4) and
Wherein:
Constraint formula (2), formula (3) are matching constraint, indicate a time slot TSInterior, each service request user BUE is at most
The service of a service user SUE is obtained, and each service user SUE can service multiple service request user BUE；
Constraint formula (11) and formula (13) indicate the reasonability constraint condition IRC of personal motivation, i.e., each service request user
The effectiveness of BUE and service user SUE should be nonnegative value, guarantee excitation service request user BUE and service the ginseng of user SUE
With；
Constraint formula (12) and formula (14) indicate excitation compatibility condition CIC, right-hand side expression ln (the 1+ θ of the two inequalityiri′,j)-απi′,jWithService request user BUE is respectively indicated by expected rate grade θi′The service request of grade
Effectiveness obtained by the contract of user BUE, and service wish degree grade and beService user SUE take service wish degree etc.
Grade beService user SUE contract obtained by effectiveness；Therefore formula (12), formula (14) show each service request user BUE
Only it is ready to take the contract of oneself corresponding grade with service user SUE.
In the specific implementation process, problem P1 is noticed, i.e. formula (10) belongs to a kind of non-linear, non-convex NP- difficulty optimization
Problem, the variable and condition of solution are more, are effective Solve problems P1, guarantee that the matching between BUE and SUE is effective, the present invention
Being divided into two stages is solved, i.e., contract drafts the matching stage between stage and BUE and SUE；
More specifically, as shown in figure 3, the step S4 specifically:
S41: respectively to the reasonability constraint condition IRC of service request user BUE and service user SUE, the compatible item of excitation
Part CIC is simplified；
S42: using simplified constraint condition, iteration derives π respectivelyi,j、About ri,jExpression formula；, S43: will
Problem P1 is converted into only variable ri,jFunctional form；
S44: do not consider ri,jR is solved using method of Lagrange multipliers under the premise of monotonicity constrainti,j；What judgement acquired
Whether solution meets ri,jDullness, satisfaction then terminate；It is unsatisfactory for, is adjusted, make ri,jMeet constraint；
S45: contract set Γ and Π are solved according to obtained solution, completion contract is drafted.
More specifically, the step S41 specifically:
Variable x is not consideredi,jSolution, ignore matching constraint conditional (3), the formula (4) of formula (10), and define:
Problem P2 then is converted by problem P1, specifically:
It is formula (11), formula (12), formula (13) and formula (14) that it, which constrains formula,；
The step S42 specifically:
Meet the feasible whole necessary conditions of contract and adequate condition [6] specifically:
Necessary condition: 1) θiWith ri,jMonotone increasing；2)πi,jWith ri,jMonotone increasing；3)Ubi,jWith θiMonotone increasing； 4)ri,jWith
Monotone increasing；5)With ri,jMonotone increasing；6)Usi,jWithMonotone increasing；Wherein, by condition 1) and condition 4) be respectively defined as servicing
It requests user BUE and services the monotonicity constraint of user SUE contract, is i.e. formula (17) and formula (18) is as follows:
Adequate condition: being θ to expected rate gradeiAnd θi-1Service request user BUE, the two utility function meets formula
(16), and to θiAnd θi+1Service request user BUE, the two utility function meets formula (17)；It is to service wish degree grade
WithService user SUE, the two utility function meets formula (18), and rightWithService user SUE, the two effect
Met formula (19) with function, specific as follows:
According to the thought of document [6], using formula (7) and formula (8), under the constraint for meeting formula (17), formula (18), by problem
Constraint equation (11), formula (12), formula (13), the formula (14) of P2 is reduced to formula (23), formula (24), formula (25) and formula (26), tool
Body is as follows:
Therefore in conjunction with the adequate condition and necessary condition, problem P2-1 is converted by problem P2, expression is as follows:
Its constraint condition is formula (17)~formula (26)；
The step S43 specifically:
According to formula (27) joint type (20) and formula (21), have:
Joint type (22) and formula (23), have:
By formula；(25) it substitutes into problem P2-1, is obtained only with respect to r with formula (26)i,jExpression formula, and constrain formula be formula
(14) and formula (15)；
The step S44 specifically: since formula (14) and formula (15) they are the presence of two non-linear, non-convex constraint condition,
The problem of being P2-1 can not direct solution, in order to effectively solve the problems, such as this, first do not consider formula (14), formula (15), it is bright by glug
Day multiplier method [8] solve obtain the optimization problem without limitation optimal solution；Then examine whether the solution meets formula (14), formula again
(15)；Ungratified solution is adjusted, bibliography [7] is can refer to and is adjusted, it is made to meet constraint；
The step S45 specifically: the value r that will be solvedi,jSubstitution formula；(25) and in formula (26), problem is finally obtained
The target solution π of P2-1i,jWithTo solve contract set Γ and Π, completion contract is drafted.
More specifically, as shown in figure 4, the step S6 matches object procedure specifically:
S61: potential matching matrix X is generatedP, find out the utility matrix U of base station eNBP；
S62: the utility matrix U of base station eNB is modifiedP, formation amplification matrix U 'P；
S63: to matrix XPWith U 'PIt is solved using one-to-one matched Hungary Algorithm [9], the base after being matched
Stand eNB utility matrix U and matching matrix X；
S64: examining matching matrix X, judge whether to meet matching condition, if potential communication is not present in service request user BU
Link, or there are potential communication link but when not searching out proper fit object, then it is assumed that service request user BUE matching
Failure terminates process；If successful match, obtains service request user BUE and service the matching result of user SUE.
More specifically, the step S6 is specially to solve variable xi,jFormula (10) maximizes, and specific matching process is as follows:
The step S61 specifically: according to the r solvedi,j、πi,jWithIt is solved Lai after by formula (27), by problem P1
Conversion are as follows:
It is formula (2), formula (3) that it, which constrains formula,；
The constraint condition for not considering formula (30) generates each service request user BUE and the potential communication link company of foundation
Potential matching matrix X when connecingP, effectiveness obtained by base station eNB under the match condition is calculated, B × S ' dimension effectiveness square is formed
Battle array, is denoted as UP；
The step S62 specifically: to access nj(nj> 1) the service user SUE of a service request user BUE is equivalent to nj
A service user SUE for only having access one is allocated, i.e. duplication matrix UPJth column, to UPExpand (nj- 1) it arranges, shape
At amplification matrix U 'P；
The step S63 specifically: to matrix XPWith U 'PIt is solved, is obtained using one-to-one matched Hungary Algorithm
Base station eNB utility matrix U and matching matrix X after matching；
The step S64 specifically: variable x is solved according to base station eNB utility matrix U and matching matrix Xi,j, complete
The Optimization Solution of entire objective function, to obtain service request user BUE and service the matching result of user SUE；
If potential communication link is not present in service request user BUE, or does not search out there are potential communication link but conjunction
When suitable matching object, then it is assumed that it fails to match by service request user BUE, terminates process.
Embodiment 2
In the present embodiment, unless otherwise instructed, simulation parameter value is as shown in table 1 by the present invention:
1 simulation parameter table of table
| Parameter | Parameter value | Unit |
| Cellular cell radius | 500 | Rice |
| D2D communicates maximum distance | 50 | Rice |
| SUE spreads a number | 300 | It is a |
| BUE spreads a number | 600 | It is a |
| Number of data packets in system | 20 | It is a |
| Zipf parameter | 0.8 | - |
| The number of data packets that SUE is up to | 3 | It is a |
Assuming that the radius of cellular cell is 500 meters, SUE and BUE are uniformly distributed at random in cell, and 20 are shared in system
Different data packets.The welcome intensity of data packet, i.e. Zipf profile exponentIt is set asAssuming that each SUE
Memory capacity is constrained to 0-3 data packet, and the data packet prestored has reached the maximum capacity of itself, i.e., each SUE is at most
3 different data packets are cached.Setting BUE expected rate grade and SUE participation wish degree grade is 18 grades,
That is M=18 and N=18, and set
In the specific implementation process, BUE and different service wish of the present invention to different expected rate grades are examined first
Degree grade SUE is drafted with whether the contract of optimization meets feasibility.As shown in figure 5, working as the expected rate grade θ of BUEiMore
Gao Shi, it is expected that the rate for obtaining downloading data packet can be higher, this is consistent with the monotonicity condition characteristic of BUE contract.Meanwhile
As the Price Sensitive factor-alpha of BUE increases, when price is very high, BUE can be more willing to receive the lower service of rate.
In the specific implementation process, as shown in fig. 6, working as the expected rate grade θ of BUEiWhen higher, since it needs to obtain
The rate of downloading data packet is got higher, then its expense for needing to pay base station eNB can increase therewith.Meanwhile as the price of BUE is quick
Feel factor-alpha to increase, BUE is more likely to obtain the download service compared with low rate with lower price.
In the specific implementation process, as shown in fig. 7, working as the service wish degree grade of SUEWhen higher, it can permit in power
Signal is sent with higher-wattage in range, completes to transmit the data packet of BUE so as to higher rate, then it can be from fortune
The remuneration got at battalion quotient will increase.Meanwhile as the Price Sensitive factor-alpha of BUE increases, BUE acceptable is influenced
Transmission rate can reduce, so that the remuneration that SUE when with lower rate transmissioning data packet, is got will reduce.
In the specific implementation process, as shown in figure 8, with BUE expected rate grade θiIncrease, the speed of BUE demand
Rate is got higher, and has driven the demand and supply of entire excitation system, and the trading volume of whole system becomes larger, the effectiveness that base station eNB obtains
Also it will increase.And when the Price Sensitive factor-alpha of BUE increases, so that the trading volume of system is reduced, thus what base station eNB obtained
Effectiveness can reduce.
More specifically, since the present invention combines the natural selfish attribute of the intrinsic individual attribute and SUE that consider BUE, because
Only consider that the system model of BUE individual attribute is not identical in this model proposed and existing literature [2], so the inspection of contract
The scheme for testing analysis and existing literature does not have comparability, therefore above-mentioned simulation analysis assesses contract from the not ipsilateral of this programme
Validity.By above-mentioned simulation result as it can be seen that drafting the contract with optimization through the invention, eNB may be implemented and do not knowing BUE
Excitation process under the intrinsic individual attribute of SUE and intrinsic secret attribute, ensures that the participation of BUE and SUE, relative to bat
Sell the good result for having Signalling exchange few with game theory incentive mechanism.
More specifically, the matching performance between BUE and SUE is tested, compares existing two kinds of typical case D2D matching
Scheme, it may be assumed that bipartite matching scheme [2] and random fit scheme based on BUE and SUE effectiveness.For both schemes, due to
The sequence for initiating request with result and BUE is related, while considering matched randomness, it is understood that there may be allows more than certain potential link
BUE is matched to certain SUE, and the SUE is that can uniquely match object relative to other BUE, can be at so as to cause system expection
The unfavorable result that function matching total number can be reduced.Meanwhile the matching process of these schemes is UE effectiveness or random fit, eNB is simultaneously
Optimal effectiveness cannot be obtained.
To realize fair comparativity, the UE effectiveness in all schemes is drafted through the invention to be obtained with the contract of optimization.
Emulation sets α=0.1, and it is 300 that the SUE in system, which spreads a number,.It is right in simulations because each SUE can be matched with multiple BUE
Each specific SUE-BUE, which is expected successfully to match, to be counted 1 time.
In the specific implementation process, as shown in figure 9, giving under the conditions of different SUE and BUE spread ratio, system
It is expected that can successful match total number results of property.It can be seen that by the figure, when the number of BUE in system increases, it is logical to meet D2D
The potential D2D matching of communication distance and data packet request constraint will increase total number, so that final system expection can successful match
Sum also will increase.Correspondingly, the effectiveness that base station eNB obtains also will increase, as shown in Figure 10.By Fig. 9, Figure 10 it is found that comparing
In other schemes, this programme can obtain the promotion of performance in terms of matching number and operator's effectiveness two.The description of test,
Under the scene of highly dense property, when the service number of users for being cached with data packet is more, and number of users is requested to be increasing, net
Network discharging quantity will increase；But when requesting user to increase to a certain extent, it may appear that discharging quantity tends to the state of saturation, because thus
When there is the state that supply falls short of demand.
In the specific implementation process, as shown in Figure 11, Figure 12, it is 300 that setting SUE, which spreads a number, and BUE spreads a number
It is 700.As seen from Figure 11, as the number of data packets that SUE itself has been cached with increases, the requested data packet of BUE
The probability that can be got in the SUE of its periphery increases, so that potential matching logarithm increases, then final matched sum also increases.
Correspondingly, the effectiveness that operator obtains also will increase, as shown in figure 12.Similar to Fig. 9, Figure 10 as a result, working as the data of SUE storage
When packet increases, compared to other schemes, this programme can also obtain mentioning for performance in matching number and two aspect of operator's effectiveness
It rises.Result explanation, when the memory capacity of SUE constantly expands, the data packet number of SUE storage will increase, therefore improve
The probability of data packet needed for neighbouring BUE can be shared to, is not only does this facilitate the flow of unloading core network, is also simultaneously SUE
Itself obtains return and provides chance.Since the hardware storage capacity of current main flow terminal expands increasingly, this is reality of the invention
It applies and provides better realization condition and basis.
Obviously, the above embodiment of the present invention be only to clearly illustrate example of the present invention, and not be pair
The restriction of embodiments of the present invention.For those of ordinary skill in the art, may be used also on the basis of the above description
To make other variations or changes in different ways.There is no necessity and possibility to exhaust all the enbodiments.It is all this
Made any modifications, equivalent replacements, and improvements etc., should be included in the claims in the present invention within the spirit and principle of invention
Protection scope within.
[1].D.Liu,B.Chen,C.Yang,and A.F.Molisch,"Caching at the wireless
edge: design aspects,challenges,and future directions,"in IEEE Communications
Magazine, vol.54,no.9,pp.22-28,Sept.2016.
[2].Y.Zhang,M.Pan,L.Song,Z.Dawy,and Z.Han,"A survey of contract
theory-based incentive mechanism design in wireless networks,"in IEEE
Wireless Communications,vol.24,no.3,pp.80-85,Jun.2017.
[3].L.Xu,C.Jiang,Y.Shen,T.Q.S.Quek,Z.Han,and Y.Ren,"Energy efficient
D2D communications:a perspective of mechanism design,"in IEEE Transactions on
Wireless Communications,vol.15,no.11,pp.7272-7285,Nov.2016.
[4].T.Zhang,H.Wang,X.Chu,and J.He,"A signaling-based incentive
mechanism for device-to-device content sharing in cellular networks,"in IEEE
Communications Letters,vol.21,no.6,pp.1377-1380,Jun.2017.
[5].Y.Li,B.Shen,J.Zhang,X.Gan,J.Wang,and X.Wang,"Offloading in HCNs:
congestion-aware network selection and user incentive design,"in IEEE
Transactions on Wireless Communications,vol.16,no.10,pp.6479-6492,Oct.2017.
[6].L.Breslau,P.Cao,L.Fan,G.Phillips,and S.Shenker,"Web caching and
Zipf-like distributions:evidence and implication,"in Proc.IEEE INFOCOM,New
York,NY,USA,pp.126-134,Mar.1999.
[7].P.Bolton and M.Dewatripont,Contract Theory.Cambridge,MA,USA:The
MIT Press,2004.
[8].W.Rudin,Principles of mathematical analysis.New York:McGraw-Hill,
1976.
[9].H.W.Kuhn,“The Hungarian method for the assignment problem,”Naval
Research Logistics,vol.2,no.1/2,pp.83-97,Mar.1955.
Claims (8)
1. the D2D cache contents sharing method based on bilateral contract excitation, which comprises the following steps:
S1: service request user BUE to base station eNB request data package；
S2: base station eNB obtains service request user BUE and services the geographical location information of user SUE, and service user SUE
The historical record of request packet；
S3: base station eNB, which filters out, to be the service user SUE set of service request user BUE service；
S4: base station eNB draws up a contract, and contract set is broadcast to service request user BUE and service user SUE；
S5: each service request user BUE and service user SUE chooses contract, and feeds back to base station eNB；
S6: base station eNB is matched after receiving feedback information, and matching result is broadcasted；If it fails to match, terminate；
S7: servicing user SUE, shared data packet gives service request user BUE as agreed；
S8: base station eNB is deducted fees and is rewarded to service request user BUE and service user SUE execution respectively, and cache contents are completed
It is shared.
2. the D2D cache contents sharing method according to claim 1 based on bilateral contract excitation, it is characterised in that: institute
State step S1 specifically:
S11: parameter definition: there are the phone user CUE of multiple and base station eNB communication for a base station eNB；B have data packet to need
The service request user BUE asked, collection are combined into B={ b1,b2,...,bi,...,bB}；S are cached with one or more data packets
Service user SUE, collection be combined into S={ s1,s2,...,sj,...,sS}；Packet collection is combined into F={ f1,f2,...,
fk,...,fK, K is the number of data packet；
S12: calculating the requested probability of data packet, is described by Zipf distribution, specifically:
Wherein,Indicate every part of requested probability of data packet,Indicate the profile exponent of data packet set.
3. the D2D cache contents sharing method according to claim 2 based on bilateral contract excitation, it is characterised in that: institute
State step S2 specifically: the historical requests packet note for defining the request data package set of service request user BUE, servicing user SUE
Record:
The potential communication link set S of service request user BUEi: assuming that in each time slot TSInterior, each service request user BUE is only
A data packet can be requested, is expressed asAnd it is denoted as the data packet set that user SUE has been cached with is servicedAnd service is asked
It seeks user BUE and services user SUE and request to be described with the probability of data cached packet by Zipf distribution.
4. the D2D cache contents sharing method according to claim 3 based on bilateral contract excitation, it is characterised in that: institute
State step S3 specifically:
S31: will meet in service request user's BUE communication range, i.e. di,j≤dmax, TSS in time slotjAnd biBetween communication away from
From di,jLess than or equal to D2D maximum communication distance dmax, and it has been cached with the clothes of service request user's BUE requested data packet
The set of business user SUE is defined as the potential communication link set of service request user BUE, i.e. service request user BUE and service
The existing whole D2D communication links for having potential communication capacity, are expressed as set S between user SUEi, it may be assumed that
Potential service user SUE set S0: the collection for defining all potential service user SUE is combined into S0, in which:
If shared S ' a service user SUE, S '=card (S0), wherein card () be set seek gesture operator；
S32: define channel transmission rate, base station eNB dispatching distribution instruction, service request user BUE expected rate grade and
It services user SUE and services wish degree grade:
Channel transmission rate ri,j: work as biAnd sjBetween there are when potential D2D communication link, definition channel transmission rate is ri,j, tool
Body expression formula are as follows:
Wherein, Pi,jIndicate sjTransmission power, Hi,j=(di,j)-η|hi,j|2Indicate biAnd sjBetween channel gain, di,jIt indicates
biAnd sjThe distance between, η is path loss index, | hi,j|2For the rayleigh fading effects factor, n0Indicate white Gaussian noise, w is system
Bandwidth；
Base station eNB dispatching distribution indicates xi,j: definition set X={ xi,j, xi,jFor the instruction of eNB dispatching distribution, xi,j=1 indicates sj
To biData transport service is provided；It is set in each service request user BUE in a time slot and at most obtains a service user
The service of SUE, each service user SUE to multipotency service nj(nj>=1) a service request user BUE, it may be assumed that
The expected rate grade θ of service request user BUEi: define θi(θi> 0) expected rate etc. for being service request user BUE
Grade, θiIt is bigger, indicate biIt is expected that the transmission rate request of required data packet is higher, it is ready to pay more costs；Conversely, θi
It is smaller, then it is assumed that biIt can receive lower rate, the cost paid also decreases；Accordingly, setting M (1≤M≤B) is a
Discrete user gradation forms an expected rate class set ΘB, it may be assumed that
Wherein:For m-th of expected rate grade, andThen biExpected rate grade θi∈
ΘB；θiThe intrinsic individual attribute for belonging to service request user BUE changes with the variation of the factors such as user's expectation, time, space
Become；
It services user SUE and services wish degree gradeDefinitionFor sjIt participates in providing the wish degree of buffer service,It is bigger, sjThe wish degree for participating in service is higher；Shared N (1≤N≤S ') a service wish degree grade is set, forms one
Service wish degree class set ΘS, it may be assumed that
Wherein:For n-th of service wish degree grade, andThen sjService wish degree Belong to the intrinsic private attribute of service user SUE, information will not be reported to base station eNB；
S33: base station eNB obtains the historical statistical information that service request user BUE obtains data packet, determines different expected rates etc.
Service request user's BUE proportion of grade；
S34: base station eNB obtains service user SUE and obtains the historical statistical information of data packet and participate in the statistics letter of D2D service
Breath determines service user's SUE proportion of different service wish degree grades；
S35: service request contract is denoted as ∏={ ri,j,πi,j, wherein ri,jFor channel transmission rate, base station eNB scheduling is indicated
sjCome for biB when data packet transmission service is providediIt is expected that obtainable rate；πi,jIndicate biFrom sjIt needs to pay when obtaining service
The expense of base station eNB；
biAccording to ri,jAnd the expense π for combining it to need to payi,j, a satisfaction evaluation is obtained, specifically:
Wherein: α (α > 0) is the Price Sensitive factor of service request user BUE,For satisfaction evaluation, i.e. biFrom sjPlace obtains
Utility function when service；By formula (7) it is found thatWith ri,jMonotonic increase shows the data that service request user BUE is obtained
Packet rate is higher, and satisfaction is higher；And work as ri,jWhen very big, the enough height of the data rate that service request user BUE is obtained, satisfaction
Degree can then increase more slowly, thereforeIt is ri,jConcave function, on the other hand, pay expense with service request user BUE
πi,jIncrease, satisfaction can reduce, i.e.,With πi,jMonotone decreasing；
S36: service contract is denoted as S is worked as in expressionjServe biWhen base station eNB need to pay sjService report
Reward；
sjAccording to ri,jAnd fee charged is needed in conjunction with itA satisfaction evaluation is obtained, specifically:
Wherein:For satisfaction evaluation, i.e. sjFor biUtility function when service is provided；With remunerationMonotonic increase,
Namely the higher service user SUE of price is more satisfied, and with sjPay ri,jBecome larger, satisfaction can reduce；
S37: formula (7) and formula (8) are based on, it is assumed that the deducting fees of the service request user BUE of equating expections speed grade mark it is identical,
And the incentive standard of the service user SUE of same services wish degree grade is identical, then the overall weight average utility letter of base station eNB
Number are as follows:
Therefore, the objective function P1 of optimization can be set are as follows:
Its constraint formula include formula (3), formula (4) and
Wherein:
Constraint formula (2), formula (3) are matching constraint, indicate a time slot TSInterior, each service request user BUE at most obtains one
The service of a service user SUE, and each service user SUE can service multiple service request user BUE；
Constraint formula (11) and formula (13) indicate the reasonability constraint condition IRC of personal motivation, i.e., each service request user BUE and
The effectiveness of service user SUE should be nonnegative value, guarantees excitation service request user BUE and services the participation of user SUE；
Constraint formula (12) and formula (14) indicate excitation compatibility condition CIC, right-hand side expression ln (the 1+ θ of the two inequalityiri′,j)-α
πi′,jWithService request user BUE is respectively indicated by expected rate grade θi′The service request user BUE's of grade
Effectiveness obtained by contract, and service wish degree grade and beService user SUE take service wish degree grade beClothes
Effectiveness obtained by the contract of business user SUE；Therefore formula (12), formula (14) show each service request user BUE and service user
SUE is only ready to take the contract of oneself corresponding grade.
5. the D2D cache contents sharing method according to claim 4 based on bilateral contract excitation, it is characterised in that: institute
State step S4 specifically:
S41: the reasonability constraint condition IRC to service request user BUE and service user SUE, excitation compatibility condition CIC respectively
Simplified；
S42: using simplified constraint condition, iteration derives π respectivelyi,j、About ri,jExpression formula；
S43: only variable r is converted by problem P1i,jFunctional form；
S44: do not consider ri,jR is solved using method of Lagrange multipliers under the premise of monotonicity constrainti,j；Judging the solution acquired is
It is no to meet ri,jDullness, satisfaction then terminate；It is unsatisfactory for, is adjusted, make ri,jMeet constraint；
S45: contract set Γ and Π are solved according to obtained solution, completion contract is drafted.
6. the D2D cache contents sharing method according to claim 5 based on bilateral contract excitation, it is characterised in that: institute
State step S41 specifically:
Variable x is not consideredi,jSolution, ignore matching constraint conditional (3), the formula (4) of formula (10), and define:
Problem P2 then is converted by problem P1, specifically:
It is formula (11), formula (12), formula (13) and formula (14) that it, which constrains formula,；
The step S42 specifically:
Meet the feasible whole necessary conditions of contract and adequate condition specifically:
Necessary condition: 1) θiWith ri,jMonotone increasing；2)πi,jWith ri,jMonotone increasing；3)Ubi,jWith θiMonotone increasing；4)ri,jWithIt is dull
Increase；5)With ri,jMonotone increasing；6)Usi,jWithMonotone increasing；Wherein, by condition 1) and condition 4) it is respectively defined as service request
The monotonicity constraint of user BUE and service user SUE contract, i.e. formula (17) and formula (18) are as follows:
Adequate condition: being θ to expected rate gradeiAnd θi-1Service request user BUE, the two utility function meets formula (16),
And to θiAnd θi+1Service request user BUE, the two utility function meets formula (17)；It is to service wish degree gradeWith
Service user SUE, the two utility function meets formula (18), and rightWithService user SUE, the two utility function
Meet formula (19), specific as follows:
Using formula (7) and formula (8), under the constraint for meeting formula (17), formula (18), by constraint equation (11), the formula of problem P2
(12), formula (13), formula (14) are reduced to formula (23), formula (24), formula (25) and formula (26), specific as follows:
Therefore in conjunction with the adequate condition and necessary condition, problem P2-1 is converted by problem P2, expression is as follows:
Its constraint condition is formula (17)~formula (26)；
The step S43 specifically:
According to formula (27) joint type (20) and formula (21), have:
Joint type (22) and formula (23), have:
By formula；(25) it substitutes into problem P2-1, is obtained only with respect to r with formula (26)i,jExpression formula, and constrain formula be formula (14) and
Formula (15)；
The step S44 specifically: do not consider formula (14), formula (15), show that the optimization is asked by method of Lagrange multipliers solution
Topic without limitation optimal solution；Then examine whether the solution meets formula (14), formula (15) again；Ungratified solution is adjusted,
It is set to meet constraint；
The step S45 specifically: the value r that will be solvedi,jSubstitution formula；(25) and in formula (26), finally obtain problem P2-1's
Target solution πi,jWithTo solve contract set Γ and Π, completion contract is drafted.
7. the D2D cache contents sharing method according to claim 6 based on bilateral contract excitation, it is characterised in that: institute
State step S6 matching object procedure specifically:
S61: potential matching matrix X is generatedP, find out the utility matrix U of base station eNBP；
S62: the utility matrix U of base station eNB is modifiedP, formation amplification matrix U 'P；
S63: to matrix XPWith U 'PIt is solved using one-to-one matched Hungary Algorithm, the base station eNB effect after being matched
With matrix U and matching matrix X；
S64: examining matching matrix X, judge whether to meet matching condition, if potential communication chain is not present in service request user BU
Road, or there are potential communication link but when not searching out proper fit object, then it is assumed that service request user BUE matching is lost
It loses, terminates process；If successful match, obtains service request user BUE and service the matching result of user SUE.
8. the D2D cache contents sharing method according to claim 7 based on bilateral contract excitation, it is characterised in that: institute
Stating step S6 is specially to solve variable xi,jFormula (10) maximizes, and specific matching process is as follows:
The step S61 specifically: according to the r solvedi,j、πi,jWithIt is solved Lai after by formula (27), problem P1 is converted
Are as follows:
It is formula (2), formula (3) that it, which constrains formula,；
The constraint condition for not considering formula (30) generates each service request user BUE and when potential communication link establishes connection
Potential matching matrix XP, effectiveness obtained by base station eNB under the match condition is calculated, B × S ' dimension utility matrix, note are formed
For UP；
The step S62 specifically: to access nj(nj> 1) the service user SUE of a service request user BUE is equivalent to njA
One service user SUE can be accessed to be allocated, that is, replicate matrix UPJth column, to UPExpand (nj- 1) it arranges, is formed and expanded
Increasing matrix U 'P；
The step S63 specifically: to matrix XPWith U 'PIt is solved, is matched using one-to-one matched Hungary Algorithm
Base station eNB utility matrix U and matching matrix X afterwards；
The step S64 specifically: variable x is solved according to base station eNB utility matrix U and matching matrix Xi,j, complete entire mesh
The Optimization Solution of scalar functions, to obtain service request user BUE and service the matching result of user SUE；
If potential communication link is not present in service request user BUE, or does not search out there are potential communication link but suitable
When with object, then it is assumed that it fails to match by service request user BUE, terminates process.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910190129.6A CN109922461B (en) | 2019-03-13 | 2019-03-13 | D2D cache content sharing method based on bilateral contract incentive |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910190129.6A CN109922461B (en) | 2019-03-13 | 2019-03-13 | D2D cache content sharing method based on bilateral contract incentive |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109922461A true CN109922461A (en) | 2019-06-21 |
| CN109922461B CN109922461B (en) | 2021-07-09 |
Family
ID=66964663
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910190129.6A Active CN109922461B (en) | 2019-03-13 | 2019-03-13 | D2D cache content sharing method based on bilateral contract incentive |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109922461B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111328092A (en) * | 2020-02-27 | 2020-06-23 | 中山大学 | Method for dynamically updating pre-information in D2D communication relay packet buffer allocation |
| CN112188468A (en) * | 2020-09-29 | 2021-01-05 | 重庆邮电大学 | Terminal discovery method adopting excitation mechanism in terminal direct connection system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060064497A1 (en) * | 2004-09-21 | 2006-03-23 | Yigal Bejerano | Fairness and load balancing in wireless LANs using association control |
| CN106973360A (en) * | 2017-03-22 | 2017-07-21 | 中国科学院上海微***与信息技术研究所 | The cache policy and motivational techniques of a kind of D2D communication networks |
| CN108197969A (en) * | 2017-12-07 | 2018-06-22 | 北京交通大学 | A kind of D2D based on block chain shares the system and its implementation of reward |
| CN108521640A (en) * | 2018-02-27 | 2018-09-11 | 北京邮电大学 | A kind of content distribution method in cellular network |
| CN108882247A (en) * | 2018-07-04 | 2018-11-23 | 西北工业大学 | A kind of cognitive radio networks resource allocation methods based on Contract Theory |
-
2019
- 2019-03-13 CN CN201910190129.6A patent/CN109922461B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060064497A1 (en) * | 2004-09-21 | 2006-03-23 | Yigal Bejerano | Fairness and load balancing in wireless LANs using association control |
| CN106973360A (en) * | 2017-03-22 | 2017-07-21 | 中国科学院上海微***与信息技术研究所 | The cache policy and motivational techniques of a kind of D2D communication networks |
| CN108197969A (en) * | 2017-12-07 | 2018-06-22 | 北京交通大学 | A kind of D2D based on block chain shares the system and its implementation of reward |
| CN108521640A (en) * | 2018-02-27 | 2018-09-11 | 北京邮电大学 | A kind of content distribution method in cellular network |
| CN108882247A (en) * | 2018-07-04 | 2018-11-23 | 西北工业大学 | A kind of cognitive radio networks resource allocation methods based on Contract Theory |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111328092A (en) * | 2020-02-27 | 2020-06-23 | 中山大学 | Method for dynamically updating pre-information in D2D communication relay packet buffer allocation |
| CN112188468A (en) * | 2020-09-29 | 2021-01-05 | 重庆邮电大学 | Terminal discovery method adopting excitation mechanism in terminal direct connection system |
| CN112188468B (en) * | 2020-09-29 | 2023-01-31 | 重庆邮电大学 | Terminal discovery method adopting excitation mechanism in terminal direct connection system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109922461B (en) | 2021-07-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Hamidouche et al. | Many-to-many matching games for proactive social-caching in wireless small cell networks | |
| Vamvakas et al. | Dynamic provider selection & power resource management in competitive wireless communication markets | |
| CN110113190A (en) | Time delay optimization method is unloaded in a kind of mobile edge calculations scene | |
| Al Daoud et al. | A stackelberg game for pricing uplink power in wide-band cognitive radio networks | |
| CN105657750B (en) | A kind of calculation method and device of network dynamic resource | |
| Buttyan et al. | Barter-based cooperation in delay-tolerant personal wireless networks | |
| Xiong et al. | A multi-dimensional contract approach for data rewarding in mobile networks | |
| Ma et al. | A game-theoretic analysis of user behaviors in crowdsourced wireless community networks | |
| CN107396448A (en) | A kind of resource allocation methods in heterogeneous network | |
| CN109922461A (en) | D2D cache contents sharing method based on bilateral contract excitation | |
| Xiong et al. | Contract design in hierarchical game for sponsored content service market | |
| Zhang et al. | A caching-based incentive mechanism for cooperative data offloading | |
| Wang et al. | Spectrum sharing based on truthful auction in licensed shared access systems | |
| CN107105453A (en) | Heterogeneous network selection cut-in method based on analytic hierarchy process (AHP) and evolutionary game theory | |
| Wang et al. | Duopoly competition for mobile data plans with time flexibility | |
| Teng et al. | Reinforcement-learning-based double auction design for dynamic spectrum access in cognitive radio networks | |
| Gomez et al. | Market-driven stochastic resource allocation framework for wireless network virtualization | |
| Yue et al. | A double auction-based approach for multi-user resource allocation in mobile edge computing | |
| Jiang et al. | On economic viability of mobile edge caching | |
| Jaimes et al. | A cooperative incentive mechanism for recurrent crowd sensing | |
| Pang et al. | When data sponsoring meets edge caching: A game-theoretic analysis | |
| Ren et al. | Data demand dynamics in wireless communications markets | |
| CN105682176A (en) | Node incentive method based on buying-selling model and two-layer optimization | |
| Li et al. | Incentive and knowledge distillation based federated learning for cross-silo applications | |
| Gao et al. | An evolutionary game theoretic analysis for crowdsourced WiFi networks |
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 |