CN104185283A - Self-adaptive method for multi-channel assignment in cognitive radio network - Google Patents
Self-adaptive method for multi-channel assignment in cognitive radio network Download PDFInfo
- Publication number
- CN104185283A CN104185283A CN201410459877.7A CN201410459877A CN104185283A CN 104185283 A CN104185283 A CN 104185283A CN 201410459877 A CN201410459877 A CN 201410459877A CN 104185283 A CN104185283 A CN 104185283A
- Authority
- CN
- China
- Prior art keywords
- channel
- cognitive
- user
- matrix
- cognitive user
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Abstract
The invention discloses a self-adaptive method for multi-channel assignment in a cognitive radio network. The method mainly solves the problem that an existing method for channel assignment in the cognitive radio network cannot meet the requirement of cognitive users for large bandwidth. The method includes the specific steps that first, a cognitive base station initializes channels assigned to the cognitive users and senses channels occupied by authorized users; second, the cognitive users send user state information and channel gain information to the cognitive base station according to the geographical positions and the bandwidth requirements of the cognitive users and the interference to each authorized user; third, the cognitive base station assigns the channels after receiving the information sent by the cognitive users; fourth, after the assignment is finished, the cognitive base station broadcasts channel assignment information to every cognitive user. Through the method, the requirement of users for large bandwidth can be met, unnecessary bandwidth waste can be avoided, and while the spectral efficiency is improved, it is guaranteed that the channel assigned to each user has high channel quality. The method can be used for assigning channels to cognitive users with disperse geographical positions in the cognitive radio network.
Description
Technical field
The invention belongs to wireless communication field, particularly relate to the adaptive multi-channel distribution method in a kind of cognitive radio networks, for solve cognitive radio networks geographical position disperse cognitive user between Channel Assignment Problems.
Background technology
In recent years, along with the fast development of wireless mobile communications, the scarcity of frequency spectrum resource cannot meet the demand of the growing wireless data service of people.In order to address this is that the radio that has produced a kind of software definition---cognitive radio.It is the frequency spectrum cavity-pocket in aware space dynamically, uses these frequency spectrums, thereby greatly improved the utilance of frequency spectrum under the prerequisite of not disturbing authorized user.In cognition wireless network, in order to coordinate the phase mutual interference between cognitive user, formulate effective spectrum allocation may strategy, for improving, availability of frequency spectrum lifting network performance is most important.
In existing method for channel allocation, major part is all to carry out allocated bandwidth by channel gain, path loss etc., makes the throughput performance in whole network reach maximum.But these methods of salary distribution are not considered the bandwidth demand of each cognitive use, only have the cognitive user that those channel gains are large, path loss is low can assign to desirable channel, fairness is poor.Article F.Wu and J.Chen, " Demand-based spectrum allocation algorithm in multi-cells cognitive radio network ", Computer Applications, vol.28, no.1, Jan 2008, pp.14-16. first spectrum requirement problem is introduced to cognitive radio networks, but just user is divided into different demand levels does not do concrete description to the amount of bandwidth of each user self actual demand yet, can cause like this user's request bandwidth and actual demand bandwidth well not to mate.For this problem, article Wang Y, Wei Z, Du H, et al.A spectrum allocation algorithm based on bandwidth matching and interference avoidance in cognitive radio networks[C] //Personal Indoor and Mobile Radio Communications (PIMRC), 2012IEEE 23rd International Symposium on.IEEE, 2012:950-955. proposed this concept of bandwidth match degree, and with user's request bandwidth and actual grant channel width ratio define this matching degree.Make the user of different bandwidth demand can be assigned to the channel comparatively mating with its demand, the bandwidth of avoiding cognitive user to distribute is far longer than its actual demand, causes " secondary spectrum cavity ".Distribute but this method is only applicable to single channel, can not well take into account the cognitive user of different bandwidth demand, for the user who has large bandwidth demand, single channel can not meet its actual demand.
Summary of the invention
The object of the invention is to the deficiency for above-mentioned prior art, adaptive multi-channel distribution method in a kind of cognitive radio networks has been proposed, owing to having adopted new bandwidth fitting function in the method, therefore can be for different bandwidth demands the adaptive channel number regulating and distributing, can in the bandwidth demand that meets different user reality, reduce extra bandwidth loss.
For achieving the above object, technical scheme of the present invention comprises the steps:
(1) the cognitive base station in community, the channel that cognitive user is distributed carries out initialization, and the channel that the each authorized user of perception is shared is determined the bandwidth w that each authorized user uses
c, and obtain the channel gain information of cognitive user in community | h
n,c| and user state information, i.e. the relative position coordinates L of cognitive user
n(x, y), the cognitive user interfere information { U} to authorized user
n, cognitive user bandwidth demand b
n, the numbering that n is cognitive user;
(2) cognitive base station, according to user state information, judges whether each authorization channel can be used each cognitive user, and generates available channel matrix A;
(3) authorization channel simultaneously available to multiple cognitive user, according to cognitive user relative position coordinates, judges whether multiplexing this channel of cognitive user can produce phase mutual interference, and generates interference matrix I;
(4) the financial value B of each cognitive user on its available channel calculated in cognitive base station
n,c:
(4a) calculate the degree of fitting of cognitive user on its available channel
be the demand bandwidth value b of n cognitive user
nactual bandwidth value w with authorization channel c
cfitting degree, α is bandwidth constraint condition (α ∈ (0,1]);
(4b) utilize degree of fitting
calculate user's financial value B by following formula
n,c:
B
n,crepresent the financial value of n cognitive user on channel c, | h
n,c| characterize the link gain of n cognitive user on channel c, D
n,ccharacterize user n user summation noisy with it on channel c, D
n,c=sum (I (n:, c));
(5) when obtaining after whole financial values, cognitive base station is to financial value maximum cognitive user n allocated channel c, if there are multiple cognitive user to reach this maximum return value simultaneously, cognitive user of random selection is therein distributed, judge whether this allocated bandwidth has met the bandwidth demand of this cognitive user: if meet bandwidth demand, available matrix A and interference matrix I are upgraded, obtain upgrade after available matrix A ', interference matrix I'; If do not meet bandwidth demand, first calculate this user's bandwidth demand surplus, then to available matrix A, interference matrix I and bandwidth demand b
nupgrade, obtain upgrade after available matrix A ', interference matrix I', wide demand b
n';
(6) cognitive base station makes the following judgment according to the result after upgrading:
(6.1) according to upgrade after available channel matrix A ', judge whether to still have available channel not to be assigned with, if without assignable channel finish distribute, if still have assignable channel, execution (6.2);
(6.2) according to the bandwidth demand value b of each cognitive user
n, judge whether that the bandwidth demand of all cognitive user all meets, if cognitive user demand all meets, finish to distribute, if do not satisfy the demands, return to (4).
The present invention has the following advantages:
1. the present invention proposes a kind of new cognitive radio networks method for channel allocation, it is a kind of interactively method of salary distribution.By the information interaction of cognitive user and cognitive base station, many cognitive user, the glitch-free allocated bandwidth of multichannel are realized.
2. the present invention proposes a kind of definition of new bandwidth fitting function, this function can characterize over-fitting, owe matching and this three state of Accurate Curve-fitting, and can control dynamically matching permissible accuracy according to the oneself requirement of network.Avoid the waste of bandwidth by the constraint of bandwidth fitting function, under limited bandwidth resources restriction, cognitive radio networks can carry more cognitive user.
Brief description of the drawings
Fig. 1 is the cognitive radio networks system model figure that the present invention uses;
Fig. 2 is realization flow figure of the present invention;
Fig. 3 is the sub-process figure of the channel allocation in the present invention;
Fig. 4 is the exemplary plot of traditional adaptation function;
Fig. 5 is the exemplary plot of bandwidth match fitting function of the present invention.
Embodiment
With reference to Fig. 1, the cognitive radio networks system that the present invention uses, is made up of 1 authorized base station, 1 cognitive base station, multiple authorized user and multiple cognitive user.Wherein, each authorized user uses oneself authorization channel and authorized base station to communicate.Cognitive user, not disturbing under the prerequisite of authorized user proper communication, can access these authorization channels, completes the communication requirement of oneself.
With reference to Fig. 2, specific embodiment of the invention is as follows:
Step 1: the preparation of channel allocation is carried out in cognitive base station, community:
First the channel, cognitive user being distributed carries out initialization;
Secondly, the channel that the each authorized user of perception is shared, determines the bandwidth w that each authorized user uses
c;
Finally, broadcast access permission information, informs that each cognitive user allows access present networks, and sends training sequence, in order to carry out the estimation of channel information.
Step 2: cognitive user is received after the License Info and training sequence of cognitive base station, carries out the feedback operation of relevant information.
2.1) cognitive user is received perception surrounding environment after the License Info of cognitive base station, determines in its interference range in which authorized user, and generates the interfere information { U} of cognitive user to authorized user
n; The demand to bandwidth according to self again, generates bandwidth demand information b
n, and according to self residing geographical position, generate cognitive user relative position coordinates L
n(x, y);
2.2) cognitive user, according to the training sequence of receiving, is calculated self channel gain to cognitive base station | h
n,c|;
2.3) cognitive user by cognitive user the interfere information { U} to authorized user
n, bandwidth demand information b
n, cognitive user relative position coordinates L
n(x, y) and channel gain | h
n,c|, send to cognitive base station.
Step 3: cognitive base station is received after the information of cognitive user transmission, carried out the generation work of the channel allocation correlation matrix used of cognitive user:
(3.1) interfere information { U} to authorized user according to each cognitive user
n, when cognitive user n insertion authority channel c is determined in cognitive base station, whether can disturb using the authorized user of this authorization channel to produce: disturb if produce, cognitive user n can not use this authorization channel c, otherwise cognitive user n can use this authorization channel c;
(3.2) cognitive base station generates available channel matrix A, is used for recording the operable authorization channel of each cognitive user:
Unavailable to cognitive user n as channel c, make the capable c column element of n in available channel matrix A equal 0, i.e. A (n, c)=0;
When channel c can use cognitive user n, make the capable c column element of n in available channel matrix A equal 1, i.e. A (n, c)=1;
(3.3) according to each user's positional information L
n(x, y) calculates the distance d between cognitive user, and with predefined co-channel interference distance threshold d
threlatively, judge whether different cognitive user i and cognitive user j can produce co-channel interference: if the distance d of cognitive user i and cognitive user j is less than co-channel interference distance threshold d
th, when they use similar frequency bands, can produce co-channel interference, otherwise, co-channel interference can not produced;
(3.4) cognitive base station generates interference matrix I, is used for recording different cognitive user i and the disturbed condition of cognitive user j in the time using channel c:
If generation co-channel interference, the element that makes the capable j of i of interference matrix I be listed as c dimension equals 1, I (i, j, c)=1;
If do not produce co-channel interference, the element that makes the capable j of i of interference matrix I be listed as c dimension equals 0, I (i, j, c)=0;
For the i situation equal with j in matrix I (i, j, c), expression be cognitive user and the disturbed condition of self, because cognitive user can not cause interference to self when the use channel, therefore all make I (i, j, c)=0.
Channel allocation is carried out according to available channel matrix A and interference matrix I in the cognitive base station of step 4:
With reference to Fig. 3, being implemented as follows of this step:
4.1) the financial value B of each cognitive user on its available channel calculated in cognitive base station
n,c:
4.1.1) degree of fitting of cognitive user on its available channel calculated in cognitive base station
be the demand bandwidth value b of n cognitive user
nactual bandwidth value w with authorization channel c
cfitting degree,
larger, show the bandwidth demand value b of cognitive user
nwith actual grant channel width value w
cmore approaching, on the contrary bandwidth demand value b
nwith actual grant channel width value w
cmore depart from; α is bandwidth constraint condition (α ∈ (0,1]); α is less, and this fitting function requires lower to the accuracy of bandwidth match, otherwise requires higher to bandwidth match accuracy;
Compared with traditional adaptation function, the bandwidth match fitting function in the present invention, applicable to all matching states, is worked as b
n< w
nfor owing matching state, b
n> w
nfor over-fitting state, under both of these case
work as b
n=w
nfor Accurate Curve-fitting state, now
in addition, equal 0.8 as example taking bandwidth match degree of fitting, as can be seen from Figure 4, at traditional adaptation function
in along with authorization channel bandwidth value w
cbe increased to 10 unit bandwidths from 5 unit bandwidths, demand bandwidth value b
nwith authorization channel bandwidth value w
cbetween bandwidth match error increase to 2 unit bandwidths from 1 unit bandwidth, like this at authorization channel bandwidth value w
cin situation about constantly increasing, even under higher coupling degree of fitting, still can produce very large matching error; As can be seen from Figure 5, the bandwidth match fitting function in the present invention, for fixing coupling degree of fitting
bandwidth match error can't be with authorization channel bandwidth value w
cincrease and become large, therefore can reflect more accurately the bandwidth demand value b of cognitive user
nwith actual grant channel width value w
cfitting degree;
4.1.2) cognitive base station utilizes degree of fitting
calculate the financial value B of cognitive user on its available channel by following formula
n,c:
Wherein, B
n,crepresent the financial value of n cognitive user on channel c, | h
n,c| characterize the link gain of n cognitive user on channel c, | h
n,c| the larger explanation now quality of channel c is better.D
n,ccharacterize user n user summation noisy with it on channel c, D
n,c=sum (I (n:, c)); Financial value B
n,clarger, represent that user n is higher at the degree of fitting of channel c, channel gain is larger, simultaneously less with the interference of other cognitive user;
4.2) at all financial value B
n,cmiddle search has the user n of maximum return value to its allocated channel c, if there are multiple cognitive user to reach this maximum return value simultaneously, cognitive user of random selection is therein distributed;
4.3) judge whether this allocated bandwidth has met the bandwidth demand of this cognitive user, if meet bandwidth demand, i.e. w
c>=b
ntime, carry out 4.4); If do not meet bandwidth demand, i.e. w
c< b
ntime, carry out 4.5);
4.4) the capable all elements of n in available channel matrix A is set to 0, i.e. A (n :)=0; Search meets the corresponding sequence number i of I (n, i, c)=1 condition, and the capable c column element of i in available matrix A is set to 0, i.e. A (i, c)=0; The all elements of n row in interference matrix I is all set to 0, i.e. I (:, n :)=0; By this user's bandwidth demand b
nbe set to 0, carry out 4.6);
4.5) the capable c column element of n in available channel matrix A is set to 0, i.e. A (n, c)=0; Search meets the corresponding sequence number i of I (n, i, c)=1 condition, and the capable c column element of i in available matrix A is set to 0, i.e. A (i, c)=0; The all elements that n in interference matrix I is listed as to c dimension is set to 0, i.e. I (:, n, c)=0; The bandwidth demand that upgrades n cognitive user is: b
n'=b
n-w
c, wherein wc is the channel width value of having distributed to user n, carries out 4.6);
4.6) cognitive base station judges whether to still have available channel not to be assigned with, if the available channel matrix A after upgrading ', for full 0 matrix, explanation has not had available authorization channel for cognitive user, finish to distribute, if the available channel matrix A after upgrading ' be not full 0 matrix, explanation still has assignable channel, carries out 4.7);
4.7) cognitive base station is according to the bandwidth demand value b of each cognitive user
n, judge whether that the bandwidth demand of all cognitive user all meets, if bandwidth demand value b
nbe 0 entirely, represent that the demand of cognitive user all meets, finish to distribute, if bandwidth demand value b
nbe not 0 entirely, represent to still have the demand of cognitive user not to be satisfied, return to (4.1).
Step 5: the assignment information of bandwidth is broadcast to the cognitive user in network by cognitive base station.
Step 6: cognitive user is received after the message of cognitive base station broadcast, determines its spendable mandate frequency range, and communicates on its corresponding authorized frequency bands.
Above-mentioned steps has been described preferred embodiment of the present invention, and obviously those skilled in the art can make various amendments and replacement to the present invention by reference to preferred embodiment of the present invention and accompanying drawing, within these amendments and replacement all should fall into protection scope of the present invention.
Claims (6)
1. the adaptive multi-channel distribution method in cognitive radio networks, comprises the steps:
(1) the cognitive base station in community, the channel that cognitive user is distributed carries out initialization, and the channel that the each authorized user of perception is shared is determined the bandwidth w that each authorized user uses
c, and obtain the channel gain information of cognitive user in community | h
n,c| and user state information, i.e. the relative position coordinates L of cognitive user
n(x, y), the cognitive user interfere information { U} to authorized user
n, cognitive user bandwidth demand b
n, the numbering that n is cognitive user;
(2) cognitive base station, according to user state information, judges whether each authorization channel can be used each cognitive user, and generates available channel matrix A;
(3) authorization channel simultaneously available to multiple cognitive user, according to cognitive user relative position coordinates, judges whether multiplexing this channel of cognitive user can produce phase mutual interference, and generates interference matrix I;
(4) the financial value B of each cognitive user on its available channel calculated in cognitive base station
n,c:
(4a) calculate the degree of fitting of cognitive user on its available channel
be the demand bandwidth value b of n cognitive user
nactual bandwidth value w with authorization channel c
cfitting degree, α is bandwidth constraint condition (α ∈ (0,1]);
(4b) utilize degree of fitting
calculate user's financial value B by following formula
n,c:
B
n,crepresent the financial value of n cognitive user on channel c, | h
n,c| characterize the link gain of n cognitive user on channel c, D
n,ccharacterize user n user summation noisy with it on channel c, D
n,c=sum (I (n:, c));
(5) when obtaining after whole financial values, cognitive base station is to financial value maximum cognitive user n allocated channel
cif there are multiple cognitive user to reach this maximum return value simultaneously, cognitive user of random selection is therein distributed, judge whether this allocated bandwidth has met the bandwidth demand of this cognitive user: if meet bandwidth demand, available matrix A and interference matrix I are upgraded, obtain upgrade after available matrix A ', interference matrix I'; If do not meet bandwidth demand, first calculate this user's bandwidth demand surplus, then to available matrix A, interference matrix I and bandwidth demand b
nupgrade, obtain upgrade after available matrix A ', interference matrix I', wide demand b
n';
(6) cognitive base station makes the following judgment according to the result after upgrading:
(6.1) according to upgrade after available channel matrix A ', judge whether to still have available channel not to be assigned with, if without assignable channel finish distribute, if still have assignable channel, execution (6.2);
(6.2) according to the bandwidth demand value b of each cognitive user
n, judge whether that the bandwidth demand of all cognitive user all meets, if cognitive user demand all meets, finish to distribute, if do not satisfy the demands, return to (4).
2. self-adapting distribution method according to claim 1, the wherein described shared bandwidth w of each authorized user of step (1)
c, the bandwidth value that cognitive base station, Shi You community obtains the shared channel of each authorized user in community by frequency spectrum perception generates.
3. self-adapting distribution method according to claim 1, available channel matrix A in wherein said step (2), generates in accordance with the following steps:
(2a) cognitive base station according to each cognitive user of obtaining in step (1) interfere information { U} to authorized user
n, determine whether each cognitive user n can produce and disturb authorized user at c channel:
Disturb if produce, show that cognitive user n cannot use channel c, make the capable c column element of n in available channel matrix A equal 0, A (n, c)=0;
If do not produce interference, show that cognitive user n can use channel c, make the capable c column element of n in available channel matrix A equal 1, A (n, c)=1;
(2b), according to step (2a), finally generate the two-dimentional available channel matrix A of N × C:
Wherein, N represents total number of cognitive user, and C represents total number of authorization channel.
4. self-adapting distribution method according to claim 1, the generation interference matrix I described in its step (3), generates as follows:
(3a) relative position coordinates of each cognitive user in the cognitive user state information of cognitive base station, calculates the distance d between each cognitive user, and with predefined co-channel interference distance threshold d
threlatively, judge whether different cognitive user i and cognitive user j can produce co-channel interference:
If the distance d of cognitive user i and cognitive user j is less than co-channel interference distance threshold d
th, show when they use similar frequency bands to produce co-channel interference, and the element that makes the capable j of i of interference matrix I be listed as c dimension equals 1, I (i, j, c)=1;
If the distance d of cognitive user i and cognitive user j is greater than co-channel interference distance threshold d
th, show when they use similar frequency bands not produce co-channel interference, and the element that makes the capable j of i of interference matrix I be listed as c dimension equals 0, I (i, j, c)=0;
For the i situation equal with j in matrix I (i, j, c), all make I (i, j, c)=0;
(3b), according to step (3a), finally generate the three-dimensional interference matrix I of N × N × C:
Wherein, N represents total number of cognitive user, and C represents total number of authorization channel.
5. self-adapting distribution method according to claim 1, in wherein said step (5), for meeting the renewal to available matrix A and interference matrix I in bandwidth demand situation, carries out as follows:
(5a) the capable all elements of n in available channel matrix A is set to 0, i.e. A (n :)=0; Search meets the corresponding sequence number i of I (n, i, c)=1 condition, and the capable c column element of i in available matrix A is set to 0, i.e. A (i, c)=0, obtain available channel matrix A after upgrading ':
(5b) all elements of n row in interference matrix I is all set to 0, i.e. I (:, n :)=0, obtains the interference matrix I' after upgrading:
(5c) by this user's bandwidth demand b
nbe set to 0.
6. self-adapting distribution method according to claim 1, in wherein said step (5), for not meeting in bandwidth demand situation available matrix A and interference matrix I and bandwidth demand b
nrenewal, carry out as follows:
(5d) the capable c column element of n in available channel matrix A is set to 0, i.e. A (n, c)=0; Search meets the corresponding sequence number i of I (n, i, c)=1 condition, and the capable c column element of i in available matrix A is set to 0, i.e. A (i, c)=0, obtain available channel matrix A after upgrading ':
(5e) all elements that n in interference matrix I is listed as to c dimension is set to 0, i.e. I (:, n, c)=0, obtains the interference matrix I' after upgrading:
(5f) bandwidth demand of n cognitive user of renewal is: b
n'=b
n-w
c, wherein w
cfor distributing to the channel width value of user n.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410459877.7A CN104185283B (en) | 2014-09-05 | 2014-09-05 | Adaptive multi-channel distribution method in cognitive radio networks |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410459877.7A CN104185283B (en) | 2014-09-05 | 2014-09-05 | Adaptive multi-channel distribution method in cognitive radio networks |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104185283A true CN104185283A (en) | 2014-12-03 |
| CN104185283B CN104185283B (en) | 2018-04-10 |
Family
ID=51965934
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410459877.7A Active CN104185283B (en) | 2014-09-05 | 2014-09-05 | Adaptive multi-channel distribution method in cognitive radio networks |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104185283B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106028364A (en) * | 2016-07-11 | 2016-10-12 | 东南大学 | Virtual cell forming method for 5G high-density network |
| CN107071912A (en) * | 2017-04-17 | 2017-08-18 | 北京星网锐捷网络技术有限公司 | A kind of method and apparatus for distributing channel in a wireless local area network |
| CN109495895A (en) * | 2017-09-10 | 2019-03-19 | 慧与发展有限责任合伙企业 | Channel width selection |
| CN111866979A (en) * | 2020-05-29 | 2020-10-30 | 山东大学 | Base station and channel dynamic allocation method based on multi-arm slot machine online learning mechanism |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102946608A (en) * | 2012-12-11 | 2013-02-27 | 上海电机学院 | Method and device for equitably distributing resources in radio network |
| CN103929819A (en) * | 2014-04-25 | 2014-07-16 | 重庆邮电大学 | Cognitive radio network slave user combination price-fixing and resource distributing method |
-
2014
- 2014-09-05 CN CN201410459877.7A patent/CN104185283B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102946608A (en) * | 2012-12-11 | 2013-02-27 | 上海电机学院 | Method and device for equitably distributing resources in radio network |
| CN103929819A (en) * | 2014-04-25 | 2014-07-16 | 重庆邮电大学 | Cognitive radio network slave user combination price-fixing and resource distributing method |
Non-Patent Citations (1)
| Title |
|---|
| YU WANG, ZAIXUE WEI, HONG LU, LIN SANG, DACHENG YANG: "A spectrum allocation algorithm based on bandwidth matching and interference avoidance in cognitive radio networks", 《2012 IEEE 23RD INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106028364A (en) * | 2016-07-11 | 2016-10-12 | 东南大学 | Virtual cell forming method for 5G high-density network |
| CN107071912A (en) * | 2017-04-17 | 2017-08-18 | 北京星网锐捷网络技术有限公司 | A kind of method and apparatus for distributing channel in a wireless local area network |
| CN107071912B (en) * | 2017-04-17 | 2020-08-21 | 北京星网锐捷网络技术有限公司 | Method and device for distributing channels in wireless local area network |
| CN109495895A (en) * | 2017-09-10 | 2019-03-19 | 慧与发展有限责任合伙企业 | Channel width selection |
| CN109495895B (en) * | 2017-09-10 | 2023-01-03 | 慧与发展有限责任合伙企业 | Channel bandwidth selection |
| CN111866979A (en) * | 2020-05-29 | 2020-10-30 | 山东大学 | Base station and channel dynamic allocation method based on multi-arm slot machine online learning mechanism |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104185283B (en) | 2018-04-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Qian et al. | Multi-operator spectrum sharing for massive IoT coexisting in 5G/B5G wireless networks | |
| Sun et al. | D2D enhanced heterogeneous cellular networks with dynamic TDD | |
| Andrews et al. | A tractable approach to coverage and rate in cellular networks | |
| CN111865398B (en) | Satellite-ground transmission method under large-scale LEO satellite deployment | |
| Gatsis et al. | Power control for cooperative dynamic spectrum access networks with diverse QoS constraints | |
| EP1518338B1 (en) | Method and system for computing the optimal slot to cell assignment in cellular systems employing time division | |
| MX2007016058A (en) | Systems and methods for making channel assignments to reduce interference and increase capacity of wireless networks. | |
| CN104185283A (en) | Self-adaptive method for multi-channel assignment in cognitive radio network | |
| Zhao et al. | A coloring-based cluster resource allocation for ultra dense network | |
| EP2679055A1 (en) | A method and a system for controlling the aggregate interference in cognitive radio networks | |
| Ghorbel et al. | Distributed learning-based cross-layer technique for energy-efficient multicarrier dynamic spectrum access with adaptive power allocation | |
| CN103404210A (en) | Method for determining white space interference margin | |
| CN109327895B (en) | NOMA and CR network-based power distribution method | |
| Song et al. | Game-theoretic resource allocation for full-duplex communications | |
| CN104640117A (en) | Allocation method and device of frequency spectrum resources | |
| Li et al. | A distributed ADMM approach with decomposition-coordination for mobile data offloading | |
| Atakpo et al. | A COMPARATIVE ANALYSIS OF SELFORGANIZING MAP AND K-MEANS MODELS FOR SELECTION OF CLUSTER HEADS IN OUT-OF-BAND DEVICE-TO-DEVICE COMMUNICATION | |
| Guo et al. | Multicast communications in cognitive radio networks using directional antennas | |
| Csercsik et al. | Preallocation-based combinatorial auction for efficient fair channel assignments in multi-connectivity networks | |
| Wei et al. | Dynamic system level frequency spectrum allocation scheme based on cognitive radio technology | |
| Capdevielle et al. | Enhanced resource sharing strategies for LTE picocells with heterogeneous traffic loads | |
| Hößler et al. | Matching-based resource allocation for multi-user URLLC in unlicensed frequency bands | |
| Wang et al. | Primary user activity based channel allocation in cognitive radio networks | |
| Barghikar et al. | Resource allocation for mmWave-NOMA communication through multiple access points considering human blockages | |
| Passiatore et al. | A centralized inter-network resource sharing (CIRS) scheme in IEEE 802.22 cognitive networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |