CN104270768A - Spectrum sharing method based on Stackelberg game in cooperative cognitive wireless network - Google Patents

Spectrum sharing method based on Stackelberg game in cooperative cognitive wireless network Download PDF

Info

Publication number
CN104270768A
CN104270768A CN201410341384.3A CN201410341384A CN104270768A CN 104270768 A CN104270768 A CN 104270768A CN 201410341384 A CN201410341384 A CN 201410341384A CN 104270768 A CN104270768 A CN 104270768A
Authority
CN
China
Prior art keywords
user
primary user
cognitive
primary
transmission
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201410341384.3A
Other languages
Chinese (zh)
Other versions
CN104270768B (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.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
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 Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN201410341384.3A priority Critical patent/CN104270768B/en
Publication of CN104270768A publication Critical patent/CN104270768A/en
Application granted granted Critical
Publication of CN104270768B publication Critical patent/CN104270768B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W16/00Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/14Spectrum sharing arrangements between different networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a spectrum sharing method based on a Stackelberg game in a cooperative cognitive wireless network. The spectrum sharing method comprises the following steps of an information acquisition stage, a game stage and a data transmission stage. According to the spectrum sharing method, master and slave characteristics of primary and secondary users in a cognitive radio network are combined, a two-stage Stackelberg game model with the primary user is taken as a leader and a plurality of non-cooperative cognitive transmission users as subordinates is introduced into the spectrum sharing. Limited energy of the primary user is considered, when the primary user is at different energy levels, the primary user has different care degrees of dissipated energy of data transmission, so that a decision of the primary user in a spectrum sharing process is influenced. By adopting a two-stage frequency division multiple access (FDMA) cooperative forwarding manner, continuity of communication of a cognitive user is guaranteed, and spectrum resources are distributed through dynamic game to play a better incentive effect on the cognitive user. Requirement on maximizing effectiveness of the primary user and the secondary users is fully considered, a win-win situation of the primary user and the secondary users is achieved, and the spectral utilization rate is improved.

Description

Based on the frequency spectrum sharing method of Stark Burger game in cooperative cognitive wireless network
Technical field
The invention belongs to cognitive radio networks communication technical field, particularly based on the primary and secondary cooperation among users spectrum sharing mechanisms of Stark Burger game.
Background technology
Along with the develop rapidly of wireless communication technology, increasing wireless device and application are widely used, people to the demand of frequency spectrum get more and more, cause available Radio Spectrum Resource growing tension, frequency spectrum scarcity problem oneself become the bottleneck realizing wireless communication technology sustainable development.What existing frequency spectrum resource allocation method adopted is static spectral allocation strategy, and be divided into by frequency spectrum resource and authorize frequency range and a small amount of unauthorized frequency range, the user being assigned to frequency spectrum is called authorized user, and the user not being assigned to frequency spectrum is called unauthorized user.In mandate frequency range, authorized user specially enjoys the frequency spectrum that it is assigned to, and other user can not share with it.And the unallocated unauthorized user to frequency spectrum can only go to compete unlicensed spectrum in short supply on a small quantity in mandate frequency range.FCC (FCC) carries out a large amount of investigation to the service condition of each frequency range and finds, due to authorized user over time and space to frequency spectrum use discontinuous, what the frequency spectrum resource distributed is occurred to a certain degree is idle, and overall utilization ratio only has 15%-85%.In order to solve the low problem of the availability of frequency spectrum, design a kind of can dynamic sensing and accurately accessing not being necessary by the technology of the authorization channel used.Cognitive radio (CR, Cognitive Radio) technology is arisen at the historic moment, and has become in next generation network the key technology improving radio spectrum resources utilance.In cognitive radio networks, have and authorize the user of frequency spectrum to be called primary user (PU, primary user), and the user of with no authorized frequency spectrum is called cognitive user (SU, secondary user).
In conventional cognitive radio network, cognitive user is by the frequency spectrum service condition opportunistic of real-time perception primary user ground access idle frequency spectrum, because the time variation of usable spectrum in cognitive radio networks, diversity and otherness make frequency spectrum perception technology there is high dynamic and complexity.Meanwhile, cognitive user must exit immediately when primary user returns, and frequency spectrum is given back primary user, causes the communication quality of cognitive user can not be guaranteed like this.Comparatively speaking primary user has spectrum management power, according to the situation of self, untapped frequency spectrum can be leased to cognitive user to use, the spectrum management mode therefrom collecting definite remuneration is more simple in the realization of technology, the communication performance that primary user is raising oneself cognitive user please assist its transmission data, as return, the frequency spectrum share mode that a part of frequency spectrum of oneself is leased to cognitive user use by primary user has attracted the extensive concern of academia and industry.
In recent years, achievement in research about cooperative cognitive radio net frequency spectrum share is a lot, at document H.B.Wang, L.Gao, X.Y.Gan, X.B.Wang, E.Hossain.Cooperative spectrum sharing in cognitive radio networks:A game-theoretic approach.In Proceedings of IEEE International Conference on Communications, IEEE, Cape Town, South Africa, pp.23 – 27, in 2010., author considers the frequency spectrum share problem between a primary user and multiple cognitive user, primary user assists its transmission data by the multiple cognitive user choosing applicable condition, as return primary user, a part of spectrum allocation may of oneself is transmitted the data of oneself to cognitive user.The utility function of primary user for maximizing its transmission rate, the utility function of cognitive user not only with its transmission rate about also relevant for transmitting consumed energy with it.Each cognitive user is assigned to and uses the done contribution that cooperates with it of the time of PU frequency spectrum to be directly proportional, and ensure that the fairness between cognitive user, plays good incentive action to cognitive user.But under not considering different-energy level primary user on self transmission institute consumed energy on the impact of its network utility.Document B.Cao, J.W.Mark, Q.Zhang, R.Lu, X.Lin, and S.Shen, " On optimal communication strategies for cooperative cognitive radio networking; " in Proc.IEEE INFOCOM, under several different repetition policy of Apr.2013. author investigation primary user's different-energy level and power consumption under impact on network utility.In the program, cognitive user is by a secondary access point centralized control, the success of scheme is that to be based upon secondary access point to all cognitive user be all on fair basis, and the frequency spectrum resource of primary user distributes employing fixed allocation mode in the program, namely the time slot shared by each stage of communication, the number of stages needed for repetition policy carries out uniform distribution.This is inefficient, is also irrational simultaneously, because cognitive user can only remove the frequency spectrum resource competing fixed allocation, the effectiveness of cognitive user will be very restricted, thus is also just unfavorable for that excitation cognitive user participates in cooperation better.Meanwhile, in above-mentioned two schemes, cognitive user all can only could access the data of spectrum transmissions oneself after primary user completes transfer of data, and the continuity of cognitive user communication can not get ensureing.
Summary of the invention
For above deficiency of the prior art, the object of the present invention is to provide a kind of communication quality ensureing primary user, raising network spectrum utilance.Technical scheme of the present invention is as follows: based on the frequency spectrum sharing method of Stark Burger game in cooperative cognitive wireless network, the master network of described cooperative cognitive wireless network is the infrastructure network be made up of a multiple primary user PU and base station BS, primary user PU communicates with base station BS in TDMA mode, the time slot that base station BS distributes to each primary user PU is T, suppose that the spectral bandwidth of each primary user is W, cognition network comprises N number of cognition and sends user ST i(i=1,2 ..., N) and cognitive reception user SR iright.Comprise the following steps:
101, the frequency spectrum share between primary user PU and secondary user is adopted two benches FDMA cooperation pass-through mode, the sub-band that the frequency spectrum of oneself is divided into τ W and (1-τ) W two mutually orthogonal by primary user PU;
102, base station BS estimates the channel gain G of link between primary user PU and base station BS respectively pBand cognitive transmission user ST iand the channel gain of link between base station BS cognitive transmission user ST iestimate that primary user PU sends user ST with cognitive ibetween the channel gain of link cognitive reception user SR iestimate cognitive transmission user ST iuser SR is received with cognition ibetween the channel gain of link and the channel gain G that will estimate pB, channel gain channel gain and channel gain be transmitted to primary user PU;
103, set up with the primary user PU person of taking as the leading factor, multiple noncooperative cognition sends the two-stage Stark Burger betting model that user STs is subordinate.First the utility function of primary user PU is set up U P = U PD = R PD - I ( E P 0 ) E PD U PC = R PC - I ( E P 0 ) E PC - - - ( 1 ) , Wherein, U pD, U pCprimary user PU respectively in the effectiveness direct transferred and obtain under cooperation mode, R pDthe throughput that PU direct transfers, E pDbe PU direct transfer consume energy, R pCfor the throughput under PU cooperation mode, E pCfor PU transmits the energy of consumption under cooperation mode, I (E p0) be that the existing energy level of PU catabioticly takes notice of degree function to PU transmission; Then cognitive transmission user ST is set up iutility function be: wherein for ST ithe throughput obtained, for ST ifor PU transmits the unit cost of data consumes energy, for ST ihelp the energy that PU forwarding data consumes.Adopt Stark Burger game method to carry out game to (1) and (2), PU estimates optimum spectrum allocation may coefficient τ *with optimal transmission power if τ *=1, primary user does not lease the information of frequency spectrum to all cognitive user broadcast, otherwise primary user will be broadcast to all cognitions and send user, primary user selects to make the maximized cognition of its utility function send user's collection as relay node user, primary user feeds back a reference information to all relay node user, and each selected cognition sends user according to the through-put power of reference information calculating oneself for cooperating
104, when primary user selects the mode that direct transfers, primary user uses the whole frequency spectrum resources of oneself to transmit data, and cognitive transmission user does not help primary user to transmit data, and cognitive transmission user is because unsuccessful lease, to frequency spectrum, also just can not transmit the data of oneself simultaneously; If when primary user selects cooperation mode, primary user is with cognitive to send user at first sub-band and bandwidth be τ *the data of the upper cooperation transmission primary user of W, each cognition transmission user being selected as relaying is (1-τ at second sub-band and bandwidth *) the upper data transmitting oneself in the mode of OFDM in the frequency range distributing to it of W.
Described transmission is catabiotic takes notice of degree function I (E p0) expression formula be:
I ( E P 0 ) = exp - ( E P th - E P 0 ) 10 0 < E P 0 < E P th 0 E P 0 &GreaterEqual; E P th
Wherein, E p0for the existing energy of PU, for the critical value of the existing energy level of PU.
Advantage of the present invention and beneficial effect as follows:
The present invention considers under primary user's different-energy level and takes notice of on transmission is catabiotic the impact that degree is brought its network utility, the dynamic assignment problem of bandwidth between the continuity of oneself data of cognitive user transmission and primary and secondary user.Take into full account that primary and secondary user maximizes the demand of oneself effectiveness, excite primary and secondary user to participate in the enthusiasm come in cooperation, ensure the communication quality of primary user, improve network spectrum utilance.Adopt two benches FDMA cooperation pass-through mode, ensure that the continuity that cognitive user communicates, frequency spectrum adopts dynamic assignment, excites cognitive user to participate in cooperation better simultaneously.Realize the maximization of primary and secondary user utility, reach the situation of " doulbe-sides' victory ", network spectrum efficiency is further improved.
Accompanying drawing explanation
Figure 1 shows that system model and the spectrum allocation may figure of preferred embodiment of the present invention cooperative cognitive radio net;
Fig. 2 is the relay selection algorithm in the present invention;
Fig. 3 is the game flow chart realizing frequency spectrum share in the present invention;
Fig. 4 is flow stages general diagram of the present invention.
Embodiment
The invention will be further elaborated to provide an infinite embodiment below in conjunction with accompanying drawing.But should be appreciated that, these describe just example, and do not really want to limit the scope of the invention.In addition, in the following description, the description to known features and technology is eliminated, to avoid unnecessarily obscuring concept of the present invention.
General thought of the present invention is: do not have in the cognitive radio networks of central control unit at cognition network, introduce the existing energy level function of primary user, this function characterizes primary user and is under different-energy level that transmission is catabiotic takes notice of degree to it, to transmission institute is catabiotic, more its of the existing energy of primary user takes notice of that degree is lower, otherwise, then higher.The division of frequency spectrum resource adopts FDMA mode, the spectrum division of oneself is two orthogonal sub-bands by primary user, first sub-band is used for primary user's communication under cognitive user cooperation, second subband allocation is used for the communication of oneself to cognitive user, and the bandwidth of two sub-bands is by primary user and cognitively to send between user by game by primary user's dynamic assignment.Particularly, as follows:
1, network model and hypothesis
As shown in Figure 1, suppose the infrastructure network that master network is made up of with a base station (BS) multiple primary user (PUs), PUs is with TDMA mode and base station communication, and the time slot that base station distributes to each primary user is T, supposes that the spectral bandwidth of each primary user is W.Cognition network is right with reception to cognitive user foundation transmission by N the distributed network of composition.Between primary and secondary user, frequency spectrum share adopts the pass-through mode of two benches FDMA: the sub-band that the frequency spectrum of oneself is divided into τ W and (1-τ) W two mutually orthogonal by primary user, τ W frequency range is for completing the transfer of data of primary user, and (1-τ) W frequency allocation sends the data of oneself to cognitive transmission user.Cognitive transmission user takes amplification forwarding (AF, Amplifier-and-forward) mode helps primary user's forwarding data, before τ W frequency range, 0.5T time slot primary user is to the data of the cognitive user and base station broadcast oneself that are selected as relaying, and rear 0.5T time slot primary user and relaying cognitive user send the data of primary user to base station.Suppose that channel information is constant in each time slot T.PU and BS, ST iand the channel gain G of link between BS pBwith estimate by BS, PU and ST ibetween the channel gain of link by ST iestimate, ST iwith SR ibetween the channel gain of link by SR iestimate.Suppose there is a Common Control Channel in network, the channel gain of each link sends to PU by common signal channel, PU and ST in gambling process ibetween information feed back also by this channel transfer.Interchannel noise is white Gaussian noise, and noise power is δ 2.
2, targeted yield function
As shown in Figure 2,3, set up with the PU person of taking as the leading factor, multiple noncooperative cognition sends the two-stage Stark Burger betting model that user STs is subordinate.The strategy of PU is that the great through-put power of selection and the frequency spectrum resource how distributing oneself make oneself network utility maximize, each ST istrategy be select great power to help PU to transmit data to make the network utility of oneself reach maximum.
1) utility function of PU is defined:
U P = U PD = R PD - I ( E P 0 ) E PD U PC = R PC - I ( E P 0 ) E PC - - - ( 1 )
Wherein, U pD, U pCprimary user PU respectively in the effectiveness direct transferred and obtain under cooperation mode, R pDthe throughput that PU direct transfers, E pDbe PU direct transfer consume energy, R PC = 1 2 &tau;W log 2 ( 1 + P PC P PB &delta; 2 + &Sigma; i &Element; s P PC P S i C G PS i G S i P &delta; 2 ( P PC G PS i + P S i P G S i P + &delta; 2 ) ) For the throughput that PU selects cooperation mode to obtain, P pCfor the through-put power under PU cooperation mode, for ST ihelp the through-put power of PU forwarding data, E pCfor PU transmits the energy of consumption under cooperation mode, I (E p0) be to PU transmission is catabiotic, the existing energy level of PU takes notice of that degree function is the throughput that PU cooperation mode obtains, S is the set of STs participating in cooperation.E pC=τ WTP pCfor PU transmits the energy of consumption under cooperation mode.I (E p0) be that the existing energy level of PU catabioticly takes notice of degree function to PU transmission
I ( E P 0 ) = exp - ( E P th - E P 0 ) 10 0 < E P 0 < E P th 0 E P 0 &GreaterEqual; E P th
Wherein, E p0for the existing energy of PU, for the critical value of the existing energy level of PU.
The strategy of PU is that the great transmitted power of selection and the frequency spectrum resource how distributing oneself make oneself network utility maximize, namely
max &tau; , P PD / P PC U P - - - ( 2 )
s.t.0<τ<1
R PD , R PC &GreaterEqual; R P th
0 < P PD , P PC &le; P P max
Wherein for PU wishes the minimum throughout that reaches, for the maximum transmission power of PU.
2) defined cognitive user ST iutility function be:
U S i = R S i S - c S i E S i C - - - ( 3 )
Wherein R S i S = W S i log 2 ( 1 + G S i S P S i S &delta; 2 ) For ST ithe throughput obtained, W S i = ( 1 - &tau; ) W P S i C &Sigma; i &Element; S P S i C For ST ithe spectral bandwidth be assigned to, for ST itransmit the transmitted power of oneself data. for ST ifor PU transmits the unit cost of data consumes energy, for ST ihelp the energy that PU forwarding data consumes.
ST istrategy be select great power to help PU to transmit data to make the network utility of oneself reach maximum, that is:
max P S i C U S i - - - ( 4 )
s . t . P S i C > 0
3, game theory analysis
1) cognitive transmission user optimal policy
First (3) formula is to P sICdifferentiate obtains
&PartialD; U S i &PartialD; P S i C = ( 1 - &tau; ) W &Sigma; j &Element; S , i &NotEqual; j P S j C ( &Sigma; j &Element; S P S j C ) 2 log 2 ( 1 + G S i S P S i S &delta; 2 ) - 1 2 c S i &tau;WT - - - ( 5 )
When reaching optimal solution, (5) formula equals 0, obtains
P S i C * = 2 ( 1 - &tau; ) ( N SC - 1 ) c S i &tau; A 2 ( A - N SC - 1 C S i ) - - - ( 6 )
Wherein n sCfor participating in the STs number of cooperation.ST ithe condition whether participation cooperates is:
A > N SC - 1 C S i - - - ( 7 )
2) primary user's optimal policy
1. primary user's optimal policy under the mode that direct transfers
First (1) formula is to P pDdifferentiate obtains:
&PartialD; U PD &PartialD; P PD = WG PB ln 2 ( 1 + P PD G PB &delta; 2 ) &delta; 2 - WTI ( E P 0 ) - - - ( 8 )
When reaching optimal solution, (8) formula equals 0, obtains:
P PD * = P P max I ( E P 0 ) = 0 min { max ( G PB &delta; 2 - ln 2 I ( E P 0 ) ln 2 I ( E P 0 ) G PB &delta; 2 , e xp R P th - 1 G PB &delta; 2 ) , P P max } I ( E P 0 ) &NotEqual; 0 - - - ( 9 )
2. primary user's optimal policy under cooperation mode
First (1) formula is to P pCdifferentiate obtains:
&PartialD; U PC &PartialD; P PC = 1 2 &tau;W G PB &delta; 2 + &Sigma; i &Element; S P S i P G PS i G S i P &delta; 2 ( P S i P G S i P + &delta; 2 ) [ &delta; 2 ( P PC G PS i + P S i P G S i P + &delta; 2 ) ] 2 ln 2 B - I ( E P 0 ) &tau;WT - - - ( 10 )
Wherein when reaching optimal solution, (10) formula equals 0, obtains:
P PC * = P P bud I ( E P 0 ) = 0 min ( P PC * &prime; , P P bud ) I ( E P 0 ) &NotEqual; 0 - - - ( 11 )
Wherein represent I (E p0the solution that during) ≠ 0, (10) equal 0.(6) and (11) are substituted into U pC, U pCcan obtain τ differentiate
&PartialD; U PC &PartialD; &tau; = 1 2 WD + 1 2 &tau;W &PartialD; D &PartialD; &tau; - I ( E P 0 ) WTP PC * - I ( E P 0 ) &tau;WT &PartialD; P PC * &PartialD; &tau; - - - ( 12 )
Wherein D = log 2 ( 1 + P PC * G PB &delta; 2 + &Sigma; i &Element; S P PC * P S i P * G PS i G S i P &delta; 2 ( P PC * G PS i + P S i P * G S i P + &delta; 2 ) ) , When (12) equal 0, τ obtains optimum τ *.
These embodiments are interpreted as only being not used in for illustration of the present invention limiting the scope of the invention above.After the content of reading record of the present invention, technical staff can make various changes or modifications the present invention, and these equivalence changes and modification fall into the inventive method claim limited range equally.

Claims (2)

1. in cooperative cognitive wireless network based on the frequency spectrum sharing method of Stark Burger game, the master network of described cooperative cognitive wireless network is the infrastructure network be made up of a multiple primary user PU and base station BS, primary user PU communicates with base station BS with time division multiple access access way, the time slot that base station BS distributes to each primary user PU is T, suppose that the spectral bandwidth of each primary user is W, cognition network comprises N number of cognition and sends user ST i(i=1,2 ..., N) and cognitive reception user SR iright, it is characterized in that, comprise the following steps:
101, the frequency spectrum share between primary user PU and secondary user is adopted two benches FDMA cooperation pass-through mode, the sub-band that the frequency spectrum of oneself is divided into τ W and (1-τ) W two mutually orthogonal by primary user PU;
102, base station BS estimates the channel gain G of link between primary user PU and base station BS respectively pBand cognitive transmission user ST iand the channel gain of link between base station BS cognitive transmission user ST iestimate that primary user PU sends user ST with cognitive ibetween the channel gain of link cognitive reception user SR iestimate cognitive transmission user ST iuser SR is received with cognition ibetween the channel gain of link and the channel gain G that will estimate pB, channel gain channel gain and channel gain be transmitted to primary user PU;
103, set up with the primary user PU person of taking as the leading factor, multiple noncooperative cognition sends the two-stage Stark Burger betting model that user STs is subordinate, first sets up the utility function of primary user PU U P = U PD = R PD - I ( E P 0 ) E PD U PC = R PC - I ( E P 0 ) E PC - - - ( 1 ) , Wherein, U pD, U pCprimary user PU respectively in the effectiveness direct transferred and obtain under cooperation mode, R pDthe throughput that PU direct transfers, E pDbe PU direct transfer consume energy, R pCfor the throughput under PU cooperation mode, E pCfor PU transmits the energy of consumption under cooperation mode, I (E p0) be that the existing energy level of PU catabioticly takes notice of degree function to PU transmission; Then cognitive transmission user ST is set up iutility function be: wherein for ST ithe throughput obtained, for ST ifor PU transmits the unit cost of data consumes energy, for ST ihelp the energy that PU forwarding data consumes, adopt Stark Burger game method to carry out game to (1) and (2), PU estimates optimum spectrum allocation may coefficient τ *with optimal transmission power if τ *=1, primary user does not lease the information of frequency spectrum to all cognitive user broadcast, otherwise primary user is by τ *, be broadcast to all cognitions and send user, primary user selects to make the maximized cognition of its utility function send user's collection as relay node user, primary user feeds back a reference information to all relay node user, and each selected cognition sends user according to the through-put power of reference information calculating oneself for cooperating
104, when primary user selects the mode that direct transfers, primary user uses the whole frequency spectrum resources of oneself to transmit data, and cognitive transmission user does not help primary user to transmit data, and cognitive transmission user is because unsuccessful lease, to frequency spectrum, also just can not transmit the data of oneself simultaneously; If when primary user selects cooperation mode, primary user is with cognitive to send user at first sub-band and bandwidth be τ *the data of the upper cooperation transmission primary user of W, each cognition transmission user being selected as relaying is (1-τ at second sub-band and bandwidth *) the upper data transmitting oneself in the mode of OFDM in the frequency range distributing to it of W.
2. in cooperative cognitive wireless network according to claim 1 based on the frequency spectrum sharing method of Stark Burger game, it is characterized in that: described transmission is catabiotic takes notice of degree function I (E p0) expression formula be:
I ( E P 0 ) = exp - ( E P th - E P 0 ) 10 0 < E P 0 < E P th 0 E P 0 &GreaterEqual; E P th
Wherein, E p0for the existing energy of PU, for the critical value of the existing energy level of PU.
CN201410341384.3A 2014-07-17 2014-07-17 Frequency spectrum sharing method based on Stark Burger game in cooperative cognitive wireless network Active CN104270768B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410341384.3A CN104270768B (en) 2014-07-17 2014-07-17 Frequency spectrum sharing method based on Stark Burger game in cooperative cognitive wireless network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410341384.3A CN104270768B (en) 2014-07-17 2014-07-17 Frequency spectrum sharing method based on Stark Burger game in cooperative cognitive wireless network

Publications (2)

Publication Number Publication Date
CN104270768A true CN104270768A (en) 2015-01-07
CN104270768B CN104270768B (en) 2017-07-25

Family

ID=52162235

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410341384.3A Active CN104270768B (en) 2014-07-17 2014-07-17 Frequency spectrum sharing method based on Stark Burger game in cooperative cognitive wireless network

Country Status (1)

Country Link
CN (1) CN104270768B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106454849A (en) * 2016-10-08 2017-02-22 重庆大学 High-energy efficiency resource allocation method for cooperative cognitive radio network
CN108055670A (en) * 2017-11-13 2018-05-18 南京邮电大学 Bandwidth dynamic optimization method based on matching game
CN109413659A (en) * 2018-10-12 2019-03-01 西北工业大学 A kind of frequency spectrum leasing method of cognitive radio networks
CN110475289A (en) * 2018-05-10 2019-11-19 中国信息通信研究院 A kind of load-balancing method and system towards super-intensive networking
CN111314861A (en) * 2020-02-17 2020-06-19 南京邮电大学 Auction game based relay network bandwidth allocation method in congestion network

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101964982A (en) * 2010-10-22 2011-02-02 哈尔滨工业大学深圳研究生院 Cognitive radio frequency spectrum sharing method and system
CN102307355A (en) * 2011-09-02 2012-01-04 西瑞克斯(北京)通信设备有限公司 Frequency spectrum renting method based on wireless cooperative communication
CN102413473A (en) * 2011-11-01 2012-04-11 东南大学 Cooperative game-based frequency spectrum allocation method in cognitive sensor network cluster
CN103281703A (en) * 2013-06-18 2013-09-04 重庆邮电大学 Cognitive radio network spectrum allocation method based on game theory

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101964982A (en) * 2010-10-22 2011-02-02 哈尔滨工业大学深圳研究生院 Cognitive radio frequency spectrum sharing method and system
CN102307355A (en) * 2011-09-02 2012-01-04 西瑞克斯(北京)通信设备有限公司 Frequency spectrum renting method based on wireless cooperative communication
CN102413473A (en) * 2011-11-01 2012-04-11 东南大学 Cooperative game-based frequency spectrum allocation method in cognitive sensor network cluster
CN103281703A (en) * 2013-06-18 2013-09-04 重庆邮电大学 Cognitive radio network spectrum allocation method based on game theory

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
洪浩然: "基于博弈论的认知网络频谱共享研究", 《中国博士学位论文全文数据库 信息科技辑》 *

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106454849A (en) * 2016-10-08 2017-02-22 重庆大学 High-energy efficiency resource allocation method for cooperative cognitive radio network
CN108055670A (en) * 2017-11-13 2018-05-18 南京邮电大学 Bandwidth dynamic optimization method based on matching game
CN108055670B (en) * 2017-11-13 2020-10-23 南京邮电大学 Bandwidth dynamic optimization method based on matching game
CN110475289A (en) * 2018-05-10 2019-11-19 中国信息通信研究院 A kind of load-balancing method and system towards super-intensive networking
CN110475289B (en) * 2018-05-10 2023-12-01 中国信息通信研究院 Load balancing method and system for ultra-dense networking
CN109413659A (en) * 2018-10-12 2019-03-01 西北工业大学 A kind of frequency spectrum leasing method of cognitive radio networks
CN109413659B (en) * 2018-10-12 2019-07-12 西北工业大学 A kind of frequency spectrum leasing method of cognitive radio networks
CN111314861A (en) * 2020-02-17 2020-06-19 南京邮电大学 Auction game based relay network bandwidth allocation method in congestion network

Also Published As

Publication number Publication date
CN104270768B (en) 2017-07-25

Similar Documents

Publication Publication Date Title
CN103260166B (en) Distributed cognition wireless network is based on the frequency spectrum distributing method of Game with Coalitions
CN104270768A (en) Spectrum sharing method based on Stackelberg game in cooperative cognitive wireless network
CA3010259A1 (en) Apparatus and method for prioritization of random access in a multi-user wireless communication system
CN109644447A (en) Communication device and communication means
CN103313260B (en) A kind of based on game theoretic cognitive radio networks bandwidth, power combined allocation method
CN106255034B (en) A kind of high energy efficiency content distribution method based on D2D
CN105517167B (en) A kind of method for managing resource towards interference alignment in intensive isomery cellular network
CN104702396A (en) Joint resource allocation method for collaboration multi-relay cognitive system based on effectiveness
CN102413473A (en) Cooperative game-based frequency spectrum allocation method in cognitive sensor network cluster
Fan et al. The capacity of device-to-device communication underlaying cellular networks with relay links
Hao et al. A Stackelberg game for cooperative transmission and random access in cognitive radio networks
CN103929819A (en) Cognitive radio network slave user combination price-fixing and resource distributing method
CN103079278A (en) Method for allocating downlink resources of OFDMA (Orthogonal Frequency Division Multiple Access)-WLAN (Wireless Local Area Network) system based on user satisfaction degrees
Chang et al. Collaborative mobile clouds: An energy efficient paradigm for content sharing
Pan et al. On the performance analysis and relay algorithm design in social-aware D2D cooperated communications
CN104796900A (en) Cellular network D2D (device-to-device) communication resource distributing method based on auction theory
CN106162847B (en) A kind of frequency spectrum share energy consumption optimization method based on multi-user and multi-channel perception
CN106658736A (en) LTE technology-based resource allocation method for uplink of internet of things
CN102740305B (en) A kind of method and device of selection time user terminal
CN104105208B (en) A kind of co-channel full duplex dispatching method and device
CN104540203A (en) Performance optimizing method for wireless body area network based on independent sets
CN102938900A (en) Femtocell dynamic service quality control system and method
Chen et al. Spectrum resource management and access mode selection in D2D-enabled vehicular networks
US9307482B2 (en) Network access mechanism based on power
Mach et al. Incentive mechanism and relay selection for D2D relaying in cellular networks

Legal Events

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