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
- users
- 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
- 230000001149 cognitive effect Effects 0.000 title claims abstract description 106
- 238000000034 method Methods 0.000 title claims abstract description 30
- 230000000631 nonopiate Effects 0.000 title abstract 3
- 230000005540 biological transmission Effects 0.000 claims description 13
- 238000005516 engineering process Methods 0.000 claims description 12
- 206010042135 Stomatitis necrotising Diseases 0.000 claims 1
- 201000008585 noma Diseases 0.000 claims 1
- 238000004891 communication Methods 0.000 description 11
- 238000001228 spectrum Methods 0.000 description 11
- 238000013468 resource allocation Methods 0.000 description 7
- 238000004088 simulation Methods 0.000 description 7
- 230000000694 effects Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000005065 mining Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Electromagnetism (AREA)
- Mobile Radio Communication Systems (AREA)
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 ] A method for producing a semiconductor device
The invention belongs to the technical field of communication, and particularly relates to a pairing method for users in a non-orthogonal cognitive radio network based on pairing theory.
[ background of the invention ]
The European Telecommunications Standardization Institute (ETSI) suggested a cognitive radio communication technology as a fifth generation communication (5G) Standard alternative in 2013. Meanwhile, as social needs increase, people are more demanding diversified services to be presented in terminals, such as mobile video streaming services of video, audio, and video calls. Therefore, the research on the transmission technology of diversified multimedia services in cognitive radio communication is a scientific problem that is considered in the next place. Meanwhile, how to flexibly adapt to the future wireless communication environment by considering the cognitive multimedia services needs to be considered, the spectrum utilization rate is improved, the Quality of Service (QoS) of different users is met, the low-delay transmission is realized, and the connectivity of a communication system is improved. The application of multimedia services in C-cognitive radio networks is potentially the most significant problem. Due to different requirements of wireless multimedia services on user service quality, a cognitive network needs to perform efficient and reasonable spectrum allocation according to the requirements of users.
In a spectrum resource allocation scheme of a cognitive radio network, an unauthorized user and an authorized user can simultaneously transmit using the same spectrum, but the communication quality of the authorized user cannot be affected by interference brought by the unauthorized user. In the background of the application, the emergence of a non-orthogonal multiple access (NOMA) technology can effectively improve the spectrum access efficiency of a future mobile network. In the downlink non-orthogonal multiple access scheme, the base station may serve multiple users in the same time or frequency by different power allocations (higher transmission power is allocated to users with poor channel conditions). The invention combines the non-orthogonal multiple access technology with the cognitive radio network to form a novel non-orthogonal cognitive radio network (CR-NOMA).
The pairing theory as a practical mathematical tool can solve various problems of cooperation or competition scenes. The idea of the method is widely applied to wireless communication systems, and part of scholars release a multi-user-to-multi-user pairing mode in the context of a downlink non-orthogonal multiple access system, which allows multiple users to transmit information on the same frequency band at the same time so as to maximize the spectrum utilization rate. Another scholars has proposed a distributed cooperation strategy for cognitive users in a cognitive radio network, in which each cognitive user may form a matching pair with other cognitive users according to its own needs and communicate using the matching pair when an authorized frequency band is vacant. Therefore, in the cognitive radio network based on the non-orthogonal multiple access technology, the solution of the authorized user and the cognitive user group based on the pairing theory is worthy of deeper mining and research on the technology.
[ summary of the invention ]
The invention aims to provide a pairing method for users in a non-orthogonal cognitive radio network based on a pairing theory, so as to solve the problem of power distribution between authorized users and cognitive users in the existing cognitive radio system.
The invention adopts the following technical scheme: the method comprises the steps that a pairing theory-based user pairing method is adopted in a non-orthogonal cognitive radio network, a scene on which the user pairing method is based is a cognitive radio network, and the network comprises K cognitive users and L authorized users;
the user group pairing method comprises the following steps:
step one, initializing the state of each user in the system, and enabling K cognitive users CU in the systemk(k∈[1,K]) And L authorized users PUl(l∈[1,L]) Setting the associated preference table PULIST according to the respective requirementslAnd Curistk；
Step two, the authorized user sends a pairing request to the cognitive user;
2.1) the authorized user sends a pairing invitation to the cognitive user ranked first in the preference form;
2.2) when the cognitive user ranked first receives the pairing invitation, determining whether to pair with the authorized user according to the minimum speed requirement set by the individual:
if the authorized user is in the preference form, the authorized user and the preference form a temporary matching pair;
if the cognitive user already has a matching pair, comparing the authorized user who sends out the pairing invitation in the step 2.1) with a previous pairing object:
if the user rate of the authorized user is larger than that of the authorized user brought by the previous pairing object, selecting to pair with the authorized user;
and otherwise, rejecting the authorized user and continuously keeping the pairing with the former pairing object.
Further, step (ii)One, the preference form PULISTlThe method is a set formed by arranging interested cognitive users meeting set conditions in a preference order from high to low;
the preference form CULISTkIs a collection of authorized users from opposite sides arranged in order of high to low preference.
Further, in step two, the rejected authorized user updates its power distribution coefficient and preference table.
Further, the user group pairing method further comprises the following steps:
if all authorized users find out satisfactory matching objects, the preference form of the cognitive user is empty, namely the matching pair of the existing authorized users and the cognitive user reaches a stable state, and the following steps are executed: the matching pair formed by the authorized user and the cognitive user can communicate by using the NOMA technology; under the mutual-winning pairing condition, the authorized user can obtain more rates, and meanwhile, the cognitive user can obtain the benefit of transmission together with the cognitive user.
And if not, returning to execute the step two.
The invention has the beneficial effects that: the authorized users and the cognitive users in the non-orthogonal multiple access cognitive radio network are paired, and the cognitive users perform communication tasks simultaneously with the authorized users on the premise of meeting the service quality requirements of the authorized users, so that the consumption of the system is reduced in a power domain, and the throughput of the system is greatly improved; the distributed algorithm based on the one-to-one pairing theory is provided on the premise of solving user group pairing and power distribution, active interference is considered between authorized users and cognitive users through the interference of the authorized users and the cognitive users on power distribution coefficients, the problem of transmission interference is solved from the source link of resource distribution, and finally the transmission rate of the system is improved.
[ description of the drawings ]
FIG. 1 is a flow chart of the present invention;
FIG. 2 is a graph illustrating the convergence of the proposed algorithm in the present invention;
fig. 3 is a diagram comparing the algorithm proposed by the present invention with the conventional algorithm.
[ detailed description ] embodiments
The present invention will be described in detail below with reference to the accompanying drawings and specific embodiments.
The invention provides a pairing method for user groups in a non-orthogonal cognitive radio network based on a pairing theory. The use scene of the invention is a cognitive radio network, and the network comprises K cognitive users and L authorized users. The invention adopts a spectrum resource allocation scheme with a spectrum sharing function (overlay), namely, a cognitive user can simultaneously transmit with an authorized user by using an authorized frequency band under the condition of meeting the user service quality requirement set by the authorized user and on the premise of ensuring that the transmission quality requirement of the authorized user is not reduced. Wherein the channel gain of the channel corresponding to the cognitive user isThe authorized user corresponds to a channel gain ofThe power coefficient allocated to the authorized user isCognitive users are assigned a power factor ofWhen a cognitive user and an authorized user form a matching pair, the sum of their power coefficients is 1, for example:
two concepts are first defined:
the minimum requirement of the rate of the authorized user,when the authorized user determines to form a matching pair with the cognitive user and communicates on the same frequency band by using the non-orthogonal multiple access technology, the authorized user can be ensured to be capable ofThe rate achieved is higher than the minimum requirement set by its individual, i.e. the rate it will achieve after using the orthogonal multiple access technique.
Rate minimization requirements for cognitive usersSimilarly, the minimum rate requirement of the cognitive user is set to ensure that the cognitive user can obtain corresponding benefits after accessing the frequency band occupied by the authorized user. Furthermore, the minimum rate requirement of the cognitive user is determined by the channel gain of the cognitive user.
Referring to fig. 1, the implementation steps of the present invention in the above scenario are as follows:
step one, initializing the state of a system user and setting respective preference forms:
1.1) initializing the state of each user in the system, and enabling K cognitive users in the system to be CUk(k∈[1,K]) And L authorized users PUl(l∈[1,L]) Setting the associated preference table PULIST according to the respective requirementslAnd Curistk；
Wherein, the preference form of the authorized user: for all authorized users, before the algorithm starts, interested cognitive users meeting the setting conditions need to be arranged in the respective preference lists according to the preference sequence from top to bottom. For example:wherein κ (k) satisfies the condition:the user number of the cognitive user is recorded in the preference table of the authorized user, and the number K' of the cognitive users in the preference table of the authorized user is less than or equal to K. At the same time, we set at PULISTlFirst bit CU ofκ(k)A maximum authorized user rate may be provided.
Cognitive user preference form: similarly, the cognitive user arranges the authorized users from opposite side in their respective preference lists in order of top-to-bottom preference before the algorithm begins. For example:wherein,the conditions are satisfied:the user number of the authorized user is recorded in the preference table of the cognitive user, and the number L' of the authorized users in the preference table of the cognitive user is less than or equal to L. However, we set the list to CULISTkFirst bit of (1)A maximum cognitive user rate may be provided.
Step two, the authorized user sends a pairing request to the cognitive user:
2.1) the authorized user will send paired invitation to the cognitive user ranked first in his preference form. According to the basic principle of non-orthogonal multiple access (NOMA) technology, these authorized users have relatively weak channel conditions, and are allocated with larger power resources to ensure their normal communication.
2.2) when the cognitive user receives the pairing invitation, whether the cognitive user needs to be paired with the authorized user is determined according to the minimum speed requirement set by the individual. If the authorized user is in his preference form, they form a temporary matching pair.
Step three, the cognitive user receiving the pairing invitation already has the matching pairs:
3.1) if the cognitive user has the matched pair, comparing the authorized user who sends the new invitation with the previous paired object, and selecting the authorized user which can bring greater benefit to the authorized user. That is, when the user rate brought by the authorized user compared with the previous pairing object exceeds the rate of no group to be paired, the authorized user is selected to be paired.
3.2) the rejected authorized user will update its power allocation coefficient and preference table. Updated power distribution coefficient baseIn the formula alphanew＝αold-ε，αnewFor new power distribution coefficient, alphaoldThe power coefficient is assigned to the old power, and epsilon is the step size of the power coefficient set in the algorithm. Since the user's preference table is determined by the allocated power factor, the corresponding user's preference table will also change.
Step four, judging whether a stable user pairing mode is achieved:
4.1) if all authorized users find out satisfactory paired objects, and the preference form of the cognitive user is empty, namely the matching pair of the existing authorized user and the cognitive user reaches a stable state, executing a fifth step; otherwise, returning to execute the step two;
step five, the authorized user and the cognitive user pass through by using the NOMA technology:
5.1) the matching pairs formed by authorized users and cognitive users can communicate by using NOMA technology. Under the mutual-winning pairing condition, the authorized user can obtain more rates, and meanwhile, the cognitive user can obtain the benefit of transmission together with the cognitive user.
The invention can ensure that the matching of the authorized user and the cognitive user is proved to be in a stable state: in the process of evaluating whether the pairing result of the authorized user and the cognitive user is stable, according to the process design of the invention, each authorized user can realize the aim of maximum overall system and speed by searching for the pairing object, if a certain authorized user does not meet the current pairing partner, the system and speed are proved to have a space for improving, and at the moment, the matching pair of the user does not reach a stable state. Therefore, when there is no matching pair to exit or no matching pair to be satisfied, all authorized users have reached a stable state of pairing.
Example (b):
the effects of the invention can be further illustrated by simulation:
1. simulation conditions are as follows: it is assumed that a cognitive radio network includes 10 authorized users and 20 unauthorized users. The transmission power of the authorized user is 3dB and the transmission power of the unauthorized user is 5 dB.
2. Simulation content: the spectrum resource allocation method of the present invention considers different numbers of authorized users, and analyzes according to their convergence under increasing iteration number, and the result is shown in fig. 2. In fig. 2, the ordinate is "average rate of authorized users after pairing"; the abscissa is "number of iterations".
As can be seen from the simulation results of FIG. 2, the pairing algorithm of the present invention can eventually reach convergence as the number of iterations increases. Meanwhile, under the condition that the number of authorized users is different, a larger system rate can be achieved by adopting a large number of pairing algorithms of the invention; therefore, the final stability of the algorithm can be proved, and the method can also be applied to user scenes with different quantities.
3. Simulation content: the results of simulation comparison of the spectrum resource allocation method adopted in the non-orthogonal cognitive radio network and different traditional resource allocation algorithms are shown in fig. 3. In fig. 3, the ordinate is "total throughput of authorized users and cognitive users"; the abscissa is "number of authorized users".
As can be seen from the simulation result of fig. 3, under the condition that the number of authorized users is different, the result of the resource allocation algorithm adopted according to the matching algorithm in the non-orthogonal cognitive wireless network of the present invention is superior to the result of the random allocation algorithm, and the obtained positive solution approaches the optimal allocation algorithm; therefore, the algorithm is suitable for different system user numbers, and the effect is obviously superior to that of a random spectrum resource allocation algorithm.
According to the pairing theory-based user pairing method in the non-orthogonal cognitive radio network, the authorized users and the cognitive users in the non-orthogonal multiple access cognitive radio network are paired, and the cognitive users perform communication tasks simultaneously with the authorized users on the premise of meeting the service quality requirements of the authorized users, so that the consumption of the system is reduced in a power domain, and the throughput of the system is greatly improved; the distributed algorithm based on the one-to-one pairing theory is provided on the premise of solving user group pairing and power distribution, active interference is considered between authorized users and cognitive users through the interference of the authorized users and the cognitive users on power distribution coefficients, the problem of transmission interference is solved from the source link of resource distribution, and finally the transmission rate of the system is improved.
Claims (4)
1. The pairing theory-based user pairing method in the non-orthogonal cognitive radio network is characterized in that a scene based on the user pairing method is a cognitive radio network, and the network comprises K cognitive users and L authorized users;
the user group pairing method comprises the following steps:
step one, initializing the state of each user in the system, and enabling K cognitive users CU in the systemk(k∈[1,K]) And L authorized users PUl(l∈[1,L]) Setting the associated preference table PULIST according to the respective requirementslAnd Curistk；
Step two, the authorized user sends a pairing request to the cognitive user;
2.1) the authorized user sends a pairing invitation to the cognitive user ranked first in the preference form;
2.2) when the cognitive user ranked first receives the pairing invitation, determining whether to pair with the authorized user according to the minimum speed requirement set by the individual:
if the authorized user is in the preference form, the authorized user and the preference form a temporary matching pair;
if the cognitive user already has a matching pair, comparing the authorized user who sends out the pairing invitation in the step 2.1) with a previous pairing object:
if the user rate of the authorized user is larger than that of the authorized user brought by the previous pairing object, selecting to pair with the authorized user;
and otherwise, rejecting the authorized user and continuously keeping the pairing with the former pairing object.
2. The pair-wise method of claim 1, wherein in the first step, the preference table PULIST is usedlThe interested cognitive users meeting the set conditions are arranged from high to lowA set of preference order arrangements;
the preference form CULISTkIs a collection of authorized users from opposite sides arranged in order of high to low preference.
3. The pair-wise method of claim 1 or 2, wherein in the second step, the rejected authorized users update their power allocation coefficients and preference tables.
4. The pair-wise method of user groups in a pair-wise non-orthogonal cognitive radio network of claim 3, wherein the pair-wise method further comprises:
if all authorized users find out satisfactory matching objects, the preference form of the cognitive user is empty, namely the matching pair of the existing authorized users and the cognitive user reaches a stable state, and the following steps are executed: the matching pair formed by the authorized user and the cognitive user can communicate by using the NOMA technology; under the mutual-winning pairing condition, the authorized user can obtain more rates, and meanwhile, the cognitive user can obtain the benefit of transmission together with the cognitive user.
And if not, returning to execute the 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 | |
| Huynh et al. | Joint computational offloading and data-content caching in NOMA-MEC networks | |
| CN108040364A (en) | Channel width and the linear search method of power joint distribution in non-orthogonal multiple link | |
| CN108156596B (en) | Method for supporting D2D-cellular heterogeneous network combined user association and content caching | |
| CN107466069A (en) | Efficiency optimization method based on dual link and non-orthogonal multiple access in wireless network | |
| CN108063632B (en) | Energy efficiency-based cooperative resource allocation method in heterogeneous cloud access network | |
| CN106792451B (en) | D2D communication resource optimization method based on multi-population genetic algorithm | |
| CN104038945B (en) | A kind of isomery cellular network efficiency optimization method based on independent sets | |
| CN106162846A (en) | A kind of two users NOMA descending efficiency optimization method considering SIC energy consumption | |
| CN107302801B (en) | QoE-oriented double-layer matching game method in 5G mixed scene | |
| CN107708157A (en) | Intensive small cell network resource allocation methods based on efficiency | |
| CN106454920A (en) | Resource allocation optimization algorithm based on time delay guarantee in LTE (Long Term Evolution) and D2D (Device-to-Device) hybrid network | |
| CN111031547A (en) | Multi-user D2D communication resource allocation method based on spectrum allocation and power control | |
| CN109699083A (en) | A kind of power distribution method of the non-orthogonal multiple access technology based on multi-user | |
| CN108990160B (en) | 5G communication system capacity optimization method based on improved bat algorithm | |
| CN115568024A (en) | Wireless channel matching method facing edge calculation | |
| CN110677175A (en) | Sub-channel scheduling and power distribution joint optimization method based on non-orthogonal multiple access system | |
| CN104796991B (en) | The resource allocation methods of OFDMA system based on gesture game | |
| Euttamarajah et al. | Energy-efficient joint power allocation and energy cooperation for hybrid-powered comp-enabled HetNet | |
| CN106792480A (en) | D2D communication resource distribution algorithms based on cellular network | |
| CN110474701A (en) | User group is to method in nonopiate cognitive radio networks based on pairing opinion | |
| Xu et al. | Optimal bandwidth allocation with edge computing for wireless VR delivery | |
| Yan et al. | An adaptive subcarrier, bit and power allocation algorithm for multicell OFDM systems | |
| CN111343721A (en) | D2D distributed resource allocation method for maximizing generalized energy efficiency of system | |
| CN110300412B (en) | Game theory-based resource allocation method in non-orthogonal cognitive radio 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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20191119 |
|
| RJ01 | Rejection of invention patent application after publication |