CN109361482A - A method of determining that multi-user selects channel-aware sequence based on non-cooperative game - Google Patents
A method of determining that multi-user selects channel-aware sequence based on non-cooperative game Download PDFInfo
- Publication number
- CN109361482A CN109361482A CN201811027106.5A CN201811027106A CN109361482A CN 109361482 A CN109361482 A CN 109361482A CN 201811027106 A CN201811027106 A CN 201811027106A CN 109361482 A CN109361482 A CN 109361482A
- Authority
- CN
- China
- Prior art keywords
- channel
- user
- aware
- sequence
- cooperative game
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B17/00—Monitoring; Testing
- H04B17/30—Monitoring; Testing of propagation channels
- H04B17/382—Monitoring; Testing of propagation channels for resource allocation, admission control or handover
Abstract
A method of determining that multi-user selects channel-aware sequence based on non-cooperative game, cognitive user selects different channel-aware sequences to influence whether the contention access to idle channel from each other, needs to reach the smallest result of global channel competition conflict by the non-cooperative game process between all user's individuals of the whole network.The present invention constructs the problem of multi-user selects channel-aware sequence under multichannel scene using non-cooperative game mathematical model, the sequentially corresponding regret value of channel-aware by calculating current time t user n selection selects the probability of certain channel-aware sequence come recurrence calculation subsequent time user, compare each user of the whole network and select whether the probability of a certain channel-aware order policies converges to a fixed thresholding λ, to terminate iteration.The present invention can quickly determine the whole network multi-user and select a kind of suitable channel-aware sequence, reduce the accumulation Conflict Level of the whole network.
Description
Technical field
The invention belongs to frequency spectrum perception multi-user competitive channel policy techniques field, especially one kind in wirelessly communicating to be based on
Non-cooperative game determines the method that multi-user selects channel-aware sequence.
Background technique
Spectrum requirement sharp increase and the inefficient utilization growth-promoting opportunistic spectrum access technology (Opportunistic of certain frequency ranges
Spectrum Access, OSA), opportunistic spectrum access needs the reconfigurable network equipment, referred to as cognitive radio
(CR) equipment, it can stimulate to change behavior according to its respective environment.Therefore, these cognitive devices or cognitive user
(Secondary User, SU) needs to ensure by frequency spectrum detection to be not take up when primary user (Primary User, PU) is enlivened
The frequency range avoids interfering primary user, it can be seen that opportunistic spectrum access technology more efficient can utilize authorization frequency spectrum.
In opportunistic spectrum access, user uses slot transmission mode.The first stage of each time slot is used to perceive letter by secondary user's
Road, second stage are used to access idle channel.However, when multiple cognitive users need to access available channel, from each other
It will collide.
Whether cognitive user selects channel-aware sequence being capable of successful contention to other cognitive users in single time slot
It is had an impact to idle channel, and then determines the accumulation Conflict Level of the whole network；And each cognitive user be it is greedy, all think maximum
Change the effectiveness of itself, therefore the present invention is modeled as non-cooperative game model, i.e. multiuser channel perceives sequential selection game,
And the broad sense conflict function of user is defined, and then multi-user is constructed under multichannel scene using non-cooperative game mathematical model
It is rich to give channel-aware sequential selection of the multi-user under multichannel scene for the mathematical model for selecting channel-aware sequencing problem
A kind of iteration Recursive Solution method of model optimal solution is played chess, can quickly determine that the whole network multi-user selects a kind of suitable channel sense
Know sequence, reduces the accumulation Conflict Level of the whole network.
Summary of the invention
The purpose of the present invention is select different channel-aware sequences to influence whether to sky from each other for cognitive user
The contention access of idle channel needs to reach global channel competition punching by the non-cooperative game process between all user's individuals of the whole network
The problem of the smallest result of dashing forward.The present invention is constructed multi-user using non-cooperative game mathematical model and selected under multichannel scene
Channel-aware sequencing problem, by calculating the corresponding regret value of channel-aware sequence of current time t user n selection come recursion meter
The user for calculating subsequent time selects the probability of certain channel-aware sequenceThen compare each user's selection in the whole network
Whether the probability of a certain channel-aware order policies converges to a fixed thresholding λ, to terminate iteration.The present invention provides
A kind of iteration Recursive Solution method of channel-aware sequential selection betting model optimal solution of the multi-user under multichannel scene,
It can quickly determine that the whole network multi-user selects a kind of suitable channel-aware sequence, reduce the accumulation Conflict Level of the whole network.
The technical scheme is that
A method of determining that multi-user selects channel-aware sequence based on non-cooperative game, steps are as follows:
Step 1, building multi-user select the non-cooperative game model of channel-aware sequencing problem under multichannel scene；
Step 2, the perception order policies selection initialization of the whole network subscriber channel, each user n in network is from channel-aware
With random chance in the policy space LS of sequenceSelect a channel-aware sequence Qn；
Step 3, the corresponding regret value of channel-aware sequence selected by calculating current time t user n are come recurrence calculation
Subsequent time user selects the probability of certain channel-aware sequenceT=1,2,3...... ∞；
Whether step 4, the probability for comparing each a certain channel-aware sequence of user's selection in the whole network converge to one admittedly
Fixed thresholding λ, if it is the loop iteration of end step 3, exports the channel-aware sequential selection probability of all users of the whole network.
Further, in step 1, non-cooperative game model construction step are as follows:
Multi-user and multi-channel system, including N number of cognitive user, M communication channel are constructed, note cognitive user collection is combined intoChannel set is
The non-cooperative game model of building is as follows:
Wherein: QnIndicate the channel-aware order policies of user n selection, Q-nIndicate that other users select in addition to user n
Channel-aware order policies；Qn∈ LS, LS are the policy space of M channel-aware sequence composition；Qn=(qn1,qn2,...,
qnM) and Qk=(qk1,qk2,...,qkM) be respectively user n and user k channel-aware sequence, UnFor the effectiveness of cognitive user n
Function is expressed using following formula:
Wherein,lIndicate the number of communication channel,It is an exclusive or symbol,It is channel q in user's n channel-aware sequencenl
Idle probability, PfIt is probability of false detection, δ is indicator function, meets:
Wherein dnkFor the actual range between cognitive user n and k, d0For interference distance threshold value.
Further, channel indexes arrangement regulation meets Latin square matrix form Latin Square in LS set, i.e., often
A channel indexes only occur primary in every a line of matrix and each column.
Further, in step 2, the whole network subscriber channel perceives order policies selection initialization specifically: when setting starting
T=0, each user n in network are carved,With random chance from the policy space LS of channel-aware sequence
Select a kind of channel-aware sequence Qn, wherein Qn∈LS。
Further, step 3 detailed process are as follows:
Choose the different channel-aware order policies Q of any twonAnd Q'n, Qn、Q'n∈ LS calculates a period of time length T
Interior each user n selects QnStrategy is all with Q'nThe regret value that strategy replaces
Wherein,Indicate that user n selects Q every time in a period of time length T before the t=T momentnPlan
Slightly all with Q'nStrategy replaces the sum of brought income change value to be averaged again；
Calculate the probability that user n selects each channel-aware order policies at subsequent time (t+1)；
Wherein, μ is a sufficiently large integer to guaranteeT=1,2,3...... ∞.
Further, step 4 specifically: setting convergence threshold λ determines the channel-aware sequence of T moment user n selection
Whether probability is greater than thresholding λ, whenWhen being unsatisfactory for, continue iteration, executes step 3；If it is satisfied, then terminating step
3 loop iteration exports the channel-aware sequential selection probability of all users of the whole network.
Further, λ value range is: 0.8~0.99.
Beneficial effects of the present invention:
Compared with existing channel-aware sequential selection technology, remarkable advantage is the present invention: (1) passing through building multi-user
The non-cooperative game model that channel-aware sequencing problem is selected under multichannel scene, can reduce the whole network user from global angle
Between accumulate Conflict Level；(2) it is optimal to give channel-aware sequential selection betting model of the multi-user under multichannel scene
A kind of iteration Recursive Solution method of solution, the algorithm can converge to correlated equilibrium quickly, and the number of iterations is few.
Other features and advantages of the present invention will then part of the detailed description can be specified.
Detailed description of the invention
Exemplary embodiment of the invention is described in more detail in conjunction with the accompanying drawings, it is of the invention above-mentioned and its
Its purpose, feature and advantage will be apparent, wherein in exemplary embodiment of the invention, identical reference label
Typically represent same parts.
Fig. 1 is to determine that multi-user selects the flow diagram of channel-aware sequence the present invention is based on non-cooperative game.
Latin square when Fig. 2 is number of channel M=3 of the present invention.
Fig. 3 is performance comparison between the gambling process that the present invention provides and random selection channel-aware sequence.
Specific embodiment
The preferred embodiment that the present invention will be described in more detail below with reference to accompanying drawings.Although showing the present invention in attached drawing
Preferred embodiment, however, it is to be appreciated that may be realized in various forms the present invention without the embodiment party that should be illustrated here
Formula is limited.
In conjunction with Fig. 1, the present invention is based on non-cooperative games to determine that multi-user selects the principle of channel-aware sequential grammar are as follows: logical
The non-cooperative game model that building multi-user selects channel-aware sequencing problem under multichannel scene is crossed, is reduced from global angle
Conflict Level is accumulated between the whole network user, gives channel-aware sequential selection betting model of the multi-user under multichannel scene
A kind of iteration Recursive Solution method of optimal solution, the algorithm can converge to correlated equilibrium quickly, and the number of iterations is few.Specific step
It is rapid as follows:
Step 1, building multi-user selects the non-cooperative game model of channel-aware sequencing problem under multichannel sceneSpecifically: assuming that system includes N number of cognitive user, M communication letter
Road, note cognitive user collection are combined intoChannel set isCognitive user n passes through
To channel setIn multiple channels carry out frequency spectrum perception in a certain order to obtain idle channel and then be subject to chance
It utilizes, it is empty in discovery if there is more than or equal to two cognitive users to select identical channel-aware sequence in N number of cognitive user
It can all select to access and then generate collision when idle channel, therefore cognitive user selects different channel-aware sequence meetings from each other
The contention access to idle channel is influenced, needs to reach global by the non-cooperative game process between all user's individuals of the whole network
The smallest result of channel competition conflict.
The non-cooperative game model of building is as follows:
QnIndicate the channel-aware order policies of user n selection, Q-nIndicate the channel sense that other users select in addition to user n
Know order policies, wherein Qn∈LS.Remember that LS is the composition spatial aggregation of M channel-aware sequence, channel indexes row in the set
Column rule meets Latin square (Latin Square, LS) matrix form, i.e., each channel indexes are in every a line of matrix and each
Only occur in column primary.In order to make it easy to understand, Latin square when Fig. 2 gives number of channel M=3.
Un(Qn,Q-n) be cognitive user n utility function because cognitive user selects different channel-awares from each other
Sequence influences whether the contention access to idle channel, remembers Qn=(qn1,qn2,...,qnM) and Qk=(qk1,qk2,...,qkM) point
Not Wei user n and user k channel-aware sequence, QnAnd QkValue can only be channel composition LS matrix certain a line or certain
One column.
The channel-aware sequence Conflict Level function of user n is defined first are as follows:
WhereinIt is an exclusive or symbol,It is channel q in user's n channel-aware sequencenlIdle probability, PfIt is that erroneous detection is general
Rate, δ are indicator functions, are met:
Wherein dnkFor the actual range between cognitive user n and k, d0For interference distance threshold value.If two cognitions are used
The distance at family is not more than doWhen, it is believed that neighbor user, neighbor user select identical channel-aware sequence just to occur each other for they
, that is, there is conflict in collision, and when two cognitive users are apart from each other, it will not occur selecting identical channel-aware sequence
Collision, i.e., there is no conflicts.
Therefore it needs to reach global channel competition conflict water by the non-cooperative game process between all user's individuals of the whole network
It is flatIt is the smallest as a result, and in non-cooperative game model, the behavior of each user be it is selfish, all it is expected oneself
Obtain maximum utility value, it is possible to pass through Conflict Level functionTo indicate the utility function U of user nn(Qn,Q-n), tool
Body is as follows:
In non-cooperative game model, each user it is expected that oneself obtains maximum utility value, the multi-user that the present invention constructs
The mathematical notation of channel-aware sequential selection game are as follows:
Present invention is primarily intended to provide channel-aware sequential selection betting model of the multi-user under multichannel scene most
A kind of iteration Recursive Solution method of excellent solution.
Step 2, the whole network subscriber channel perception order policies selection initializes, each user in network
With random chance from channel-aware order policies space LSSelect a kind of channel-aware sequence Qn, specifically: setting
Initial time t=0, each user in networkWith random chance from channel-aware order policies space LSSelect a channel-aware sequence Qn, wherein Qn∈ LS calculates the financial value U of user n according to the expression of utility functionn
(Qn,Q-n), the one-sided strategy for changing user n, while keeping other users strategy constant, it calculates user n and selects other strategies
Financial value Un(Q'n,Q-n),Q'n≠Qn, standard is done to calculate the channel-aware sequential selection strategy probability of subsequent time (t=1)
It is standby.
Step 3, by calculating the corresponding regret value of channel-aware sequence of current time t user n selection come recurrence calculation
The user of subsequent time selects the probability of certain channel-aware sequenceRecurrence calculation is opened from t=1,2,3...... ∞
Begin, detailed process are as follows: assuming that Qn, Q'nFor the different channel-aware order policies of any two, Qn, Q'n∈ LS defines Rn t(Qn,
Q'n) it is that each user n selects Q in a period of time length T before t=T moment (including the T moment)nStrategy all uses Q'nPlan
The regret value being slightly averaged again instead of the sum of brought income change value.
Then user n subsequent time (t+1) select the probability of each channel-aware order policies for,
Wherein μ is a sufficiently large integer to guaranteeT=1,2,3...... ∞.
Step 4, select whether the probability of a certain channel-aware order policies restrains by comparing user each in the whole network
The thresholding λ fixed to one, thus the loop iteration of end step 3, detailed process are as follows: determine the channel of T moment user n selection
Whether the probability of perception sequence is greater than thresholding λ, i.e.,The general value of λ between 0.8~0.99, if conditions are not met,
Then the number of iterations t+1 continues to execute step 3.If it is satisfied, then the loop iteration of step 3 is terminated, output all users' of the whole network
Channel-aware sequential selection probability.
Implement example
Determine that multi-user selects the flow diagram of channel-aware sequence such as based on non-cooperative game according to provided by the invention
Shown in Fig. 1.Correlated equilibrium solution can be converged to verify gambling process of the present invention using the method for emulation below, the iteration provided
Recursive Solution method, the number of iterations needed are few.
Simulating scenes be provided that user distribution in the region of 100m × 100m, wireless communication distance covering radius
For 10m, interference distance threshold value do=30m, number of channel M=16, when stepping between each iteration a length of Δ t=100ms, institute
It is 1/2 the case where being uniformly distributed, joined imperfect channel-aware in emulation that channel idle probability, which meets mean value, and setting misses
Examine probability Pf=0.05, irrepentant learning algorithm parameter μ=4, convergence in probability thresholding λ=0.9 of channel-aware order policies.
Fig. 3 gives according to the gambling process that provides of the present invention and iterates to calculate out channel-aware sequential selection strategy and every
The performance comparison result between channel-aware two kinds of strategies of sequence is randomly choosed when secondary iteration.Number of users N=8, from simulation result
As can be seen that iterative algorithm provided by the invention can converge to correlated equilibrium really, the number of iterations is substantially just reachable at 15 times
To convergence, and convergent the whole network Conflict Level value is more much lower than random selection strategy.
Various embodiments of the present invention are described above, above description is exemplary, and non-exclusive, and
It is not limited to disclosed each embodiment.Without departing from the scope and spirit of illustrated each embodiment, for this skill
Many modifications and changes are obvious for the those of ordinary skill in art field.
Claims (7)
1. a kind of method for determining that multi-user selects channel-aware sequence based on non-cooperative game, which is characterized in that steps are as follows:
Step 1, building multi-user select the non-cooperative game model of channel-aware sequencing problem under multichannel scene；
Step 2, the perception order policies selection initialization of the whole network subscriber channel, each user n in network is from channel-aware sequence
Policy space LS in random chanceSelect a channel-aware sequence Qn；
Step 3, the corresponding regret value of channel-aware sequence selected by calculating current time t user n are come under recurrence calculation one
Moment user selects the probability of certain channel-aware sequence
Step 4, compare each user in the whole network select the probability of a certain channel-aware sequence whether converge to one it is fixed
Thresholding λ, if it is the loop iteration of end step 3, exports the channel-aware sequential selection probability of all users of the whole network.
2. the method according to claim 1 for determining multiuser channel perception sequence based on non-cooperative game, feature exist
In, in step 1, non-cooperative game model construction step are as follows:
Multi-user and multi-channel system, including N number of cognitive user, M communication channel are constructed, note cognitive user collection is combined intoChannel set is
The non-cooperative game model of building is as follows:
Wherein: QnIndicate the channel-aware order policies of user n selection, Q-nIndicate the letter that other users select in addition to user n
Road perceives order policies；Qn∈ LS, LS are the policy space of M channel-aware sequence composition；Qn=(qn1,qn2,...,qnM) and
Qk=(qk1,qk2,...,qkM) be respectively user n and user k channel-aware sequence, UnFor the utility function of cognitive user n, adopt
It is expressed with following formula:
Wherein, l indicates the number of communication channel,It is an exclusive or symbol, PqnlIt is channel q in user's n channel-aware sequencenlIt is empty
Not busy probability, PfIt is probability of false detection, δ is indicator function, meets:
Wherein dnkFor the actual range between cognitive user n and k, d0For interference distance threshold value.
3. the method according to claim 2 for determining multiuser channel perception sequence based on non-cooperative game, feature exist
In channel indexes arrangement regulation meets Latin square matrix form Latin Square in LS set, i.e., each channel indexes are in square
Only occur in every a line of battle array and each column primary.
4. the method according to claim 1 for determining multiuser channel perception sequence based on non-cooperative game, feature exist
In in step 2, the whole network subscriber channel perceives order policies selection initialization specifically: setting initial time t=0, in network
Each user n,With random chance from the policy space LS of channel-aware sequenceSelect a kind of channel-aware
Sequence Qn, wherein Qn∈LS。
5. the method according to claim 1 for determining multiuser channel perception sequence based on non-cooperative game, feature exist
In step 3 detailed process are as follows:
Choose the different channel-aware order policies Q of any twonAnd Q'n, Qn、Q'n∈ LS is calculated every in a period of time length T
Secondary user n selects QnStrategy is all with Q'nThe regret value that strategy replaces
Wherein,Indicate that user n selects Q every time in a period of time length T before the t=T momentnStrategy all with
Q'nStrategy replaces the sum of brought income change value to be averaged again；
Calculate the probability that user n selects each channel-aware order policies at subsequent time (t+1)；
Wherein, μ is a sufficiently large integer to guarantee
6. the method according to claim 1 for determining multiuser channel perception sequence based on non-cooperative game, feature exist
In step 4 specifically: setting convergence threshold λ determines whether the probability of the channel-aware sequence of T moment user n selection is greater than door
λ is limited, whenWhen being unsatisfactory for, continue iteration, executes step 3；If it is satisfied, then the loop iteration of step 3 is terminated, it is defeated
The channel-aware sequential selection probability of all users of the whole network out.
7. the method according to claim 6 for determining multiuser channel perception sequence based on non-cooperative game, feature exist
In λ value range is: 0.8~0.99.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811027106.5A CN109361482A (en) | 2018-09-04 | 2018-09-04 | A method of determining that multi-user selects channel-aware sequence based on non-cooperative game |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811027106.5A CN109361482A (en) | 2018-09-04 | 2018-09-04 | A method of determining that multi-user selects channel-aware sequence based on non-cooperative game |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109361482A true CN109361482A (en) | 2019-02-19 |
Family
ID=65350248
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811027106.5A Pending CN109361482A (en) | 2018-09-04 | 2018-09-04 | A method of determining that multi-user selects channel-aware sequence based on non-cooperative game |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109361482A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110035539A (en) * | 2019-03-14 | 2019-07-19 | 北京邮电大学 | One kind being based on the matched resource optimal distribution method of correlated equilibrium regret value and device |
| CN110461040A (en) * | 2019-08-05 | 2019-11-15 | 北京邮电大学 | A kind of determination method and device of channel access strategy |
| WO2020227954A1 (en) * | 2019-05-15 | 2020-11-19 | Advanced New Technologies Co., Ltd. | Determining action selection policies of an execution device |
| WO2020227958A1 (en) * | 2019-05-15 | 2020-11-19 | Advanced New Technologies Co., Ltd. | Determining action selection policies of execution device |
| WO2020227960A1 (en) * | 2019-05-15 | 2020-11-19 | Advanced New Technologies Co., Ltd. | Determining action selection policies of an execution device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010150050A1 (en) * | 2009-06-23 | 2010-12-29 | Nokia Corporation | Method and apparatus for allocating power for cooperative communications |
| US20120071102A1 (en) * | 2010-09-16 | 2012-03-22 | The Hong Kong University Of Science And Technology | Multiple-input, multiple-output cognitive radio |
| CN103796211A (en) * | 2014-03-07 | 2014-05-14 | 国家电网公司 | Distribution method of united power and channels in cognitive wireless network |
| CN108076467A (en) * | 2017-12-29 | 2018-05-25 | 中国人民解放军陆军工程大学 | Frequency spectrum resource be limited under broad sense sensor model and distributed Q-learning cut-in method |
-
2018
- 2018-09-04 CN CN201811027106.5A patent/CN109361482A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010150050A1 (en) * | 2009-06-23 | 2010-12-29 | Nokia Corporation | Method and apparatus for allocating power for cooperative communications |
| US20120071102A1 (en) * | 2010-09-16 | 2012-03-22 | The Hong Kong University Of Science And Technology | Multiple-input, multiple-output cognitive radio |
| CN103796211A (en) * | 2014-03-07 | 2014-05-14 | 国家电网公司 | Distribution method of united power and channels in cognitive wireless network |
| CN108076467A (en) * | 2017-12-29 | 2018-05-25 | 中国人民解放军陆军工程大学 | Frequency spectrum resource be limited under broad sense sensor model and distributed Q-learning cut-in method |
Non-Patent Citations (3)
| Title |
|---|
| LIWANG LI，ET AL.: "Channel sensing order for distributed cognitive networks with multi-user and multi-channel", 《2017 IEEE 9TH INTERNATIONAL CONFERENCE ON COMMUNICATION SOFTWARE AND NETWORKS (ICCSN)》 * |
| LIWANG LI，ET AL.: "Channel Sensing Order for Distributed Cognitive Radio Networks Using No-Regret Learning", 《3RD INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATION AND SENSOR NETWORK (WCSN 2016)》 * |
| 王乃超等: "认知网络中一种基于博弈论的抗阻塞干扰方法", 《军事通信技术》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110035539A (en) * | 2019-03-14 | 2019-07-19 | 北京邮电大学 | One kind being based on the matched resource optimal distribution method of correlated equilibrium regret value and device |
| CN110035539B (en) * | 2019-03-14 | 2021-07-13 | 北京邮电大学 | Resource optimization allocation method and device based on relevant balanced regret value matching |
| WO2020227954A1 (en) * | 2019-05-15 | 2020-11-19 | Advanced New Technologies Co., Ltd. | Determining action selection policies of an execution device |
| WO2020227958A1 (en) * | 2019-05-15 | 2020-11-19 | Advanced New Technologies Co., Ltd. | Determining action selection policies of execution device |
| WO2020227960A1 (en) * | 2019-05-15 | 2020-11-19 | Advanced New Technologies Co., Ltd. | Determining action selection policies of an execution device |
| CN112292698A (en) * | 2019-05-15 | 2021-01-29 | 创新先进技术有限公司 | Determining action selection guidelines for an execution device |
| CN110461040A (en) * | 2019-08-05 | 2019-11-15 | 北京邮电大学 | A kind of determination method and device of channel access strategy |
| CN110461040B (en) * | 2019-08-05 | 2021-11-19 | 北京邮电大学 | Method and device for determining channel access strategy |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109361482A (en) | A method of determining that multi-user selects channel-aware sequence based on non-cooperative game | |
| CN104936186B (en) | Cognitive radio network spectrum allocation method based on cuckoo searching algorithm | |
| Zhang et al. | Dynamic spectrum access in multi-channel cognitive radio networks | |
| CN108076467B (en) | Generalized perception model and distributed Q learning access method under limitation of frequency spectrum resources | |
| CN106961684A (en) | The cognitive radio null tone two dimension meaning interference method against the enemy learnt based on deeply | |
| CN108712748B (en) | Cognitive radio anti-interference intelligent decision-making method based on reinforcement learning | |
| Naparstek et al. | Fully distributed optimal channel assignment for open spectrum access | |
| CN103002520A (en) | Method for multi-mode terminal to select target networks with guaranteed quality of service | |
| CN108712746B (en) | Partially overlapped channel aggregation game model and learning method | |
| CN116744311B (en) | User group spectrum access method based on PER-DDQN | |
| CN114330715A (en) | Intelligent ammunition co-evolution task allocation method | |
| CN105792218A (en) | Optimization method of cognitive radio network with radio frequency energy harvesting capability | |
| CN105101383B (en) | Power distribution method based on frequency spectrum share efficiency maximum | |
| CN106788820B (en) | Unauthorized user meeting method for cognitive radio network transceiver | |
| Huang et al. | Stable multiuser channel allocations in opportunistic spectrum access | |
| CN110461006A (en) | Reduce WLAN interference method, device and terminal device | |
| CN104796991A (en) | OFDMA (orthogonal frequency division multiple access) system resource distributing method based on potential game | |
| CN114126021A (en) | Green cognitive radio power distribution method based on deep reinforcement learning | |
| CN107896347B (en) | Passive optical network planning method and equipment and passive optical network | |
| CN111313994B (en) | Multi-user spectrum access method based on multi-arm gambling machine model under fairness principle | |
| Wu et al. | Cooperation policy selection for energy-constrained ad hoc networks using correlated equilibrium | |
| CN110035539B (en) | Resource optimization allocation method and device based on relevant balanced regret value matching | |
| CN105007585A (en) | Power distribution method based on maximum outage probability energy efficiency | |
| CN107919931A (en) | A kind of multichannel power control mechanism based on hidden Markov in cognition net | |
| CN108471619A (en) | The channel selecting method of cognition wireless sensor network |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20190219 |
|
| WD01 | Invention patent application deemed withdrawn after publication |