CN107466042B - Cognitive radio network spectrum allocation method for channel duration - Google Patents

Cognitive radio network spectrum allocation method for channel duration Download PDF

Info

Publication number
CN107466042B
CN107466042B CN201710749719.9A CN201710749719A CN107466042B CN 107466042 B CN107466042 B CN 107466042B CN 201710749719 A CN201710749719 A CN 201710749719A CN 107466042 B CN107466042 B CN 107466042B
Authority
CN
China
Prior art keywords
matrix
available
channel
color
duration
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.)
Active
Application number
CN201710749719.9A
Other languages
Chinese (zh)
Other versions
CN107466042A (en
Inventor
齐小刚
张权
刘立芳
高蓉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xidian University
Original Assignee
Xidian University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Xidian University filed Critical Xidian University
Priority to CN201710749719.9A priority Critical patent/CN107466042B/en
Publication of CN107466042A publication Critical patent/CN107466042A/en
Application granted granted Critical
Publication of CN107466042B publication Critical patent/CN107466042B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/14—Spectrum sharing arrangements between different networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA

Abstract

The invention belongs to the technical field of cognitive radio, and discloses a cognitive radio network spectrum allocation method of channel duration, which comprises the following steps: initializing a system and a matrix to obtain an interference matrix C, a channel available matrix L and a channel available probability matrix P corresponding to the interference matrix C and the channel available matrix L, and initializing an allocation matrix A to be a zero matrix; calculating the mark of each node n according to the marking rule; selecting a node n with the maximum mark value, selecting a mark value with a smaller number of interference neighbors, and coloring the node n by using a color corresponding to the mark; updating the topology: deleting the available color list in the node n, and deleting the color m from the available color list in the neighbor node which is interfered with the node n; it is determined whether the nodes are all colored or whether the list of available colors in the node is empty. The invention prolongs the duration of the spectrum allocation result in the CRN; the duration of spectrum allocation in the CRN is extended.

Description

Cognitive radio network spectrum allocation method for channel duration
Technical Field
The invention belongs to the technical field of cognitive radio, and particularly relates to a cognitive radio network frequency spectrum allocation method for channel duration.
Background
Wireless technology promotes the progress of various wireless applications and devices, so that the use amount of frequency spectrum resources is exponentially improved, and the frequency spectrum resources become more scarce; while at the same time making spectrum resources unable to meet the ever-increasing demand. The cognitive radio concept can improve the utilization efficiency of frequency spectrum and reduce the waste of frequency spectrum. The FCC has also allowed service providers to open television broadcast bands to unauthorized users, such as WLAN and WiFi. In 2004, the first wireless network standard, the IEEE 802.22 protocol standard, was announced by the IEEE. The whole CR network comprises a primary user and a secondary user, wherein the primary user is also called an authorized user and has own authorized spectrum, and the secondary user is called an unauthorized user and can opportunistically access the authorized spectrum on the premise of not causing interference to the primary user through a CR technology. The spectrum allocation is not only an important component in the cognitive radio network spectrum management, but also a key component for reducing network interference. The existing spectrum allocation algorithm mainly aims to include the following steps: maximizing the total bandwidth sum, maximizing fairness or maximizing access spectrum (solving the phenomenon of user 'hunger') and maximizing user satisfaction on the premise of meeting user requirements. The CSGC algorithm mainly considers optimization objective functions such as maximum bandwidth sum and fairness, and does not consider the availability probability of a channel to a user and the duration of the channel to a secondary user. If the availability probability of a channel is very low and the available duration is very low, when the user is about to use the channel for transmission, the loss or delay of the network is caused because the transmission time is not reached, and the whole CRN is unstable due to the frequent channel allocation process of the whole CR network. The distributed channel allocation algorithm based on service and channel classification mainly considers the objective function of the user satisfaction rate, allocates channels which just meet the user rate requirement to secondary users as far as possible, and optimizes the objective functions to be the same and belong to a parallel algorithm, thereby reducing the complexity of the algorithm and the time for channel allocation in a CRN; the optimization objective function is to minimize interference between secondary users, and also does not take into account the probability of availability of a channel to a user and the duration of availability of a channel to a secondary user. The objective function only considers the efficiency of spectrum allocation, but does not consider the reliability and stability of spectrum allocation.
In summary, the problems of the prior art are as follows: the Cognitive Radio Network (CRN) is composed of a Primary User (PU) and a Secondary User (SU), which causes interruption or delay of SU communication when the PU retrieves a channel being used by the SU, and when the available duration of the channel to the secondary user is very low and the available probability of the channel is not considered in the process of spectrum allocation, the user may cause packet loss or delay of the network due to insufficient transmission time when the user is using the channel for transmission, and thus the whole CRN may continuously perform the process of spectrum allocation, so that the whole CRN becomes unstable and reliable. When the channel with longer available duration is used, the whole channel allocation result is maintained for a longer time, so that the frequency of frequency spectrum allocation is reduced by changing the direction, and the stability of the whole CRN is enhanced.
Disclosure of Invention
Aiming at the problems in the prior art, the invention provides a cognitive radio network spectrum allocation method for channel duration.
The invention is realized in such a way that a cognitive radio network spectrum allocation method of channel duration comprises the following steps:
initializing a system and a matrix to obtain an interference matrix C, a channel available matrix L and a channel available probability matrix P corresponding to the channel available matrix L, and initializing an allocation matrix A to be a zero matrix;
calculating the mark of each node n according to a mark rule, and determining a color m corresponding to the mark direction;
step three, selecting the node n with the maximum mark value, and if the node n with the same maximum mark value has the same maximum mark value, selecting the mark value with smaller number of interference neighbors, and coloring the node n by using the corresponding color of the mark;
step four, updating the topology: deleting the available color list in the node n, and deleting the color m from the available color list in the neighbor node which is interfered with the node n;
step five, judging whether all the nodes are colored or whether the available color list in the nodes is empty: if all nodes are colored or the available color list in the nodes is empty, the distribution stops and the final effective distribution matrix A and the objective function value corresponding to the effective distribution matrix are output; if the nodes are not all colored and the available color list in the node is not an empty set, then jump to step three.
Further, the available probability calculation formula of each channel of the radio network model of the cognitive radio network spectrum allocation method of the channel duration is as follows:
pi＝MAX_TIMEoff/MAX_TIMEon+MAX_TIMEoff；
wherein MAX _ TIMEonMaximum duration, MAX _ TIME, for characterizing the PU channel stays ONoffCharacterizing a maximum duration that the PU channel stays in the OFF state; availability of channel i to all secondary users is piA 0-1 vector generated for the probability.
Further, the spectrum allocation model of the cognitive radio network spectrum allocation method for the channel duration defines bits:
(1) available channel matrix L ═ Ln,m|ln,m∈{0,1}}N×M，pn,mNot equal to 0, then ln,mCharacterizing a channel m with a probability p for a user i ═ 1iCan be used; p is a radical ofn,m1 when equal to 0n,m0, indicating that channel m is unavailable to user n;
(2) interference constraint matrix C ═ { C | Cn,k,m∈{0,1}}N×N×M，cn,k,mCharacterizing that secondary user n and secondary user k are interference on channel m as 1, and when n is k, cn,k,m＝1-ln,mDetermined by the available channel matrix;
(3) available channel duration matrix T ═ Tn,m}N×MIf l isn,m＝1，tn,mUniformly and randomly changing values from [0, MAX _ TIMEoff]Upper selection, tn,m＝0，MAX_TIMEoffCharacterizing a maximum time that the channel stays in the OFF state;
(4) interference-free efficient allocation matrix a ═ an,m|an,m∈{0,1}}N×MIf channel m is allocated to user n, then an,m1 and the interference-free allocation needs to satisfy all interference conditions determined by C, the constraint problem is formulated as:
Figure BDA0001390862430000031
ΛN,Mthe allocation matrix is characterized so as to satisfy no interference;
(5) an allocation matrix B ═ B of the available duration corresponding to the allocation matrix an,m}N×MIf channel m is allocated to user n, then there is bn,m＝tn,mTo have no need forThen bn,m＝0。
Further, the spectrum allocation method for channel duration maximizes the available duration of channels that have been allocated to all secondary users without interference:
Figure BDA0001390862430000041
the frequency spectrum is distributed as a pair graph G ═ V,EC,Lp) The problem of coloration of (2); where V is the set of vertices of graph G that characterize the secondary users, E represents undirected edges between nodes, ECTo indicate the presence of interference between nodes, LpRepresenting a channel availability probability matrix; the coloring conditions satisfying the constraint conditions are: if there is an edge of color m between any two points, then the two points cannot be simultaneously colored by color m.
Another object of the present invention is to provide a cognitive radio network using the spectrum allocation method for the channel duration.
The invention has the advantages and positive effects that: the difference from the existing allocation algorithm is that the channel with high available time is allocated to the secondary user with the minimum number of interference neighbors based on the available time of the channel to the secondary user, so that the whole spectrum allocation result can be maintained for a longer time, and the process of frequently allocating the channel is avoided. The present invention aims to maximize the duration of the channel allocation results in the CRN, thereby ensuring the reliability and stability of the entire network. The simulation result also proves the effectiveness and superiority of the algorithm provided by the invention. The reliability and stability of the spectrum allocation result in the CRN are ensured, so that a spectrum allocation algorithm based on the available duration of a channel is provided, the spectrum with the high available duration is allocated to the secondary user with the minimum number of interference neighbors as far as possible, so that the duration of the obtained spectrum allocation result is maximum, the frequency of spectrum allocation in the CRN is reduced, the time for maintaining the spectrum allocation result in the CRN is prolonged, and the CRN becomes more reliable and stable.
The method allocates the channel for the cognitive user with the minimum number of interference neighbors, ensures that the channel with high available duration can be allocated to other secondary users, and improves the duration of the spectrum allocation result in the CRN; and allocating the channel with high available duration to the cognitive user, and improving the duration of spectrum allocation in the CRN. Therefore, the system performance of the present invention is much superior to that of the remaining two algorithms, compared to the conventional CSGC algorithm.
Drawings
Fig. 1 is a flowchart of a method for allocating a spectrum of a cognitive radio network for a channel duration according to an embodiment of the present invention.
Fig. 2 is a flowchart of an implementation of a method for allocating a frequency spectrum of a cognitive radio network for channel duration according to an embodiment of the present invention.
Fig. 3 is a schematic diagram illustrating an influence of an increase in the number of cognitive users on a system in a network according to an embodiment of the present invention.
Fig. 4 is a schematic diagram illustrating an effect of an increase in the number of available channels on the system in the network according to the embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail with reference to the following embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
The following detailed description of the principles of the invention is provided in connection with the accompanying drawings.
As shown in fig. 1, the method for allocating a spectrum of a cognitive radio network with channel duration provided in the embodiment of the present invention includes the following steps:
s101: initializing a system and a matrix so as to obtain an interference matrix C, a channel available matrix L and a channel available probability matrix P corresponding to the interference matrix C and the channel available matrix L, and initializing an allocation matrix A to be a zero matrix;
s102: calculating the mark of each node n according to a mark rule, and determining the color m corresponding to the mark direction;
s103: selecting a node n having the largest tag value and, if having the same largest tag value, selecting a tag value having a smaller number of interfering neighbors and coloring the node n with the corresponding color for that tag;
s104: updating the topology: deleting the available color list in the node n, and deleting the color m from the available color list in the neighbor node which is interfered with the node n;
s105: judging whether all nodes are colored or whether the available color list in the nodes is empty: if all nodes are colored or the available color list in the nodes is empty, the distribution stops and the final effective distribution matrix A and the objective function value corresponding to the effective distribution matrix are output; if the nodes are not all colored and the available color list in the node is not an empty set, then jump to S103.
The application of the principles of the present invention will now be described in further detail with reference to the accompanying drawings.
1 Spectrum Allocation model
1.1 CRN model
The CRN network includes N secondary users, M channels, and the N secondary users share the M channels. Each primary user has exclusive possession of this channel. The pattern of channels occupied by PUs follows an ON-OFF TIME distribution, i.e., each PU channel is randomly shifted ON and OFF and the TIME each PU channel stays in the ON and OFF states may be at [0, MAX _ TIME ], respectivelyon]And [0, MAX _ TIMEoff]The available probability for each channel may be calculated as:
pi＝MAX_TIMEoff/MAX_TIMEon+MAX_TIMEoff；
wherein MAX _ TIMEonMaximum duration, MAX _ TIME, for characterizing the PU channel stays ONoffThe maximum duration that the PU channel stays in the OFF state is characterized. Availability of channel i to all secondary users is piA 0-1 vector generated for the probability. It is assumed that each secondary user can only be allocated one channel at most.
1.2 Spectrum Allocation model
The mathematical model of the spectrum allocation can be represented by several matrices. And the model assumes that the environmental conditions during the execution of the spectrum allocation are static, such as the location of the user, the available channels, etc.; the definition of the spectrum allocation model is as follows:
(1) available channel matrix L ═ Ln,m|ln,m∈{0,1}}N×MIf p isn,mNot equal to 0, then ln,mCharacterizing a channel m with a probability p for a user i ═ 1iCan be used; otherwise, thenn,m0, indicating that channel m is unavailable to user n.
(2) Interference constraint matrix C ═ { C | Cn,k,m∈{0,1}}N×N×M，cn,k,mCharacterizing that secondary user n and secondary user k are interfering on channel m at 1, and when n is k, cn,k,m＝1-ln,mDetermined by the available channel matrices.
(3) Available channel duration matrix T ═ Tn,m}N×MIf l isn,mWhen 1, then tn,mCan be uniformly and randomly selected from [0, MAX _ TIME ]off]Upper selection, tn,m＝0，MAX_TIMEoffThe maximum time the channel stays in the OFF state is characterized.
(4) Interference-free effective allocation matrix a ═ an,m|an,m∈{0,1}}N×MIf channel m is allocated to user n, then an,m1 and the interference-free allocation needs to satisfy all interference conditions determined by C, the constraint problem can be formulated as:
Figure BDA0001390862430000071
ΛN,Mthe characterization is such that a non-interfering allocation matrix is satisfied.
(5) An allocation matrix B ═ B of the available duration corresponding to the allocation matrix an,m}N×MIf channel m is allocated to user n, then there is bn,m＝tn,mOtherwise, then bn,m＝0；
The allocation objective of the present invention is to maximize the available duration of channels that have been allocated to all secondary users without interference:
Figure BDA0001390862430000072
the spectrum allocation problem is abstracted into a pair graph G ═ V, EC,Lp) The problem of coloration of (2); where V is the set of vertices of graph G that characterize the secondary users, E represents undirected edges between nodes, ECTo indicate the presence of interference between nodes, LpRepresenting the channel availability probability matrix. The coloring conditions satisfying the above constraints are: if there is an edge of color m between any two points, the two points cannot be simultaneously colored by color m.
2 description of the Algorithm
2.1 improved CSGC Algorithm
2.1.1 Allocation of an objective function
The allocation objective of the present invention is to maximize the available duration of channels that have been allocated to all secondary users without interference: the reliability of spectrum allocation in the CRN is mainly shown in that a channel with long available duration is allocated to a secondary user as much as possible, so that the reliability and stability of the CRN are better ensured, and the allocation objective function should obtain a maximum value.
2.1.2 description of the Algorithm
How to design the marking rules is critical to the overall algorithm in order to achieve an optimized objective function that maximizes the available duration of channels that have been allocated to all secondary users. Marking rules based on the available duration of the available channels:
Figure BDA0001390862430000081
Figure BDA0001390862430000082
and preferentially distributing channels for the users with the minimum number of the interference neighbors so as to avoid that more users cannot share the same channel after the users with the large number of the interference neighbors obtain the channels.
The detailed steps of the algorithm are shown in fig. 2:
step.1, initializing a system and a matrix to obtain an interference matrix C, a channel available matrix L and a channel available probability matrix P corresponding to the interference matrix C and the channel available matrix L, and initializing an allocation matrix A to be a zero matrix;
step.2, calculating the mark of each node n according to the mark rule, and determining the color m corresponding to the mark direction;
step.3, selecting the node n with the maximum mark value, and if the node n has the same maximum mark value, selecting the mark value with the smaller number of interference neighbors, and coloring the node n by the corresponding color for the mark;
step.4 updating the topology: deleting the available color list in the node n, and deleting the color m from the available color list in the neighbor node which is interfered with the node n;
step.5 judges whether the node is all colored or the list of available colors in the node is empty: if all nodes are colored or the available color list in the nodes is empty, the distribution stops and the final effective distribution matrix A and the objective function value corresponding to the effective distribution matrix are output; if the node is not fully colored and the list of available colors in the node is not an empty set, jump to step.3.
The application effect of the present invention will be described in detail with reference to the simulation.
1 simulation results
MATLAB simulation software is used for simulation, and simulation contrast analysis is respectively carried out on available duration (target function) of spectrum allocation results in the cognitive radio network by using a random rule algorithm (random), a traditional CSGC algorithm and the modified CSGC algorithm provided by the invention. N secondary users sharing M available channels are randomly distributed in a 1000 × 1000 simulation area, and the detailed settings of simulation parameters are shown in table 1. Next, the system performance under the two conditions of the increase of the number N of cognitive users and the increase of the number M of available channels is compared and analyzed.
Table 1 simulation parameter settings
Figure BDA0001390862430000091
The case where the number N of cognitive users in the network increases is shown in fig. 3. Setting the initial value of N as 10, increasing the value to 30 by the step length of 5, and M is 10, corresponding to each value of N, randomly generating 1000 topological structures by using a Monte Carlo method, and cumulatively calculating 1000 times to obtain an average value. Simulation results show that compared with the traditional CSGC algorithm and the random rule marking algorithm, the algorithm provided by the invention can increase the duration of the spectrum allocation result, and the modified CSGC algorithm provided by the invention can allocate channels with high available duration to secondary users, thereby increasing the reliability and stability of the CRN. The reason why the available duration of the channels allocated to the users decreases as N increases is that as the number of users increases, the channels become relatively sparse with respect to the users, and therefore channels having a smaller available time for the users must also be allocated to the users.
The situation where the number M of available channels in the network increases is shown in figure 4. Setting the initial value of M as 10, gradually increasing to 30 by the step length of 5, setting N as 10, randomly generating 1000 topological structures corresponding to each M value by using a Monte Carlo method, and cumulatively calculating 1000 times to obtain an average value. Simulation results show that the available duration of the channels allocated to the users is increased along with the increase of the number M of the available channels, but compared with the traditional CSGC algorithm and the random rule marking algorithm, the algorithm provided by the invention can increase the available duration of the channels allocated to the users more, so that the reliability and stability of channel allocation results in the whole CRN network can be ensured better.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents and improvements made within the spirit and principle of the present invention are intended to be included within the scope of the present invention.

Claims (1)

1. A method for allocating a channel duration cognitive radio network frequency spectrum is characterized by comprising the following steps:
initializing a system and a matrix to obtain an interference matrix C, a channel available matrix L and a channel available probability matrix P corresponding to the interference matrix C and the channel available matrix L, and initializing an allocation matrix A to be a zero matrix;
step two, calculating the mark of each user n according to the mark rule, and determining the color m corresponding to the mark;
step three, selecting the node n ' with the maximum mark value, and if the node n ' with the same maximum mark value has the same maximum mark value, selecting the mark value with smaller number of interference neighbors, and coloring the node n ' by using the corresponding color of the mark;
step four, updating the topology: deleting the available color list in the node n ', and deleting the color m from the available color list in the neighbor node which is interfered with the node n';
step five, judging whether all the nodes are colored or whether the available color list in the nodes is empty: if all nodes are colored or the available color list in the nodes is empty, the distribution stops and the final effective distribution matrix A and the objective function value corresponding to the effective distribution matrix are output; if the nodes are not all colored and the available color list in the nodes is not an empty set, jumping to the third step;
the available probability calculation formula of each channel of the radio network model of the frequency spectrum allocation method of the channel duration is as follows:
pi＝MAX_TIMEoff/MAX_TIMEon+MAX_TIMEoff；
wherein MAX _ TIMEonCharacterizing the maximum duration of TIME that the PU channel is to stay ON, MAX _ TIMEoffCharacterizing a maximum duration of time that the PU channel is to be in the OFF state; availability of channel i to all secondary users is piA 0-1 vector generated for probability;
the spectrum allocation model of the spectrum allocation method of the channel duration is defined as:
(1) channel availability matrix L ═ Ln,m|ln,m∈{0,1}}N×M，ln,m1, the token color m is given p to the user niIs available as a probability; ln,m0, meaning that color m is not available to user n; the number of available channels M and the number N of cognitive users in the network;
(2) interference constraint matrix C ═ { C | Cn,k,m∈{0,1}}N×N×M，cn,k,mCharacterizing that secondary user n and secondary user k are interferences in color m, and when n-k, cn,k,m＝1-ln,mDetermined by the channel availability matrix;
(3) available channel duration matrix T ═ Tn,m}N×MIf l isn,m＝1，tn,mUniformly and randomly changing values from [0, MAX _ TIMEoff]Selecting;
(4) interference-free efficient allocation matrix a ═ an,m|an,m∈{0,1}}N×MIf a color m is assigned to user n, then an,m1 and the interference-free allocation needs to satisfy all interference conditions determined by C, the constraint problem is formulated as:
Figure FDA0002958635340000021
ΛN,Mcharacterizing all allocation matrices that satisfy no interference;
(5) an allocation matrix B ═ B of the available duration corresponding to the allocation matrix an,m}N×MIf a color m is assigned to user n, then there is bn,m＝tn,mOtherwise, then bn,m＝0；
The spectrum allocation method of the channel duration maximizes the available duration of the channels which have been allocated to all secondary users without interference:
Figure FDA0002958635340000022
the frequency spectrum is distributed as (V, E) to graph GC,Lp) The problem of coloration of (2); where V is the set of vertices of graph G that characterize the secondary users, E represents undirected edges between nodes, ECTo indicate the presence of interference between nodes, LpRepresenting a channel availability probability matrix; the coloring conditions satisfying the constraint conditions are: if an edge with the color m exists between any two points, the two points cannot be simultaneously colored by the color m;
marking rules based on the available duration of the available channels:
labeln＝max tn,m；
colorn＝arg max tn,m；
and preferentially distributing channels for the user with the minimum number of interference neighbors.
CN201710749719.9A 2017-08-28 2017-08-28 Cognitive radio network spectrum allocation method for channel duration Active CN107466042B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710749719.9A CN107466042B (en) 2017-08-28 2017-08-28 Cognitive radio network spectrum allocation method for channel duration

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710749719.9A CN107466042B (en) 2017-08-28 2017-08-28 Cognitive radio network spectrum allocation method for channel duration

Publications (2)

Publication Number Publication Date
CN107466042A CN107466042A (en) 2017-12-12
CN107466042B true CN107466042B (en) 2021-06-15

Family

ID=60549414

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710749719.9A Active CN107466042B (en) 2017-08-28 2017-08-28 Cognitive radio network spectrum allocation method for channel duration

Country Status (1)

Country Link
CN (1) CN107466042B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102572850A (en) * 2012-03-27 2012-07-11 哈尔滨工业大学 Spectrum allocation method based on operating state switching of authorized user in cognitive radio
CN103179633A (en) * 2012-12-28 2013-06-26 重庆邮电大学 Joint channel allocation cognitive radio network routing method
KR101444904B1 (en) * 2013-03-21 2014-09-26 경희대학교 산학협력단 Channel allocation device for cognitive radio network, method and system thereof
CN104426620A (en) * 2013-09-11 2015-03-18 中兴通讯股份有限公司 Broadband frequency spectrum sensing method and broadband frequency spectrum sensing device

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102572850A (en) * 2012-03-27 2012-07-11 哈尔滨工业大学 Spectrum allocation method based on operating state switching of authorized user in cognitive radio
CN103179633A (en) * 2012-12-28 2013-06-26 重庆邮电大学 Joint channel allocation cognitive radio network routing method
KR101444904B1 (en) * 2013-03-21 2014-09-26 경희대학교 산학협력단 Channel allocation device for cognitive radio network, method and system thereof
CN104426620A (en) * 2013-09-11 2015-03-18 中兴通讯股份有限公司 Broadband frequency spectrum sensing method and broadband frequency spectrum sensing device

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
认知无线电中基于图论的频谱分配算法研究;傅小玲;《万方学位论文》;20131231;第2.3.1、3.2节 *

Also Published As

Publication number Publication date
CN107466042A (en) 2017-12-12

Similar Documents

Publication Publication Date Title
US8451862B2 (en) Systems and methods for resource allocation serving communication requirements and fairness
Zhao et al. Robust topology control in multi-hop cognitive radio networks
JP6442763B2 (en) Spectrum sharing in the blank band using joint power control and channel assignment
JP2007528134A (en) Adjusting how radio resources are used in unlicensed frequency bands
CN107750056B (en) Interference reduction method in ultra-dense network
Bahrak et al. Coexistence decision making for spectrum sharing among heterogeneous wireless systems
Shigueta et al. A strategy for opportunistic cognitive channel allocation in wireless Internet of Things
CN113630886B (en) Spectrum allocation method based on particle swarm algorithm in heterogeneous Internet of things
Mansoor et al. Spectrum aware cluster-based architecture for cognitive radio ad-hoc networks
Junior et al. ZAP: a distributed channel assignment algorithm for cognitive radio networks
Halloush et al. Availability-aware channel allocation for multi-cell cognitive radio 5G networks
GB2465756A (en) Spectrum allocation in cognitive radio networks
CN107466042B (en) Cognitive radio network spectrum allocation method for channel duration
CN110049436B (en) Distributed channel allocation and sharing method and system based on heterogeneous spectrum
Keshavamurthy et al. Multiplexing analysis for dynamic spectrum access
Yadav et al. k-Channel connected topology control algorithm for cognitive radio networks
Naghsh et al. GenS: A new conflict-free link scheduler for next generation of wireless systems
Plummer Jr et al. Measurement based capacity scavenging via whitespace modeling in wireless networks
Sorayya et al. The model of spectrum sharing between a primary and two secondary operators
Pei et al. Dynamic spectrum assignment for white space devices with dynamic and heterogeneous bandwidth requirements
Hernández et al. Multichannel allocation spectrum model with fairness criterion for cognitive radio networks
Yen et al. Link-preserving channel assignment game for wireless mesh networks
Yadav et al. κ‐channel connectivity in cognitive radio networks for bounded tree‐width graphs
SHARMA et al. HYPERGRAPH COLORING BASED ALGORITHM FOR CHANNEL ALLOCATION
Zhao et al. Graph-theoretic cooperative spectrum allocation in distributed cognitive networks using bipartite matching

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
GR01 Patent grant
GR01 Patent grant