CN102404747B - Efficient and fair dynamic spectrum allocation method - Google Patents

Efficient and fair dynamic spectrum allocation method Download PDF

Info

Publication number
CN102404747B
CN102404747B CN2011103719889A CN201110371988A CN102404747B CN 102404747 B CN102404747 B CN 102404747B CN 2011103719889 A CN2011103719889 A CN 2011103719889A CN 201110371988 A CN201110371988 A CN 201110371988A CN 102404747 B CN102404747 B CN 102404747B
Authority
CN
China
Prior art keywords
formula
alliance
wireless network
sigma
cognition wireless
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.)
Expired - Fee Related
Application number
CN2011103719889A
Other languages
Chinese (zh)
Other versions
CN102404747A (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.)
University of Science and Technology Beijing USTB
Original Assignee
University of Science and Technology Beijing USTB
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 University of Science and Technology Beijing USTB filed Critical University of Science and Technology Beijing USTB
Priority to CN2011103719889A priority Critical patent/CN102404747B/en
Publication of CN102404747A publication Critical patent/CN102404747A/en
Application granted granted Critical
Publication of CN102404747B publication Critical patent/CN102404747B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention discloses an efficient and fair dynamic spectrum allocation method which is applicable to interactive cognitive radio networks and comprises the following steps: on the basis of cooperative differential game theory, dividing the interactive cognitive radio network into different alliances and establishing an alliance-competition type architecture; setting that the interactive cognitive radio network has a plurality of cognitive users as well as the objective function and the payoff function of each cognitive user; and solving the objective function and the payoff function. The invention can effectively relieve the shortage of spectrum, improve the utilization ratio of spectrum, and take account of the fairness and the efficiency of spectrum use.

Description

Efficient and fair method for allocating dynamic frequency spectrums
Technical field
The present invention relates to a kind of efficient and fair method for allocating dynamic frequency spectrums that solves the performance and fairness problem of cognition wireless network dynamic frequency spectrum deployment, belong to the dynamic resource partitioning technology field of cognition radio communication network.
Background technology
Dynamic frequency spectrum deployment is the problem of dynamic game in many ways distributed, the multi-user.Each cognitive user is in the situation that resource-constrained, and the process that takies of frequency spectrum be can be regarded as to a game process, and this game comprises competition successively of call duration time, the competition of communication frequency etc.Each cognitive user, when using frequency spectrum, all wishes at utmost to meet the communication requirement of oneself, and still, for whole system, unordered competition may cause the decline of overall performance on the contrary.Therefore, in order to improve the spectrum allocation may efficiency of a plurality of cognitive user, just must allow each cognitive user use frequency spectrum according to certain rule or algorithm.
All adopt at present game theoretic theory, model and algorithm, the spectrum allocation may between the research multi-user, solve the frequency spectrum resource race problem between a plurality of cognitive user.
Dynamic Spectrum Management in interactive cognition wireless network need to be considered the problem of four aspects: the interference problem of (1) cognitive user to the primary user; (2) race problem between cognitive user; (3) the optimum spectrum allocation may problem of frequency spectrum time-varying characteristics; (4) efficiency of cognitive radio system and the fairness problem between the user.For (1), (2) two problems, usually adopt model and the method for Static Game opinion.(3) individual problem, particularly the optimum spectrum allocation may problem of continuous time varying spectrum, be the process of time dependent dynamic game and cooperation.(4) individual problem belongs to cooperation with collaborative, by coordinating to realize cooperation, and the chief and the advantage of performance each side, the collaborative situation of creating win-win.
Document 1 (Z.Ji, and K.J.R.Liu.Multi-Stage Pricing Game for Collusion-Resistant Dynamic Spectrum Allocation.IEEE Journal on Selected Areas in Communications, 2008,26 (1): 182-191.) dynamic frequency spectrum deployment is modeled as to a multistage Pricing Game, and propose a kind of suppress the conflict the Dynamic Pricing method, use optimum reservation price conflict removal, and maximize user's utility level.Simultaneously, use and to receive assorted bargaining solution and analyze the boundary condition of this scheme, the boundary constraint needed is lower.Simulation result shows, under different user's conflict situations, all can obtain the higher availability of frequency spectrum.Document 2 (Dusit Niyato, Ekram Hossain.Competitive Pricing for Spectrum Sharing in Cognitive Radio Networks:Dynamic Game, Inefficiency of Nash Equilibrium, and Collusion.IEEE Journal on Selected Areas In Communications, 2008, 26 (1): the Bertrand model that 192-202.) proposes price of spectrum game between a plurality of main systems, but suppose to participate in the main system full symmetric of game, without any difference, this is the special circumstances of cognition wireless network.
Visible, most of technical scheme in the cognition wireless network technology is all launched based on Static Game opinion and repeated game at present, although above these methods, realizing having obtained some progress aspect efficient and fair dynamic frequency spectrum deployment, can not reflect use scenes truly.In fact, dynamic frequency spectrum deployment is a process of dynamic interaction in time, and the optimum spectrum allocation schemes of previous moment may no longer keep at lower a moment its optimality.That is to say, in cognition wireless network, radio environment is along with the variation in time and space has different characteristics, and the band informations such as operating frequency and bandwidth also have different characteristics; Simultaneously, because user in cognition wireless network changes at any time to the demand of bandwidth, quantity, situation and the position of available channel.Therefore, frequency spectrum distributing method seems most important flexibly and effectively.Cognition wireless network is in order to meet user's QoS demand, must the time select best frequency band in the available band that becomes.
Summary of the invention
The object of the present invention is to provide the efficient and fair method for allocating dynamic frequency spectrums of a kind of interactive cognition wireless network based on the game of cooperation differential, the problem of varying firing rate environment in the time of still can not reflecting truly to solve current method for allocating dynamic frequency spectrums.
For solving the problems of the technologies described above, efficient and fair method for allocating dynamic frequency spectrums provided by the invention comprises the following steps: based on cooperation differential theory of games, interactive cognition wireless network is divided into to different alliances, sets up interactive cognition wireless network " alliance-competition " type architecture; Set interactive cognition wireless network and there is n cognitive user, and target function or the pay off function of each cognitive user i ∈ N are: max u i ∫ 0 ∞ [ x ( s ) - u i ( s ) x ( s ) u i ( s ) ] exp ( - rs ) ds , i ∈ N = { 1,2 , . . . , n } , s ∈ [ 0 , ∞ ) - - - ( 1 ) ; In formula (1), s means that N means the cognitive user set constantly, and state variable x (s) means the percentage of interactive cognition wireless network at moment s usable spectrum, control variables u i(s) mean the frequency spectrum access rate of each cognitive user i ∈ N at moment s, normal number r means the discount rate of interactive cognition wireless network, and the percentage x (s) of usable spectrum meets following dynamical system: x · ( s ) = x ( s ) - Σ i = 1 n u i ( s ) ; x ( 0 ) = x 0 - - - ( 2 )
Formula (1) is solved.
The present invention is by combining " game of cooperation differential " with " interactive cognition wireless network ", can be based on cooperation differential theory of games, to interactive cognition wireless network dynamic frequency spectrum deployment modeling and simulation, solve dynamic and the cooperation issue of frequency spectrum access, simultaneously, can also take into account fairness and the efficiency that frequency spectrum is used.Therefore, the rare of frequency spectrum resource can be effectively alleviated in the present invention, improves the utilance of frequency spectrum, to manager, attendant, manufacturer and terminal use, all will produce far-reaching influence.For spectrum management person, can effectively improve the utilance of frequency spectrum, for new communications applications provides how available frequency spectrum.For the attendant, can utilize frequency spectrum by maximizing, can maximum gain; Can realize the seamless switching of heterogeneous network; Can effectively reduce O&M cost.For manufacturer, can reduce costs, and new demand is made to quick response.For the terminal use, can use any equipment to access at an easy rate arbitrary network at any time and any place, realize wireless roaming.
The accompanying drawing explanation
In order to be illustrated more clearly in the embodiment of the present invention or technical scheme of the prior art, below will the accompanying drawing of required use in embodiment or description of the Prior Art be briefly described, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain according to these accompanying drawings other accompanying drawing.
The schematic flow sheet that Fig. 1 is the embodiment of the present invention;
Fig. 2 is model solution and the analytic process schematic diagram based on the game of cooperation differential.
Embodiment
Below in conjunction with accompanying drawing of the present invention, technical scheme of the present invention is clearly and completely described, obviously, described embodiment is only the present invention's part embodiment, rather than whole embodiment.Embodiment based in the present invention, those of ordinary skills, not making under the creative work prerequisite the every other embodiment obtained, belong to the scope of protection of the invention.
Fig. 1 schematically shows the step of the embodiment of the present invention, as shown in it, in order to improve the efficiency of interactive cognition wireless network dynamic frequency spectrum deployment, at first in step S11, propose and set up a kind of interactive cognition wireless network " alliance-competition " type architecture based on cooperation differential theory of games, and preferably according to position, frequency range, frequency is used dense degree and transmitting power, cognition network is divided into to different alliances, there is cooperation each alliance inside, between each alliance, competition is arranged, slice-of-life cognitive radio system so better, there is better using value.
Then, as step S12, set interactive cognition wireless network and have n cognitive user, consider that this has the frequency spectrum share scene of n cognitive user, wherein target function or the pay off function of each cognitive user i ∈ N are as follows:
max u i ∫ 0 ∞ [ x ( s ) - u i ( s ) x ( s ) u i ( s ) ] exp ( - rs ) ds , i ∈ N = { 1,2 , . . . , n } ,
s∈[0,∞) (1)。
In above formula (1), s means that N means the cognitive user set constantly, and state variable x (s) means the percentage of interactive cognition wireless network at moment s usable spectrum, control variables u i(s) mean the frequency spectrum access rate of each cognitive user i ∈ N at moment s, normal number r means the discount rate of interactive cognition wireless network, preferably establishes r=1.5.
In interactive cognition wireless network, the percentage of usable spectrum meets following dynamical system:
x · ( s ) = x ( s ) - Σ i = 1 n u i ( s ) , x ( 0 ) = x 0 ; - - - ( 2 ) .
As step S13, solve above formula (1), and preferably, the solution procedure of cooperation differential game comprises the following steps:
(1) calculate the maximum return of total alliance;
(2) calculate the Nash Equilibrium Solution of each member in noncooperative situation in alliance;
(3) calculate except total alliance the income of alliance likely;
(4) determine characteristic equation;
(5) calculate Sharp's profit value;
(6) determine a distribution of income program (Income Distribution Procedure is called for short IDP) with time consistency.
Specifically solve with analytic process as shown in Figure 2, the differential game is the theory of processing both sides or in many ways dynamically resisting continuously problem of game, at present mainly towards military, economic dispatch field, not yet be applied to communication resource sharing problem, its Major Mathematics basis is " mathematical theory of optimal process " of Bel's graceful " Dynamic Programming " and Pang Te lia king.Optimized method is very extensive in the application of the communications field, as graph theory, genetic algorithm, neural net etc.As long as find target function and the state equation (group) of describing cognition wireless network corresponding model and algorithm, can be converted into a decision-making problem of multi-objective, finally solve corresponding Bernoulli equation group or in block and put forward (Riccati) equation group, can try to achieve optimal solution, and then analyze uniqueness of solution etc.And no matter these equation group are numerical solution or analytic solutions, all can separate under certain condition.
In order to make those skilled in the art further understand the present invention, one embodiment of the invention specifically provide a kind of method that solves formula (1), specific as follows:
(1) calculate the maximum return of total alliance.
Be exactly, total calculate the dynamic programming problems that the maximum return of alliance is separated a standard, target function is to maximize all cognitive user frequency spectrum utilization rates, constraints is above-mentioned formula (2), obtains:
max u 1 , u 2 , . . . u n Σ i ∈ N ∫ t ∞ [ x ( s ) - u i ( s ) x ( s ) u i ( s ) ] exp [ - r ( s - t ) ] ds ; - - - ( 3 )
x · ( t ) = x ( t ) - Σ i = 1 n u i ( t ) , x ( 0 ) = x 0 , x ( t ) = x N ( t ) ; - - - ( 4 )
In order to solve the feedback Nash Equilibrium Solution of game (3)-(4), can obtain Bellman equation as follows:
rW ( N , x , t ) = max u 1 , u 2 , . . . u n { Σ i = 1 n x - u i x u i + W x ( N , x , t ) ( x - Σ i = 1 n u i ) } ; - - - ( 5 )
Wherein, W(N, x, t) mean the graceful value function of Bel of above-mentioned dynamic programming problems, to the both sides of formula (5) respectively to u iask partial derivative, can obtain:
u i N = [ 1 - W x ( N , x , t ) ] x / 2 , i ∈ N
Will
Figure GDA0000371868500000065
bring formula (5) into and solve, can obtain:
W ( N , x , t ) = n + 1 - 2 n + 1 n x ; - - - ( 6 )
u i N = 2 n + 1 - 1 2 n x , i ∈ N ; - - - ( 7 )
Formula (7) has shown frequency spectrum access rate under total alliance
Figure GDA0000371868500000068
relation with the percentage x of usable spectrum.Although not explicitly depend on time t, but x becomes while being, so the radio frequency environment become when it has reflected truly.
The percentage of the usable spectrum of interactive cognition wireless network optimum is as follows:
x N ( t ) = x 0 exp ( 3 - 2 n + 1 2 t ) ; - - - ( 8 )
(2) calculate the Nash Equilibrium Solution of each member in noncooperative situation in alliance.
The feedback Nash Equilibrium Solution of non-cooperative game (1)-(2) must meet following condition:
r V i ( t , x ) = max u i { x - u i x u i + V x i ( t , x ) ( x - u i - Σ j = 1 , j ≠ i n u i ) } ; - - - ( 9 )
Wherein, V i(t, x) means the graceful value function of the Bel of i cognitive user; To the both sides of formula (9) respectively to u iask partial derivative, can obtain:
u i * = [ 1 - V x i ( t , x ) ] x / 2 , i ∈ N ; - - - ( 10 )
Formula (10) is brought into to formula (9) and is solved, can obtain:
V i ( t , x ) = n + 1 - n 2 + 2 2 n - 1 x , i ∈ N ; - - - ( 11 )
The feedback Nash Equilibrium Solution of the frequency spectrum access rate of each cognitive user i ∈ N solves as follows:
u i * = n - 2 + n 2 + 2 2 ( 2 n - 1 ) x , i ∈ N ; - - - ( 12 )
(3) calculate except total alliance the income of alliance likely.
Calculate the income except the game of total alliance and single cognitive user composition, such alliance has 2 n-n-2.Use W (K, x, t) to mean the graceful value function of Bel of the K of alliance, W (K, x, t) must meet following Bellman equation:
rW ( K , x , t ) = max u i , i ∈ K { Σ i ∈ K x - u i x u i + W x ( K , x , t ) [ x - Σ i ∈ K u i - Σ j ∉ K u j * ] } ; - - - ( 13 )
To the both sides of formula (13) respectively to u iask partial derivative, can obtain:
u i K = [ 1 - W x ( K , x , t ) ] x / 2 , i ∈ K .
Will
Figure GDA0000371868500000082
bring formula (13) into and solve, can obtain:
W ( K , x , t ) = A - A 2 - k 2 k x ; - - - ( 14 )
u i K = k - A + A 2 - k 2 2 k x , i ∈ K ; - - - ( 15 )
Wherein: A = n + 1 - ( n - k ) · n + 1 - n 2 + 2 2 n - 1 .
(4) defined feature equation.
Characteristic function v (the K of this cooperative game; X, t) be defined as follows:
v({i};x,t)=V i(t,x);
v(K;x,t)=W(K,x,t),
Figure GDA0000371868500000088
Wherein, the characteristic function value is given by following formula:
v ( { i } ; x , t ) = V i ( t , x ) = n + 1 - n 2 + 2 2 n - 1 x , i ∈ N ;
v ( K ; x , t ) = W ( K , x , t ) = A - A 2 - k 2 k x ;
A = n + 1 - ( n - k ) · n + 1 - n 2 + 2 2 n - 1 , K ⊆ N .
(5) calculate Sharp's profit value.
Sharp's profit value of this cooperative game is as follows:
Φ i v ( x , t ) = Σ i ∈ K ( k - 1 ) ! ( n - k ) ! n ! [ v ( K ; x , t ) - v ( K \ { i } ; x , t ) ]
i=1,....,n ;(16)
When n=3, have:
Φ i v ( x , t ) = 4 - 7 9 x , i ∈ { 1,2,3 } ; - - - ( 17 )
Sharp's profit value has provided concrete spectrum allocation schemes by the mode of probability, has shown fairness and uniqueness, and each cognitive user can obtain optimum frequency spectrum access chance.
(6) determine a distribution of income program with time consistency.
The percentage x of the usable spectrum of the interactive cognition wireless network optimum meaned along formula (8) n(t), for Sharp's profit is worth
Figure GDA0000371868500000094
an instantaneous distribution is provided, can uses following partition function:
B i ( t ) = r Φ i v ( x N ( t ) , t ) - d dt Φ i v ( x N ( t ) , t ) ; - - - ( 18 )
Directly calculate:
B i ( t ) = 4 7 - 7 18 x N ( t ) ; - - - ( 19 )
In same alliance inside, each cognitive user does not have otherness to the use of frequency spectrum, has shown the fairness of model, can improve the utilance of frequency spectrum simultaneously, the radio frequency environment become while reflecting truly.
To sum up, the present invention is for the dynamic that solves the cognition wireless network dynamic frequency spectrum deployment and the problem of cooperative aspect, based on cooperation stochastic differential game theory, new thinking and direction have been proposed, for the Tactic selection problem of dynamic scene provides Mathematics Proof, also make the searching steady state solution become possibility, thereby, can effectively utilize frequency spectrum resource, meet the demand of different user to frequency spectrum resource, increase power system capacity, improve the availability of frequency spectrum.Therefore, the game of cooperation differential is introduced to cognition wireless network and can solve cognition wireless network dynamic frequency spectrum deployment problem, effectively alleviate the rare of frequency spectrum resource, improve the utilance of frequency spectrum.
The above; be only the specific embodiment of the present invention, but protection scope of the present invention is not limited to this, anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; can expect easily changing or replacing, within all should being encompassed in protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion by the described protection range with claim.

Claims (4)

1. an efficient and fair method for allocating dynamic frequency spectrums, be applicable to interactive cognition wireless network, it is characterized in that, comprises the following steps:
Based on cooperation differential theory of games, interactive cognition wireless network is divided into to different alliances, set up interactive cognition wireless network " alliance-competition " type architecture;
Set interactive cognition wireless network and there is n cognitive user, and target function or the pay off function of each cognitive user i ∈ N are:
max u i ∫ 0 ∞ [ x ( s ) - u i ( s ) x ( s ) u i ( s ) ] exp ( - rs ) ds , i ∈ N = { 1,2 , . . . , n } , s ∈ [ 0 , ∞ ) ; - - - ( 1 )
In formula (1), s means that N means the cognitive user set constantly, and state variable x (s) means the percentage of interactive cognition wireless network at moment s usable spectrum, control variables u i(s) mean the frequency spectrum access rate of each cognitive user i ∈ N at moment s, normal number r means the discount rate of interactive cognition wireless network, and the percentage x (s) of usable spectrum meets following dynamical system:
x · ( s ) = x ( s ) - Σ i = 1 n u i ( s )
x(0)=x 0 ;(2)
Formula (1) is solved.
2. efficient and fair method for allocating dynamic frequency spectrums according to claim 1, is characterized in that, the basis that interactive cognition wireless network is divided into to different alliances is used dense degree and transmitting power for position, frequency range, frequency.
3. efficient and fair method for allocating dynamic frequency spectrums according to claim 1, is characterized in that, establishes normal number r=1.5.
4. efficient and fair method for allocating dynamic frequency spectrums according to claim 1, is characterized in that, to formula (1), solves further comprising the steps:
Calculate the maximum return of total alliance;
In this step, the maximum return of calculating total alliance is considered as solving to the dynamic programming problems of a standard, maximizing the target function of all cognitive user frequency spectrum utilization rates or the constraints of pay off function is described formula (2), obtains whereby:
max u 1 , u 2 , . . . u n Σ i ∈ N ∫ t ∞ [ x ( s ) - u i ( s ) x ( s ) u i ( s ) ] exp [ - r ( s - t ) ] ds ; - - - ( 3 )
x · ( t ) = x ( t ) - Σ i = 1 n u i ( t ) , x ( 0 ) = x 0 , x ( t ) = x N ( t ) ; - - - ( 4 )
Calculate Bellman equation as shown in the formula (5), to solve the feedback Nash Equilibrium Solution of formula (3)-(4):
rW ( N , x , t ) = max u 1 , u 2 , . . . u n { Σ i = 1 n x - u i x u i + W x ( N , x , t ) ( x - Σ i = 1 n u i ) } ; - - - ( 5 )
Wherein, W (N, x, t) means the graceful value function of Bel of described dynamic programming problems, to the both sides of formula (5) respectively to u iask partial derivative, can obtain:
u i N = [ 1 - W x ( N , x , t ) ] x / 2 , i ∈ N ;
Will
Figure FDA0000371868490000025
bring formula (5) into and solve, can obtain:
W ( N , x , t ) = n + 1 - 2 n + 1 n x ; - - - ( 6 )
u i N = 2 n + 1 - 1 2 n x , i ∈ N ; - - - ( 7 )
Formula (7) is presented at frequency spectrum access rate under total alliance
Figure FDA0000371868490000033
with the relation of the percentage x of usable spectrum, and the percentage of the usable spectrum of interactive cognition wireless network optimum as shown in the formula:
x N ( t ) = x 0 exp ( 3 - 2 n + 1 2 t ) ; - - - ( 8 )
Calculate the Nash Equilibrium Solution of each member in noncooperative situation in alliance;
In this step, the feedback Nash Equilibrium Solution of formula (1)-(2) meets following formula (9):
rV i ( t , x ) = max u i { x - u i x u i + V x i ( t , x ) ( x - u i - Σ j = 1 , j ≠ i n u j ) } ; - - - ( 9 )
Wherein, V i(t, x) means the graceful value function of the Bel of i cognitive user; To the both sides of formula (9) respectively to u iask partial derivative, can obtain:
u i * = [ 1 - V x i ( t , x ) ] x / 2 , i ∈ N ; - - - ( 10 )
Formula (10) is brought into to formula (9) and is solved, can obtain:
V i ( t , x ) = n + 1 - n 2 + 2 2 n - 1 x , i ∈ N ; - - - ( 11 )
The feedback Nash Equilibrium Solution of the frequency spectrum access rate of each cognitive user i ∈ N solves as follows:
u i * = n - 2 + n 2 + 2 2 ( 2 n - 1 ) x , i ∈ N ; - - - ( 12 )
Calculate except total alliance the income of alliance likely;
In this step, calculate the income except the game of total alliance and single cognitive user composition, such alliance has 2 n-n-2.The graceful value function of Bel that means the K of alliance with W (K, x, t), W (K, x, t) meets following Bellman equation:
rW ( K , x , t ) = max u i , i ∈ K { Σ i ∈ K x - u i x u i + W x ( K , x , t ) [ x - Σ i ∈ K u i - Σ j ∉ K u j * ] } ; - - - ( 13 )
To the both sides of formula (13) respectively to u iask partial derivative, can obtain:
u i K = [ 1 - W x ( K , x , t ) ] x / 2 , i ∈ K ;
Will
Figure FDA0000371868490000044
bring formula (13) into and solve, can obtain:
W = ( K , x , t ) = A - A 2 - k 2 k x ; - - - ( 14 )
u i K = k - A + A 2 - k 2 2 k x , i ∈ K ; - - - ( 15 )
Wherein: A = n + 1 - ( n - k ) · n + 1 - n 2 + 2 2 n - 1 ;
Determine characteristic equation;
In this step, by the characteristic function v (K of described cooperative game; X, t) be defined as follows:
v({i};x,t)=V i(t,x);
v(K;x,t)=W(K,x,t),
Figure FDA0000371868490000057
Wherein, the characteristic function value is given by following formula:
v ( { i } ; x , t ) = V i ( t , x ) = n + 1 - n 2 + 2 2 n - 1 x , i ∈ N ;
v ( K ; x , t ) = W ( K , x , t ) = A - A 2 - k 2 k x ;
A = n + 1 - ( n - k ) · n + 1 - n 2 + 2 2 n - 1 , K ⊆ N ;
Calculate Sharp's profit value;
In this step, the Sharp of this cooperative game profit value is as follows:
Φ i v ( x , t ) = Σ i ∈ K ( k - 1 ) ! ( n - k ) ! n ! [ v ( K ; x , t ) - v ( K \ { i } ; x , t ) ]
i=1,...,n; (16)
When n=3, have:
Φ i v ( x , t ) = 4 - 7 9 x , i ∈ { 1 , 2 , 3 } ; - - - ( 17 )
Determine a distribution of income program with time consistency.
The percentage x of the usable spectrum of the interactive cognition wireless network optimum meaned according to formula (8) in this step, n(t), utilize the partition function of following formula (18), to Sharp's profit value
Figure FDA0000371868490000064
an instantaneous distribution is provided:
B i ( t ) = rΦ i v ( x N ( t ) , t ) - d dt Φ i v ( x N ( t ) , t ) ; - - - ( 18 )
Directly calculate:
B i ( t ) = 4 7 - 7 18 x N ( t ) . - - - ( 19 )
CN2011103719889A 2011-11-21 2011-11-21 Efficient and fair dynamic spectrum allocation method Expired - Fee Related CN102404747B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2011103719889A CN102404747B (en) 2011-11-21 2011-11-21 Efficient and fair dynamic spectrum allocation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2011103719889A CN102404747B (en) 2011-11-21 2011-11-21 Efficient and fair dynamic spectrum allocation method

Publications (2)

Publication Number Publication Date
CN102404747A CN102404747A (en) 2012-04-04
CN102404747B true CN102404747B (en) 2013-12-11

Family

ID=45886428

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2011103719889A Expired - Fee Related CN102404747B (en) 2011-11-21 2011-11-21 Efficient and fair dynamic spectrum allocation method

Country Status (1)

Country Link
CN (1) CN102404747B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103002455B (en) * 2012-10-12 2016-08-03 陈宏滨 A kind of based on social networks and game theoretic cognitive radio frequency spectrum Share Model

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1917690A (en) * 2006-07-20 2007-02-21 西南交通大学 Method for assigning dynamic frequency spectrum of multiple radio system based on dynamic boundary of virtual frequency spectrum
CN101083825A (en) * 2006-05-30 2007-12-05 株式会社Ntt都科摩 Method and apparatus for distributing dynamic spectrum in coexistent plurality of wireless networks
CN102026201A (en) * 2010-12-15 2011-04-20 西安交通大学 Game type selection-based method for realizing dynamic spectrum allocation
CN102186174A (en) * 2011-04-22 2011-09-14 南京邮电大学 Cooperative spectrum sharing game method for cognitive radio system

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101083825A (en) * 2006-05-30 2007-12-05 株式会社Ntt都科摩 Method and apparatus for distributing dynamic spectrum in coexistent plurality of wireless networks
EP1863303A1 (en) * 2006-05-30 2007-12-05 NTT DoCoMo, Inc. Method and apparatus of dynamic spectrum allocation in coexisting heterogeneous wireless networks
CN1917690A (en) * 2006-07-20 2007-02-21 西南交通大学 Method for assigning dynamic frequency spectrum of multiple radio system based on dynamic boundary of virtual frequency spectrum
CN102026201A (en) * 2010-12-15 2011-04-20 西安交通大学 Game type selection-based method for realizing dynamic spectrum allocation
CN102186174A (en) * 2011-04-22 2011-09-14 南京邮电大学 Cooperative spectrum sharing game method for cognitive radio system

Also Published As

Publication number Publication date
CN102404747A (en) 2012-04-04

Similar Documents

Publication Publication Date Title
Bae et al. Sequential bandwidth and power auctions for distributed spectrum sharing
Song et al. Game-theoretic resource allocation methods for device-to-device communication
CN102438313B (en) Communication alliance dispatching method based on CR (cognitive radio)
CN103873146B (en) Resource regulating method in indoor distributed visible light communication system
CN101534510A (en) Method and system for sharing distributed frequency spectrum
CN102404747B (en) Efficient and fair dynamic spectrum allocation method
Kim Cellular network bandwidth management scheme by using nash bargaining solution
Huang et al. A hierarchical pseudonyms management approach for software-defined vehicular networks
Kaur et al. A reinforcement learning-based green resource allocation for heterogeneous services in cooperative cognitive radio networks
Varade et al. Throughput Maximization of Cognitive Radio Multi Relay Network with Interference Management.
CN106454849B (en) Cooperative cognitive wireless network high-energy-efficiency resource allocation method
Hao et al. Energy efficient based channel assignment game algorithm for wireless sensor network
Sharma et al. Implementing game theory in cognitive radio network for channel allocation: An overview
KR101161249B1 (en) Method of Managing bandwidth for cellular network system
Kurtz et al. Predictive 5G uplink slicing for blockchain-driven smart energy contracts
CN102711178A (en) Group association accepting control method based on user requirement and network load balancing
CN103442365A (en) Frequency reuse method for reducing interference of CoMP system in station
Parsapoor et al. Imperialist competitive algorithm for DSA in cognitive radio networks
CN109219069B (en) Energy distribution and pricing method of green backhaul network based on cooperation of multiple operators
Qin et al. A novel approach for spectrum mobility games with priority in cognitive radio networks
Kim A new cooperative dual-level game approach for operator-controlled multihop D2D communications
CN105578596A (en) Heterogeneous relay network resource allocation method based on in-cell coordinated multi-point transmission
Zhang et al. Energy efficient resource allocation in heterogeneous software defined network: A reverse combinatorial auction approach
CN104581965A (en) Spectrum allocation method based on user allocation and time delay
CN104660391B (en) Interference elimination method between distributing cell in orthogonal frequency-time multiple access network

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20131211

Termination date: 20181121

CF01 Termination of patent right due to non-payment of annual fee