CN110474701A - User group is to method in nonopiate cognitive radio networks based on pairing opinion - Google Patents
User group is to method in nonopiate cognitive radio networks based on pairing opinion Download PDFInfo
- Publication number
- CN110474701A CN110474701A CN201910648628.5A CN201910648628A CN110474701A CN 110474701 A CN110474701 A CN 110474701A CN 201910648628 A CN201910648628 A CN 201910648628A CN 110474701 A CN110474701 A CN 110474701A
- Authority
- CN
- China
- Prior art keywords
- user
- cognitive
- pairing
- authorized user
- authorized
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/04—TPC
- H04W52/30—TPC using constraints in the total amount of available transmission power
- H04W52/34—TPC management, i.e. sharing limited amount of power among users or channels or data types, e.g. cell loading
Abstract
The object of the present invention is to provide user groups in a kind of nonopiate cognitive radio networks based on pairing opinion to method, user group is to method in nonopiate cognitive radio networks based on pairing opinion, user group is cognitive radio networks to the scene that method is based on, which includes K cognitive user and L authorized user；The user group is to method the following steps are included: Step 1: initializing to the state of user each in system, by K cognitive user CU in systemk(k ∈ [1, K]) and L authorized user PUlRelevant hobby table PULIST is arranged according to respective requirement respectively in (l ∈ [1, L])lAnd CULISTk；Step 2: authorized user will issue the request of pairing to cognitive user.Solve the power distribution problems in existing cognitive radio system between authorized user and cognitive user.
Description
[technical field]
The invention belongs to fields of communication technology, and in particular to a kind of based in the nonopiate cognitive radio networks for matching opinion
User group is to method.
[background technique]
European Telecommunication Standardization Association (European Telecommunications Standard in 2013
Institute, ETSI) suggest using cognition wireless electrical communication technology as the 5th Dai Tongxin (5G) standard matingplan.It is same with this
When, as social demand increases, people are presented on terminal, such as video, audio and video call with greater need for diversified business
Equal mobile videos stream business.It is instantly so studying transmission technology of the diversified multimedia service in cognition radio communication
The problem in science that emphasis considers.It need to consider that these is made to recognize multimedia service simultaneously, how to be flexibly adapted to the following channel radio
Believe environment, and improve its availability of frequency spectrum, the service quality (Quality of Service, QoS) for meeting different user, it is low when
Pass on connectivity that is defeated, and improving communication system.Application of the multimedia service in C cognitive radio networks is that potentially most have
The problem of meaning.The dissimilarity that wireless multimedia service requires QoS of customer, so that cognition network is needed according to user
Demand carry out efficient and rational frequency spectrum distribution.
In frequency spectrum share function (overlay) frequency spectrum resource allocation plan of cognitive radio networks, unauthorized user
It can be transmitted with authorized user using identical frequency spectrum, but cannot be influenced by the interference of unauthorized user bring simultaneously
The communication quality of authorized user.Under this application background, the appearance of non-orthogonal multiple (NOMA) technology can be effectively improved not
Carry out the frequency spectrum access efficiency of mobile network.In the non-orthogonal multiple technical solution of downlink, base station can be by different
Power distribution (distributes higher transimission power to the user with poor channel conditions), realizes at the same time or in frequency
For multiple user services.Non-orthogonal multiple technology is formed novel nonopiate cognition by the present invention in conjunction with cognitive radio networks
Radio net (CR-NOMA).
Pairing is theoretical as a kind of practical mathematical tool, can solve cooperation or competes the various problems of scene.Its
Thought has been widely used in wireless communication system, and some scholars are issued under downlink non-orthogonal multiple access system background
A kind of pairing mode of multi-user to multi-user, it allows multiple users to transmit information in same frequency range simultaneously, with maximum
Change the availability of frequency spectrum.Separately there is scholar to propose for the distributed collaborative strategy in cognitive radio networks between cognitive user,
Wherein each cognitive user can match pair according to the formation of its own demand and other cognitive users, and when authorized frequency bands are vacant
It is communicated using it.Therefore, in the cognitive radio networks based on non-orthogonal multiple access technology, with pairing theory for base
The solution authorized user of plinth and cognitive user group obtain deeper excavation and research to technical value.
[summary of the invention]
The object of the present invention is to provide user groups in a kind of nonopiate cognitive radio networks based on pairing opinion to method,
To solve the power distribution problems in existing cognitive radio system between authorized user and cognitive user.
The invention adopts the following technical scheme: user group other side in the nonopiate cognitive radio networks based on pairing opinion
Method, user group are cognitive radio networks to the scene that method is based on, which includes that K cognitive user and L authorization are used
Family；
The user group to method the following steps are included:
Step 1: being initialized to the state of user each in system, by K cognitive user CU in systemk(k∈[1,
K]) and L authorized user PUlRelevant hobby table PULIST is arranged according to respective requirement respectively in (l ∈ [1, L])lWith
CULISTk；
Step 2: authorized user will issue the request of pairing to cognitive user；
2.1) authorized user will like the cognitive user sending pairing to make number one in table to it and invite；
It 2.2), can be according to the minimum speed of personal set after the cognitive user to make number one, which receives pairing, invites
Rate requires to decide whether to match with the authorized user:
If the authorized user likes in table at it, the two forms interim matching pair；
If the cognitive user has possessed matching pair, can to issue in step 2.1) authorized user that pairing is invited with
Pairing object before it is compared:
If the authorized user compare it is described before pairing object bring user rate it is bigger, selection is awarded with described
Weigh user's pairing；
Conversely, then refusing the authorized user, continue to keep matching with preceding pairing object.
Further, in step 1, the hobby table PULISTlIt is the cognitive user interested that will meet setting condition
Composed set is arranged according to hobby sequence from high to low；
The hobby table CULISTkIt is to arrange the authorized user from opposite according to hobby sequence from high to low
Composed set.
Further, in step 2, the authorized user being rejected updates its power partition coefficient and hobby table.
Further, user group is to method further include:
If all authorized users find the pairing object of its satisfaction, the hobby table of cognitive user is sky, i.e., existing to award
User and cognitive user matching are weighed to stable state is had reached, then executes following steps: authorized user and cognitive user shape
At matching communicated to can use NOMA technology；Under the conditions of the pairing of the mutual benefit, authorized user is available more
Rate, while the available benefit transmitted together of cognitive user.
And if not all authorized user finds the pairing object of its satisfaction, returns to step two.
Advantageous effect of the invention is: by by non-orthogonal multiple cognitive radio networks authorized user and cognitive user
It is grouped, and so that cognitive user is simultaneously carried out communication under the premise of meeting the quality of service requirement of authorized user and appoint
Business, to reduce the consumption of system, and the significantly handling capacity of lifting system in power domain；It is proposed with solve user group to and function
The distributed algorithm theoretical based on one-to-one pairing premised on rate distribution, by authorized user and cognitive user about power point
The negotiation of distribution coefficient considers active interference between authorized user and cognitive user, solves from the source link of resource allocation
Transmission interference problem, the transmission rate of final lifting system.
[Detailed description of the invention]
Fig. 1 is flow chart of the invention；
Fig. 2 is to propose that convergence proves figure in the present invention；
Fig. 3 is algorithm proposed by the present invention figure compared with traditional algorithm.
[specific embodiment]
The following describes the present invention in detail with reference to the accompanying drawings and specific embodiments.
The present invention provides user groups in a kind of nonopiate cognitive radio networks based on pairing opinion to method.The present invention
Usage scenario be cognitive radio networks, the network include K cognitive user and L authorized user.The present invention, which takes, to be had
The frequency spectrum resource allocation plan of frequency spectrum share function (overlay), i.e. cognitive user can be in the use for meeting authorized user's setting
In the case where the quality of service requirement of family, and under the premise of ensureing and not reducing the transmission quality requirements of authorized user, authorization frequency is utilized
Section is transmitted simultaneously with authorized user.Wherein the channel gain of cognitive user respective channels isAuthorized user is corresponding
Channel gain isFor authorized user distribution power coefficient beCognitive user distribution power coefficient beWhen
One cognitive user match clock synchronization with authorized user composition, power coefficient and be 1, such as:
Two concepts are defined first:
The rate minimum requirements of authorized user,When authorized user determines to form matching clock synchronization and benefit with cognitive user
After being communicated in same frequency range with non-orthogonal multiple access technology, it should be ensured that the accessible rate of authorized user exceeds its people and sets
The minimum requirements set i.e. its utilize obtained rate after orthogonal multiple access technique.
The rate minimum requirements of cognitive userLikewise, the setting of the rate minimum requirements of cognitive user be in order to
Ensure that cognitive user also can therefrom obtain corresponding benefit after the frequency range of insertion authority user occupancy.Furthermore cognitive user
Rate minimum requirements is determined by its channel gain.
Referring to Fig.1, steps are as follows in the realization of above-mentioned scene by the present invention:
Simultaneously respectively hobby table is arranged in step 1, system user state initialization:
1.1) state of user each in system is initialized, by K cognitive user CU in systemk(k ∈ [1, K]) and
L authorized user PUlRelevant hobby table PULIST is arranged according to respective requirement in (l ∈ [1, L])lAnd CULISTk；
Wherein, the hobby table of authorized user: to all authorized users, before algorithm starts, it need to will meet its setting
The cognitive user interested of condition is arranged sequentially in respective hobby table according to hobby from high in the end.Such as:Wherein, κ (k) meets condition:The use of cognitive user
Family number will be recorded in the hobby table of authorized user, while authorized user likes cognitive user quantity K'≤K in table.
Simultaneously, we, which are set in, comes PULISTlIn first CUκ(k)Maximum authorized user's rate can be provided.
The hobby table of cognitive user: likewise, cognitive user is before algorithm starts by the authorized user from opposite
It is arranged sequentially in respective hobby table according to hobby from high in the end.Such as:Wherein,
Meet condition:The Customs Assigned Number of authorized user will be recorded in the happiness of cognitive user
In good table, while authorized user's quantity L'≤L in cognitive user hobby table.However, we, which are set in, comes CULISTkIn
FirstMaximum cognitive user rate can be provided.
Step 2, authorized user will issue the request of pairing to cognitive user:
2.1) authorized user issues the invitation matched for the cognitive user to make number one in table is liked to it.According to non-
The basic principle of orthogonal multiple access (NOMA) technology, these authorized users have relatively weak channel condition, then more to its distribution
Big power resource is to guarantee its normal communication.
2.2) it after the cognitive user, which receives pairing, invites, can require to decide whether according to the minimum-rate of personal set
It to be matched with this authorized user.If the authorized user likes in table at it, the two forms interim matching pair.
Step 3 receives the cognitive user that pairing is invited and has possessed matching pair:
If 3.1) cognitive user has possessed matching pair, to the authorized user that newly invite of sending and object can be matched before
It is compared, and chooses the authorized user that can bring bigger income to it.Before described in being compared as the authorized user
Pairing object bring user rate is more than no group to preceding rate, then selection is matched with the authorized user.
3.2) authorized user being rejected will will be updated its power partition coefficient and hobby table.The power distribution system of update
Base is in formula αnew=αold- ε, αnewFor new power partition coefficient, αoldFor old power partition coefficient, ε is to set in algorithm
The step-length of fixed power coefficient.Since the hobby table of users is since the power coefficient distributed determines, so corresponding
User likes table can also change therewith.
Step 4 judges whether to reach stable user's pairing mode:
4.1) if all authorized users find the pairing object of its satisfaction, the hobby table of cognitive user is sky, i.e., existing
Authorized user and cognitive user matching then follow the steps five to stable state is had reached；Conversely, returning to step two；
Step 5, authorized user and cognitive user are passed through using NOMA technology:
5.1) authorized user communicates with the matching that cognitive user is formed to can use NOMA technology.The mutual benefit is matched
To under the conditions of, the available more rates of authorized user, while the available benefit transmitted together of cognitive user.
It can make the proof for being paired to stable state of authorized user and cognitive user to the present invention: in assessment authorized user
With the pairing result of cognitive user it is whether stable during, process design according to the invention, each authorized user is ok
Total system and the maximum target of rate are realized by way of finding and matching object, some authorized user is unsatisfactory for if it exists
Instantly pairing partner, then the space that proof system and rate are still improved, at this time user matching to and it is not up to stable
State.So all authorizations are used when there is no the matchings wanted to exit out instantly to either dissatisfied pairing object instantly
Family has just had reached the stable state of pairing.
Embodiment:
Effect of the invention can be further illustrated by emulation:
1. simulated conditions: assuming that in cognitive radio networks, including 10 authorized users and 20 unauthorized users.Authorization
The transimission power of user is 3dB, and the transimission power of unauthorized user is 5dB.
2. emulation content: to frequency spectrum resource allocation method of the present invention consider different number authorized user, according to its
Convergence under incremental iteration number is analyzed, as a result such as Fig. 2.In Fig. 2, ordinate is that " authorized user's is flat after pairing
Equal rate "；Abscissa is " iteration number ".
By Fig. 2 simulation result it is found that the pairing algorithm in the present invention may finally reach convergence as iteration number increases.
Simultaneously in the case where authorized user's quantity is different, bigger system can achieve using the pairing algorithm of the invention more than quantity
Rate；It is possible thereby to prove the eventual stabilities of inventive algorithm, it can also be using user's scene with different number.
3. emulation content: to using frequency spectrum resource allocation method of the present invention and different in nonopiate cognitive radio networks
Traditional resource distribution algorithm carries out emulation comparison, as a result such as Fig. 3.In Fig. 3, ordinate is that " authorized user and cognitive user are total
Handling capacity "；Abscissa is " quantity of authorized user ".
By Fig. 3 simulation result it is found that in the case where authorized user's quantity is different, using nonopiate cognition nothing of the invention
The resource allocation algorithm result taken in gauze network according to matching algorithm is better than being randomly assigned algorithm, and obtained normal solution is close
Optimum allocation algorithm；It is possible thereby to prove inventive algorithm be suitable for different system user quantity, and effect be substantially better than with
The frequency spectrum resource allocation algorithm of machine.
The present invention is based on user group in the nonopiate cognitive radio networks of pairing opinion to method by by non-orthogonal multiple
Authorized user and cognitive user in cognitive radio networks are grouped, and make cognitive user in the service for meeting authorized user
Communication task is simultaneously carried out under the premise of quality requirement, to reduce the consumption of system in power domain, and is significantly promoted
The handling capacity of system；It is proposed on solve user group to and power distribution premised on calculated based on theoretical distributed of one-to-one pairing
Method, the negotiation by authorized user and cognitive user about power partition coefficient, considers between authorized user and cognitive user
Active interference solves the problems, such as transmission interference, the transmission rate of final lifting system from the source link of resource allocation.
Claims (4)
1. user group is to method in the nonopiate cognitive radio networks based on pairing opinion, which is characterized in that the user group pair
The scene that method is based on is cognitive radio networks, which includes K cognitive user and L authorized user；
The user group to method the following steps are included:
Step 1: being initialized to the state of user each in system, by K cognitive user CU in systemk(k ∈ [1, K]) and L
A authorized user PUlRelevant hobby table PULIST is arranged according to respective requirement respectively in (l ∈ [1, L])lAnd CULISTk；
Step 2: authorized user will issue the request of pairing to cognitive user；
2.1) authorized user will like the cognitive user sending pairing to make number one in table to it and invite；
2.2) it after the cognitive user to make number one, which receives pairing, invites, can be wanted according to the minimum-rate of personal set
It asks and decides whether to match with the authorized user:
If the authorized user likes in table at it, the two forms interim matching pair；
It, can be to issuing authorized user that pairing is invited and its it in step 2.1) if the cognitive user has possessed matching pair
Preceding pairing object is compared:
If the authorized user compare it is described before pairing object bring user rate it is bigger, selection and authorization use
Family pairing；
Conversely, then refusing the authorized user, continue to keep matching with preceding pairing object.
2. user group is to method, feature in the nonopiate cognitive radio networks as described in claim 1 based on pairing opinion
It is, in the step 1, the hobby table PULISTlIt is that will meet the cognitive user interested of setting condition according to from height
Composed set is arranged to low hobby sequence；
The hobby table CULISTkBe will the authorized user from opposite according to from high to low hobby sequence arrangement institute's group
At set.
3. user group is special to method in the nonopiate cognitive radio networks as claimed in claim 1 or 2 based on pairing opinion
Sign is, in the step 2, the authorized user being rejected updates its power partition coefficient and hobby table.
4. user group is to method, feature in the nonopiate cognitive radio networks as claimed in claim 3 based on pairing opinion
It is, the user group is to method further include:
If all authorized users find the pairing object of its satisfaction, the hobby table of cognitive user is sky, i.e., existing authorization is used
Family and cognitive user matching are to stable state is had reached, then execute following steps: authorized user is formed with cognitive user
Matching is communicated to can use NOMA technology；Under the conditions of the pairing of the mutual benefit, the available more rates of authorized user,
The available benefit transmitted together of cognitive user simultaneously.
And if not all authorized user finds the pairing object of its satisfaction, returns to step two.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910648628.5A CN110474701A (en) | 2019-07-18 | 2019-07-18 | User group is to method in nonopiate cognitive radio networks based on pairing opinion |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910648628.5A CN110474701A (en) | 2019-07-18 | 2019-07-18 | User group is to method in nonopiate cognitive radio networks based on pairing opinion |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110474701A true CN110474701A (en) | 2019-11-19 |
Family
ID=68508177
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910648628.5A Pending CN110474701A (en) | 2019-07-18 | 2019-07-18 | User group is to method in nonopiate cognitive radio networks based on pairing opinion |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110474701A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113115424A (en) * | 2021-04-22 | 2021-07-13 | 西北工业大学 | Trilateral resource matching method and system based on cognitive cloud network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100248769A1 (en) * | 2009-03-25 | 2010-09-30 | Futurewei Technologies, Inc. | System and Method for Probability-based Resource Allocation in a Wireless Communications System |
| CN109327834A (en) * | 2018-06-22 | 2019-02-12 | 广东电网有限责任公司 | A kind of authorization network and cognition network pairing collaboration method based on Game with Coalitions |
-
2019
- 2019-07-18 CN CN201910648628.5A patent/CN110474701A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100248769A1 (en) * | 2009-03-25 | 2010-09-30 | Futurewei Technologies, Inc. | System and Method for Probability-based Resource Allocation in a Wireless Communications System |
| CN109327834A (en) * | 2018-06-22 | 2019-02-12 | 广东电网有限责任公司 | A kind of authorization network and cognition network pairing collaboration method based on Game with Coalitions |
Non-Patent Citations (2)
| Title |
|---|
| WEI LIANG等: "User Pairing for Downlink Non-Orthogonal Multiple Access Networks Using Matching Algorithm", 《IEEE TRANSACTIONS ON COMMUNICATIONS》 * |
| WENJUN XU等: "Joint Sensing Duration Adaptation, User Matching, and Power Allocation for Cognitive OFDM-NOMA Systems", 《IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113115424A (en) * | 2021-04-22 | 2021-07-13 | 西北工业大学 | Trilateral resource matching method and system based on cognitive cloud network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhang et al. | Resource allocation in NOMA-based fog radio access networks | |
| Zhao et al. | Spectrum allocation and power control for non-orthogonal multiple access in HetNets | |
| Buzzi et al. | Potential games for energy-efficient power control and subcarrier allocation in uplink multicell OFDMA systems | |
| El-Hajj et al. | A stable matching game for joint uplink/downlink resource allocation in OFDMA wireless networks | |
| CN107071914B (en) | Dynamic mode selection and energy distributing method in a kind of energy capture D2D network | |
| CN108040364A (en) | Channel width and the linear search method of power joint distribution in non-orthogonal multiple link | |
| CN102970758B (en) | Straight-through self-adaptive resource distribution method for cellular communication system terminal | |
| CN108462950A (en) | D2D based on NOMA communicates joint sub-channel and power allocation method | |
| Huynh et al. | Joint computational offloading and data-content caching in NOMA-MEC networks | |
| CN109699083A (en) | A kind of power distribution method of the non-orthogonal multiple access technology based on multi-user | |
| Liu et al. | Distributed resource allocation for D2D-assisted small cell networks with heterogeneous spectrum | |
| CN107040323A (en) | Multichannel power bandwidth combined distributing method in a kind of cognitive radio networks | |
| CN110337148A (en) | Cognitive radio efficiency resource allocation methods based on non-orthogonal multiple access | |
| CN104796991B (en) | The resource allocation methods of OFDMA system based on gesture game | |
| Abd-Elnaby et al. | Subcarrier-user assignment in downlink NOMA for improving spectral efficiency and fairness | |
| CN111669759A (en) | Dynamic multi-channel cooperative sensing method based on deep Q network | |
| CN107302801A (en) | To QoE double-deck matching game method below a kind of 5G mixing scene | |
| CN110474701A (en) | User group is to method in nonopiate cognitive radio networks based on pairing opinion | |
| CN110677175A (en) | Sub-channel scheduling and power distribution joint optimization method based on non-orthogonal multiple access system | |
| CN106162855B (en) | It communicates in conjunction with more D2D of subcarrier distribution and power control to resource allocation methods | |
| CN111682915B (en) | Self-allocation method for frequency spectrum resources | |
| CN106793126A (en) | Dynamic spectrum resource allocation methods in a kind of cognitive radio networks | |
| CN113810914B (en) | User pairing method for user separated uplink non-orthogonal multiple access technology | |
| CN110062399A (en) | A kind of cognition isomery cellular network frequency spectrum distributing method based on game theory | |
| CN112543498B (en) | Power self-adaptive distribution method based on layered game model |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20191119 |
|
| RJ01 | Rejection of invention patent application after publication |