CN103068004A - Access control method in mobile communication network - Google Patents

Abstract

The invention discloses an access control method in a mobile communication network. Through consideration of opportunistic scheduling and different service quality assurance, the access control method in the mobile communication network can access more users under the condition of not affecting quality of service (QoS) degree of satisfaction of the users exist in the network. At first, multi-user diversity gain is arranged to be 1 for all users requiring a minimum speed, then resources which are needed to access a new MRR user are calculated, MDG of all MRR users is updated, and resources which are needed to access a new MRR user are calculated in an iteration mode. When an iteration result is stable, if the minimum speed requirements of the new accessed MRR user can be met by the network strictly, the new MRR user can be accessed into the network successfully, or, the new MRR user is blocked. Then, distributive resources to access a best effort (BE) user are calculated, and change of a total utility function of the whole network is calculated according to the distributive resources, if and only if the new accessed BE user can improve the total utility function of the whole network, the new BE user can be accessed to the network successfully, or, the new BE user is blocked and algorithm is stopped.

Description

Admittance control method in a kind of mobile communications network

Technical field

The present invention relates to the admittance control method in a kind of mobile communications network, belong to the networking technology area in the mobile communication system.

Background technology

Access control is as one of mobile communications network key technology, and the system of can be provides congestion control and QoS to ensure.Its target is to have had the new user of user QoS satisfaction access in the situation that do not affect network.

Tradition based on Circuit-switched network in (2G), the user only has single QoS demand (voice).Network will according to channel usage situation and some criterions, determine whether accessing new user such as signal quality, conversation blocking rate, conversation cutting off rate, delay etc.In case the user successfully accesses, network will distribute a dedicated channel for it.And in the following cellular network based on packet switch, the user has different QoS requirements, such as minimum data rate, rate delay, speed shake, Packet Error Ratio etc.The base station also will effectively utilize system resource except ensureing user QoS demand with suitable chance scheduling strategy.Consider two kinds of QoS services: minimum-rate demand (minimum rate requirement, MRR) is served and do one's best (best effort, BE) serves.

Summary of the invention

The objective of the invention is to propose the admittance control method in a kind of mobile communications network, this method has been considered chance scheduling and different service quality (quality of service, QoS) ensure, existed user QoS satisfaction to access more users in the situation that do not affect network as far as possible.

For achieving the above object, the technical scheme taked of the present invention:

Admittance control method in a kind of mobile communications network is characterized in that by consider that chance scheduling and different service quality QoS ensure, have existed user QoS satisfaction to access more users in the situation that do not affect network as far as possible; At first to all minimum-rate demands (minimum rate requirement, MRR) with its multi-user diversity gain (multi-user diversity gain is set per family, MDG) be 1, then calculate new MRR user's resource requirement number of access, upgrade again all MRR users' MDG and newly access MRR user's resource requirement number with its iterative computation, when the iteration result stablizes, if newly accessing MRR user's minimum-rate demand can strictly be satisfied by network, it just can successful access network, otherwise blocks it.Then calculate assignable number of resources of (best effort, BE) user of newly doing one's best of access, and calculate the change of the whole network total utility function with it, when and when newly accessing BE user and can promote the whole network total utility function, it just can successful access network, otherwise blocks it, stops algorithm; May further comprise the steps:

(1) initialization: all minimum-rate demand (MRR) user m are all arranged G _m=1, G wherein _mBecause the multi-user diversity gain with respect to user m (MDG) that system adopts the dispatching algorithm (CS/ORR) that combines based on user self speed cumulative distribution scheduling (CS) and chance poll (ORR) to bring;

The first step: calculate new MRR user of access

The resource requirement number

Wherein Bw is the bandwidth that can distribute to user's least resource unit, With Respectively the user

Minimum-rate demand, bandwidth efficiency and MDG, It is the symbol that rounds up;

Second step: to each MRR user m, upgrade its multi-user diversity gain G _m

$G_m=\frac{{\mathrm{\Σ}}_{j=1}^{s_m}{G}^{\mathrm{CS}/\mathrm{ORR}}\left(K_j\right)}{s_m}$

S wherein _mTo be user m institute Resources allocation number, K _jThe competition number of users of j wheel, G ^CS/ORR(K _j) be the MDG of j wheel when adopting the CS/ORR dispatching algorithm, be defined as follows:

When adopting CS, for having in the system | K| service-user, the MDG of arbitrary service-user k is

$G_k^{\mathrm{CS}}=\underset{i=1}{\overset{\left|K\right|}{\mathrm{\Σ}}}\frac{1}{i}$

By following formula as can be known, Only with the system user number | K| is relevant, convenient for the purpose of, with G (| K|) replace

Adopting the CS/ORR dispatching algorithm is that its QoS demand resource requirement number is satisfied in the new access user conservative estimation.Supposing has K in the j wheel _jIndividual user, then the average MD G of j wheel is

$G^{\mathrm{CS}/\mathrm{ORR}}\left(K_j\right)=\frac{1}{K_j}\underset{l=1}{\overset{K_j}{\mathrm{\Σ}}}G\left(l\right)=\frac{1}{K_j}\underset{l=1}{\overset{K_j}{\mathrm{\Σ}}}\underset{i=1}{\overset{l}{\mathrm{\Σ}}}\frac{1}{i}$

The 3rd step: recomputate access user according to formula [1]

The resource requirement number

If this moment the iteration result

Stable, then entered for the 4th step, otherwise enter second step;

The 4th step: work as the user Minimum-rate demand can strictly be satisfied by network the time, it just can successful access network, if namely

$s_{\hat{m}}\≤s_M-\underset{m\∈M}{\mathrm{\Σ}}{s}_m$

Then access new user Otherwise block it; S wherein _MAll MRR user's available resources sums;

The 5th step: newly access BE user

The resource requirement number is

Wherein s is the system resource sum, and B is BE user's set,

To round symbol downwards;

The 6th step: work as access user

In the time of can promoting the whole network total utility function, it just can successful access network, if namely

$\mathrm{\ΔU}=\left[\log \frac{s_B\·\mathrm{Bw}\·e_{\hat{b}}\·G\left(\right|B|+1)}{\left|B\right|+1}\right]+\underset{b\∈B}{\mathrm{\Σ}}[\log \frac{s_B\·\mathrm{Bw}\·e_b\·G\left(\right|B|+1)}{\left|B\right|+1}$

[3]

$-\log \frac{s_B\·\mathrm{Bw}\·e_b\·G\left(\right|B\left|\right)}{\left|B\right|}]>0$

Wherein

Represent all BE user's available resources sums;

[3] first representative of consumer of formula

The utility function increment, second represent in the network all existed BE user utility increment of a function and, formula [3] is reduced to

$\mathrm{\ΔU}=\left[\log \frac{s_B\·\mathrm{Bw}\·e_{\hat{b}}\·G\left(\right|B|+1)}{\left|B\right|+1}\right]+\log {\left[\frac{G\left(\right|B|+1)}{G\left(\right|B\left|\right)}\frac{\left|B\right|}{\left|B\right|+1}\right]}^{\left|B\right|}>0---\left[4\right]$

Because ${\lim }_{x\→\∞}{(1+\frac{1}{x})}^x=e$ And Euler approximation $G\left(Y\right)={\mathrm{\Σ}}_{y=1}^{Y}1/y\≈\mathrm{\γ}+\log \left(Y\right),$ Wherein e is natural logrithm, γ=0.5772nd, and Euler's constant then can be released

${\left(\frac{\left|B\right|}{\left|B\right|+1}\right)}^{\left|B\right|}\≈\frac{1}{e},$ ${\left[\frac{G\left(\right|B|+1)}{G\left(\right|B\left|\right)}\right]}^{\left|B\right|}\≈1---\left[5\right]$

With formula [5] and formula [2] substitution formula [4], get final product

$s_{\hat{b}}\·\mathrm{Bw}\·e_{\hat{b}}\·G\left(\right|B|+1)>e---\left[6\right]$

If access new user Satisfy formula [6] inequality condition, then access it; Otherwise block it, stop algorithm.

Advantage of the present invention and beneficial effect: owing to adopting conservative multi-user diversity gain to calculate user's resource requirement number, this admission control algorithm can when ensureing that the new access user blocking rate is very low, provide better QoS to ensure.

Embodiment

Take the LTE system as example provides a kind of embodiment:

Initialization: user m all arranges G to all minimum-rate demands (minimum rate requirement, MRR) _m=1, G wherein _mBecause system adopts based on user self speed cumulative distribution scheduling (cumulative distributed function based scheduling, CS) and the multi-user diversity gain with respect to user m (MDG) brought of the dispatching algorithm (CS/ORR) that combines of chance poll (opportunistic round robin, ORR);

The first step: calculate new MRR user of access

The resource requirement number

Wherein Bw is the bandwidth that can distribute to user's least resource unit,

With

Respectively the user

Minimum-rate demand, bandwidth efficiency and MDG,

It is the symbol that rounds up;

Second step: to each MRR user m, upgrade its multi-user diversity gain G _m

$G_m=\frac{{\mathrm{\Σ}}_{j=1}^{s_m}{G}^{\mathrm{CS}/\mathrm{ORR}}\left(K_j\right)}{s_m}$

S wherein _mTo be user m institute Resources allocation number, K _jThe competition number of users of j wheel, G ^CS/ORR(K _j) be the MDG of j wheel when adopting the CS/ORR dispatching algorithm, be defined as follows:

When adopting CS, for having in the system | K| service-user, the MDG of arbitrary service-user k is

$G_k^{\mathrm{CS}}=\underset{i=1}{\overset{\left|K\right|}{\mathrm{\Σ}}}\frac{1}{i}$

By following formula as can be known,

Only with the system user number | K| is relevant, convenient for the purpose of, with G (| K|) replace

Adopting CS/ORR is that its QoS demand resource requirement number is satisfied in the new access user conservative estimation.Supposing has K in the j wheel _jIndividual user, then the average MD G of j wheel is

$G^{\mathrm{CS}/\mathrm{ORR}}\left(K_j\right)=\frac{1}{K_j}\underset{l=1}{\overset{K_j}{\mathrm{\Σ}}}G\left(l\right)=\frac{1}{K_j}\underset{l=1}{\overset{K_j}{\mathrm{\Σ}}}\underset{i=1}{\overset{l}{\mathrm{\Σ}}}\frac{1}{i}$

The 3rd step: recomputate access user according to formula [1]

The resource requirement number

If this moment the iteration result Stable, then entered for the 4th step, otherwise enter second step;

The 4th step: and if only if user

Minimum-rate demand can strictly be satisfied by network the time, it just can successful access network, if namely

$s_{\hat{m}}\≤s_M-\underset{m\∈M}{\mathrm{\Σ}}{s}_m$

Then access new user

Otherwise block it; S wherein _MAll MRR user's available resources sums;

The 5th step: newly access BE user

The resource requirement number is

Wherein s is the system resource sum, and B is BE user's set, To round symbol downwards;

The 6th step: and if only if access user

In the time of can promoting the whole network total utility function, it just can successful access network, if namely

$\mathrm{\ΔU}=\left[\log \frac{s_B\·\mathrm{Bw}\·e_{\hat{b}}\·G\left(\right|B|+1)}{\left|B\right|+1}\right]+\underset{b\∈B}{\mathrm{\Σ}}[\log \frac{s_B\·\mathrm{Bw}\·e_b\·G\left(\right|B|+1)}{\left|B\right|+1}$

[3]

$-\log \frac{s_B\·\mathrm{Bw}\·e_b\·G\left(\right|B\left|\right)}{\left|B\right|}]>0$

Wherein

Represent all BE user's available resources sums;

[3] first representative of consumer of formula The utility function increment, second represent in the network all existed BE user utility increment of a function and, formula [3] is reduced to

$\mathrm{\ΔU}=\left[\log \frac{s_B\·\mathrm{Bw}\·e_{\hat{b}}\·G\left(\right|B|+1)}{\left|B\right|+1}\right]+\log {\left[\frac{G\left(\right|B|+1)}{G\left(\right|B\left|\right)}\frac{\left|B\right|}{\left|B\right|+1}\right]}^{\left|B\right|}>0---\left[4\right]$

Because ${\lim }_{x\→\∞}{(1+\frac{1}{x})}^x=e$ And Euler approximation $G\left(Y\right)={\mathrm{\Σ}}_{y=1}^{Y}1/y\≈\mathrm{\γ}+\log \left(Y\right),$ Wherein e is natural logrithm, γ=0.5772nd, and Euler's constant then can be released

${\left(\frac{\left|B\right|}{\left|B\right|+1}\right)}^{\left|B\right|}\≈\frac{1}{e},$ ${\left[\frac{G\left(\right|B|+1)}{G\left(\right|B\left|\right)}\right]}^{\left|B\right|}\≈1---\left[5\right]$

With formula [5] and formula [2] substitution formula [4], get final product

$s_{\hat{b}}\·\mathrm{Bw}\·e_{\hat{b}}\·G\left(\right|B|+1)>e---\left[6\right]$

If access new user

Satisfy formula [6] inequality condition, then access it; Otherwise block it, stop algorithm.

Claims (1)

1. the admittance control method in the mobile communications network is characterized in that by consider that chance scheduling and different service quality QoS ensure, have existed user QoS satisfaction to access more users in the situation that do not affect network as far as possible; Be 1 to all minimum-rate demand MRR with its multi-user diversity gain MDG is set per family at first, then calculate new MRR user's resource requirement number of access, upgrade again all MRR users' MDG and newly access MRR user's resource requirement number with its iterative computation, when the iteration result stablizes, if newly accessing MRR user's minimum-rate demand can strictly be satisfied by network, it just can successful access network, otherwise blocks it; Then calculate assignable number of resources of BE user of newly doing one's best of access, and calculate the change of the whole network total utility function with it, when and when newly accessing BE user and can promote the whole network total utility function, it just can successful access network, otherwise blocks it, stops algorithm; May further comprise the steps:

(1) initialization: all minimum-rate demand MRR user m are all arranged G _m=1, G wherein _mBecause the multi-user diversity gain MDG with respect to user m that system adopts the CS/ORR dispatching algorithm that combines based on user self speed cumulative distribution scheduling CS and chance poll ORR to bring;

The first step: calculate new MRR user of access

The resource requirement number

Wherein Bw is the bandwidth that can distribute to user's least resource unit,

With

Respectively the user Minimum-rate demand, bandwidth efficiency and MDG,

It is the symbol that rounds up;

Second step: to each MRR user m, upgrade its multi-user diversity gain G _m

$G_m=\frac{{\mathrm{\Σ}}_{j=1}^{s_m}{G}^{\mathrm{CS}/\mathrm{ORR}}\left(K_j\right)}{s_m}$

S wherein _mTo be user m institute Resources allocation number, K _jThe competition number of users of j wheel, G ^CS/ORR(K _j) be the MDG of j wheel when adopting the CS/ORR dispatching algorithm, be defined as follows:

When adopting CS, for having in the system | K| service-user, the MDG of arbitrary service-user k is

$G_k^{\mathrm{CS}}=\underset{i=1}{\overset{\left|K\right|}{\mathrm{\Σ}}}\frac{1}{i}$

By following formula as can be known, Only with the system user number | K| is relevant, convenient for the purpose of, with G (| K|) replace

Adopting the CS/ORR dispatching algorithm is that its QoS demand resource requirement number is satisfied in the new access user conservative estimation.Supposing has K in the j wheel _jIndividual user, then the average MD G of j wheel is

$G^{\mathrm{CS}/\mathrm{ORR}}\left(K_j\right)=\frac{1}{K_j}\underset{l=1}{\overset{K_j}{\mathrm{\Σ}}}G\left(l\right)=\frac{1}{K_j}\underset{l=1}{\overset{K_j}{\mathrm{\Σ}}}\underset{i=1}{\overset{l}{\mathrm{\Σ}}}\frac{1}{i}$

The 3rd step: recomputate access user according to formula [1]

The resource requirement number

If this moment the iteration result

Stable, then entered for the 4th step, otherwise enter second step;

The 4th step: work as the user

Minimum-rate demand can strictly be satisfied by network the time, it just can successful access network, if namely

$s_{\hat{m}}\≤s_M-\underset{m\∈M}{\mathrm{\Σ}}{s}_m$

Then access new user Otherwise block it; S wherein _MAll MRR user's available resources sums;

The 5th step: newly access BE user

The resource requirement number is

Wherein s is the system resource sum, and B is BE user's set,

To round symbol downwards;

The 6th step: work as access user

In the time of can promoting the whole network total utility function, it just can successful access network, if namely

$\mathrm{\ΔU}=\left[\log \frac{s_B\·\mathrm{Bw}\·e_{\hat{b}}\·G\left(\right|B|+1)}{\left|B\right|+1}\right]+\underset{b\∈B}{\mathrm{\Σ}}[\log \frac{s_B\·\mathrm{Bw}\·e_b\·G\left(\right|B|+1)}{\left|B\right|+1}---[3]$

$-\log \frac{s_B\·\mathrm{Bw}\·e_b\·G\left(\right|B\left|\right)}{\left|B\right|}]>0$

Wherein

Represent all BE user's available resources sums;

[3] first representative of consumer of formula The utility function increment, second represent in the network all existed BE user utility increment of a function and, formula [3] is reduced to

$\mathrm{\ΔU}=\left[\log \frac{s_B\·\mathrm{Bw}\·e_{\hat{b}}\·G\left(\right|B|+1)}{\left|B\right|+1}\right]+\log {\left[\frac{G\left(\right|B|+1)}{G\left(\right|B\left|\right)}\frac{\left|B\right|}{\left|B\right|+1}\right]}^{\left|B\right|}>0---\left[4\right]$

Because ${\lim }_{x\→\∞}{(1+\frac{1}{x})}^x=e$ And Euler approximation $G\left(Y\right)={\mathrm{\Σ}}_{y=1}^{Y}1/y\≈\mathrm{\γ}+\log \left(Y\right),$ Wherein e is natural logrithm, γ=0.5772nd, and Euler's constant then can be released

${\left(\frac{\left|B\right|}{\left|B\right|+1}\right)}^{\left|B\right|}\≈\frac{1}{e},$ ${\left[\frac{G\left(\right|B|+1)}{G\left(\right|B\left|\right)}\right]}^{\left|B\right|}\≈1---\left[5\right]$

With formula [5] and formula [2] substitution formula [4], get final product

$s_{\hat{b}}\·\mathrm{Bw}\·e_{\hat{b}}\·G\left(\right|B|+1)>e---\left[6\right]$

If access new user

Satisfy formula [6] inequality condition, then access it; Otherwise block it, stop algorithm.