CN103023592A - Fairness based cognitive radio-frequency spectrum resource management algorithm - Google Patents

Abstract

The invention discloses a fairness based cognitive radio-frequency spectrum resource management algorithm. The fairness based cognitive radio-frequency spectrum resource management algorithm includes the steps of (1) subjecting underutilized or undistributed spectrum resource to channel division according to different network type; (2) describing parameters of the underutilized or undistributed spectrum resource; (3) introducing three variable parameters a, b and c, increasing the a to increase influence of channel width wt which can be obtained currently, obtaining larger total system revenue and reducing distribution fairness at the same time, and increasing the b and the c to improve the distribution fairness and reduce the total system revenue at the same time, wherein total bandwidth W, the channel width wt of the network type t and the channel quantity of the network type t meet the Formula, and the Formula is operated via round numbers.

Description

A kind of cognitive radio frequency spectrum Resource Management Algorithm based on fairness

Technical field

The invention belongs to wireless communication field, specifically a kind of cognitive radio intermediate frequency spectrum Resource Management Algorithm based on fairness.When obtaining the optimizer system income, guaranteed the reliable communication of frequency spectrum resource distributional equity and node.

Background technology

Radio spectrum resources is fixed division by radio spectrum management department always, is about to certain frequency range fixed allocation to certain business, certain wireless traffic operator (or group, department etc.).Frequency range after the division can only be used by the user under this operator, and other unauthorized users can not use this frequency range, even in the situation of authorized user free time.Yet, studies have shown that more and more this method of salary distribution is that utilance is low-down, and can not satisfy the growing demand to radio spectrum resources of user.

Based on this, JosephMitola in 1999 have proposed the concept of cognitive radio (CR, Cognitive Radio).Untapped frequency spectrum and some are used but the frequency spectrum that is not fully utilized is looked for out although CR is assigned with some, and again distribute and use, thereby reached higher spectrum utilization efficiency, alleviated to a certain extent the contradiction of current frequency spectrum anxiety and business development.Be accompanied by the rise of cognitive radio technology, the Dynamic Spectrum Management problem is rich in challenging problem as one in the cognitive radio and is also more and more paid close attention to by more people.

Dynamic Spectrum Management is to select optimum channel allocation set U* in all feasible channel allocation, reaches the optimization of target function with this.In more than ten years in the past, a lot of researchers have proposed the effective Dynamic Spectrum Management algorithm based on different network environments, different target function.What for example, propose in the article " Collaboration and fairness in opportunistic spectrum access " of Haitao Zheng and Chunyi Peng has designed three kinds of different algorithms based on three kinds of different target functions.This locality with in the graph theory that for example proposes in the article " List-coloring based channel allocation for open-spectrum wireless networks " of Wei Wangand Xin Liu again problem (LCP, local-coloring problem) of tinting is applied to the algorithm of Dynamic Spectrum Management.But much pass through to introduce the concept of " neighbours " based on the research of graph theory, the spectrum allocation may of spectrum allocation may problem with neighbours connected, simplified between node and disturbed, and ignored the cumulative interference of non-neighbor user.As at L.Yang, L.Cao, point out in the article of and H. Zheng " Physical interference driven dynamic spectrum management ", operation can cause enough large cumulative interference in the time of a plurality of link, thereby cause bust this, even can not impact transmission when these links move alone.Thereby a kind of system framework PLAN(physical conflict graph generator proposed in this piece article), this framework improves the allocation performance of algorithm by considering the suffered cumulative interference of node.Subsequently, at SooyeolIm, Yunseok Kang, Wonsop Kim, Seunghee Kim, propose the heterogeneous network based on center type in the article of Jinup Kim and HyuckjaeLee " Dynamic spectrum allocation with efficient SINR-based interference management ", proposed a kind of effective spectrum management algorithm, but this algorithm has been ignored the distributional equity problem.

Based on the heterogeneous network of center type, this paper combines equitable proportion algorithm (PF, proportional fairness) and physical disturbance model, has guaranteed the reliable communication of distributional equity and node when obtaining the optimizer system income.

Summary of the invention

The present invention proposes a kind of cognitive radio frequency spectrum Resource Management Algorithm based on fairness that when obtaining the optimizer system income, has guaranteed the reliable communication of distributional equity and node.A kind of cognitive radio frequency spectrum Resource Management Algorithm based on fairness, it is characterized in that: it may further comprise the steps:

The first step: the frequency spectrum resource of underusing or not being assigned with is carried out channel distribution according to different network type;

Second step: describe the parameter of the frequency spectrum resource of underusing or not being assigned with, the channel quantity of the total bandwidth W of the frequency spectrum resource of wherein underusing or not being assigned with, the channel width Wt of network type t and network type t

Wherein

It is rounding operation;

The 3rd step: introduce three variable element a, b, c, increase a and increase current obtainable channel width w _tImpact, and obtain larger system's total revenue, reduce simultaneously fairness in distribution, increase b and c and improve fairness in distribution, reduce simultaneously system's total revenue.

On the basis of technique scheme, described the 3rd step comprises that also each base station is selected an available network model voluntarily, then the channel of map network type is carried out competitive bidding, the 1 couple of channel m in base station _t(m _t=1 ..., M _t) carry out competitive bidding, the target function design in its i time circulation is as follows:

$\underset{\underset{\underset{(l,j)\∈J_i-1}{(n,j)\∈J_i-1}}{(l,m_t)\∉J_i-1}}{\max }\frac{b_{l,m_t}.w_t^a}{{({\mathrm{\Σ}}_{n\∈B_{i-1}}\underset{j=1}{\overset{M_t}{\mathrm{\Σ}}}{w}_t.a_{n,j})}^b.{(\underset{j=1}{\overset{M_t}{\mathrm{\Σ}}}{w}_t.a_{l,j})}^c}$

J wherein _I-1Until the BTS channel that the i-1 time circulation distributed after finishing pair

B _I-1J _I-1In all base stations, That base station l is to channel m _tBidding price, w _tThe channel width of network type t, a _{N, j}(j=1 ..., M _t), (n, j) ∈ J _I-1The afterwards allocation matrix of network type t of i-1 circulation, and a _{N, j}Be defined as:

On the basis of technique scheme, further consider the cumulative interference between the base station, as follows based on the physical disturbance model optimization:

The constraints design is as follows:

Be constrained in $\frac{\frac{p_k}{d_k^{\mathrm{\α}}}}{{\mathrm{\Σ}}_{n\∈B_{i^{\′}},n\≠k}\underset{m_n=1}{\overset{M}{\mathrm{\Σ}}}{c}_{m_n,m_k}{a}_{n,m_n}\frac{p_n}{d_{n,k}^{\mathrm{\α}}}+P_N}\≥\mathrm{\β},$

For all (k, m _k) ∈ J _I'

J wherein _I'=J _I-1∪ (l, m _t), B _I'To belong to J _I'All base stations, i.e. B _I'=B _I-1∪ l, P _kThe through-put power of base station k, P _NNoise power, d _kThe distance between base station k and its terminal use, d _{N, k}It is the distance between any user of base station n and base station k; Wherein

Represent that the current base station-channel that will distribute is to (l, m _t) be subject to might disturb summation, simultaneously

Be defined as:

When

Be 1 and show channel m _nWith channel m _kIdentical or overlapping, Be 0 o'clock channel m _nWith channel m _kBetween noiseless mutually.

Can provide more flexibly service with respect to prior art the present invention, we can obtain the allocation result of high fairness, low system benefit, also can obtain the simultaneously allocation result of relatively high fairness of high yield, by utilizing the physical disturbance model, establishment the cumulative interference between the base station, thereby guaranteed terminal use's reliable communication.

Description of drawings

Fig. 1 the present invention carries out channel distribution according to different network type to the CAB frequency spectrum resource;

Fig. 2 network insertion type of the present invention and bidding price;

The total revenue contrast of Fig. 3 system of the present invention;

Fig. 4 fairness in distribution contrast of the present invention;

Fig. 5 SINR cumulative distribution function contrast of the present invention (SINR thresholding β=5dB);

Fig. 6 SINR cumulative distribution function contrast of the present invention (SINR thresholding β=10dB).

Embodiment

Please refer to Fig. 1 and Fig. 2, a kind of cognitive radio frequency spectrum Resource Management Algorithm based on fairness of the present invention may further comprise the steps,

The first step: the frequency spectrum resource of underusing or not being assigned with is carried out channel distribution according to different network type;

Second step: describe the parameter of the frequency spectrum resource of underusing or not being assigned with, the channel quantity of the total bandwidth W of the frequency spectrum resource of wherein underusing or not being assigned with, the channel width Wt of network type t and network type t

Wherein

It is rounding operation;

The 3rd step: introduce three variable element a, b, c, increase a and increase current obtainable channel width w _tImpact, and obtain larger system's total revenue, reduce simultaneously fairness in distribution, increase b and c and improve fairness in distribution, reduce simultaneously system's total revenue.

On the basis of technique scheme, described the 3rd step comprises that also each base station is selected an available network model voluntarily, then the channel of map network type is carried out competitive bidding, the 1 couple of channel m in base station _t(m _t=1 ..., M _t) carry out competitive bidding, the target function design in its i time circulation is as follows:

$\underset{\underset{\underset{(l,j)\∈J_i-1}{(n,j)\∈J_i-1}}{(l,m_t)\∉J_i-1}}{\max }\frac{b_{l,m_t}.w_t^a}{{({\mathrm{\Σ}}_{n\∈B_{i-1}}\underset{j=1}{\overset{M_t}{\mathrm{\Σ}}}{w}_t.a_{n,j})}^b.{(\underset{j=1}{\overset{M_t}{\mathrm{\Σ}}}{w}_t.a_{l,j})}^c}$

J wherein _I-1Until the BTS channel that the i-1 time circulation distributed after finishing pair B _I-1J _I-1In all base stations, That base station l is to channel m _tBidding price, w _tThe channel width of network type t, a _{N, j}(j=1 ..., M _t), (n, j) ∈ J _I-1The afterwards allocation matrix of network type t of i-1 circulation, and a _{N, j}Be defined as:

On the basis of technique scheme, further consider the cumulative interference between the base station, as follows based on the physical disturbance model optimization:

The constraints design is as follows:

Be constrained in $\frac{\frac{p_k}{d_k^{\mathrm{\α}}}}{{\mathrm{\Σ}}_{n\∈B_{i^{\′}},n\≠k}\underset{m_n=1}{\overset{M}{\mathrm{\Σ}}}{c}_{m_n,m_k}{a}_{n,m_n}\frac{p_n}{d_{n,k}^{\mathrm{\α}}}+P_N}\≥\mathrm{\β},$

For all (k, m _k) ∈ J _I,

J wherein _I'=J _I-1∪ (l, m _t), B _I'To belong to J _I'All base stations, i.e. B _I'=B _I-1∪ l, P _kThe through-put power of base station k, P _NNoise power, d _kThe distance between base station k and its terminal use, d _{N, k}It is the distance between any user of base station n and base station k; Wherein Represent that the current base station-channel that will distribute is to (l, m _t) be subject to might disturb summation, simultaneously

Be defined as:

When

Be 1 and show channel m _nWith channel m _kIdentical or overlapping,

Be 0 o'clock channel m _nWith channel m _kBetween noiseless mutually.

Next the parameter declaration about relating in the simulation process of the present invention is introduced in explanation:

Base station number: N

Square region size: 1000 * 1000units:

The through-put power of each base station: P=100mW

The communication distance of each base station: r=50units,

A path loss factor: mistake! Do not find Reference source.

Noise power: P _N=-100dBm

SINR thresholding: 5dB and 10dB.

Can use CAB resource spectral bandwidth: 100MHZ as the base station

Then carry out channel distribution according to the network type among Fig. 2.Competitive bidding is carried out according to the competitive bidding scope of Fig. 2 in each base station after choosing the network type that oneself will access.

Next introduce the correlated performance index of simulation result:

System's total revenue can be expressed as

$R=\underset{l=1}{\overset{L}{\mathrm{\Σ}}}\underset{m_t=1}{\overset{M}{\mathrm{\Σ}}}{a}_{l,m_t}{b}_{l,m_t}$

The cumulative distribution function of the SINR of end user location in the management area (CDF, cumulative distribution function) is selected ten terminal uses that are positioned at the communication zone boundaries of base station at random, measures its SINR, and draws cumulative distribution function figure.

Fairness in distribution

The definition fairness criteria is:

$F_A={\left(\underset{t=1}{\overset{T}{\mathrm{\&Sigma;}}}{Q}_t\right)}^2/T.\underset{t=1}{\overset{\mathrm{<figure-callout\; id="2"\; label="T\; Q\; t"\; filenames="HDA00002710471600011.png,HDA00002710471600013.png"\; state="\{\{state\}\}">T</figure-callout>}}{\mathrm{\&Sigma;}}}{Q}_t^{}{}_2^{}$

F _A=1 mean distribute to finish after, all base stations have obtained the frequency spectrum resource of same amount of bandwidth.

Q wherein _tBe the average bandwidth that the base station obtains, and be defined as

$Q_t=w_t\frac{R_t}{N_t}$

R _tAfter distributing end, the channel multiplexing total degree of network type t, N _tIt is the number of base stations of selecting network type t.

Can provide more flexibly service with respect to prior art the present invention, we can obtain the allocation result of high fairness, low system benefit, also can obtain the simultaneously allocation result of relatively high fairness of high yield, by utilizing the physical disturbance model, establishment the cumulative interference between the base station, thereby guaranteed terminal use's reliable communication.

Claims (3)

1. cognitive radio frequency spectrum Resource Management Algorithm based on fairness, it is characterized in that: it may further comprise the steps:

The first step: the frequency spectrum resource of underusing or not being assigned with is carried out channel distribution according to different network type;

Second step: describe the parameter of the frequency spectrum resource of underusing or not being assigned with, the channel quantity of the total bandwidth W of the frequency spectrum resource of wherein underusing or not being assigned with, the channel width Wt of network type t and network type t

Wherein

It is rounding operation;

The 3rd step: introduce three variable element a, b, c, increase a and increase current obtainable channel width w _tImpact, and obtain larger system's total revenue, reduce simultaneously fairness in distribution, increase b and c and improve fairness in distribution, reduce simultaneously system's total revenue.

2. a kind of cognitive radio frequency spectrum Resource Management Algorithm based on fairness as claimed in claim 1, it is characterized in that: described the 3rd step also comprises, each base station is selected an available network model voluntarily, then the channel of map network type is carried out competitive bidding, the 1 couple of channel m in base station _t(m _t=1 ..., M _t) carry out competitive bidding, the target function design in its i time circulation is as follows:

$\underset{\underset{\underset{(l,j)\&Element;J_i-1}{(n,j)\&Element;J_i-1}}{(l,m_t)\&NotElement;J_i-1}}{\max }\frac{b_{l,m_t}.w_t^a}{{({\mathrm{\&Sigma;}}_{n\&Element;B_{i-1}}\underset{j=1}{\overset{M_t}{\mathrm{\&Sigma;}}}{w}_t.a_{n,j})}^b.{(\underset{j=1}{\overset{M_t}{\mathrm{\&Sigma;}}}{w}_t.a_{l,j})}^c}$

J wherein _I-1Until the BTS channel that the i-1 time circulation distributed after finishing pair

B _I-1J _I-1In all base stations,

That base station l is to channel m _tBidding price, w _tThe channel width of network type t, a _{N, j}(j=1 ..., M _t), (n, j) ∈ J _I-1The afterwards allocation matrix of network type t of i-1 circulation, and a _{N, j}Be defined as:

3. a kind of cognitive radio frequency spectrum Resource Management Algorithm based on fairness as claimed in claim 2 is characterized in that: further consider the cumulative interference between the base station, as follows based on the physical disturbance model optimization:

The constraints design is as follows:

Be constrained in $\frac{\frac{p_k}{d_k^{\mathrm{\&alpha;}}}}{{\mathrm{\&Sigma;}}_{n\&Element;B_{i^{\&prime;}},n\&NotEqual;k}\underset{m_n=1}{\overset{M}{\mathrm{\&Sigma;}}}{c}_{m_n,m_k}{a}_{n,m_n}\frac{p_n}{d_{n,k}^{\mathrm{\&alpha;}}}+P_N}\&GreaterEqual;\mathrm{\&beta;},$

For all (k, m _k) ∈ J _I'

J wherein _I'=J _I-1∪ (l, m _t), B _I'To belong to J _I'All base stations, i.e. B _I'=B _I-1∪ l, P _kThe through-put power of base station k, P _NNoise power, d _kThe distance between base station k and its terminal use, d _{N, k}It is the distance between any user of base station n and base station k; Wherein

Represent that the current base station-channel that will distribute is to (l, m _t) be subject to might disturb summation, simultaneously

Be defined as:

When

Be 1 and show channel m _nWith channel m _kIdentical or overlapping, Be 0 o'clock channel m _nWith channel m _kBetween noiseless mutually.

Images