CN103068004A - Access control method in mobile communication network - Google Patents
Access control method in mobile communication network Download PDFInfo
- Publication number
- CN103068004A CN103068004A CN2012105897796A CN201210589779A CN103068004A CN 103068004 A CN103068004 A CN 103068004A CN 2012105897796 A CN2012105897796 A CN 2012105897796A CN 201210589779 A CN201210589779 A CN 201210589779A CN 103068004 A CN103068004 A CN 103068004A
- Authority
- CN
- China
- Prior art keywords
- user
- access
- centerdot
- mrr
- network
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
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
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;
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
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
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
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
Then access new user
Otherwise block it; S wherein
MAll MRR user's available resources sums;
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
[3]
[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
Because
And Euler approximation
Wherein e is natural logrithm, γ=0.5772nd, and Euler's constant then can be released
With formula [5] and formula [2] substitution formula [4], get final product
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);
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
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
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
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
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
[3]
[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
Because
And Euler approximation
Wherein e is natural logrithm, γ=0.5772nd, and Euler's constant then can be released
With formula [5] and formula [2] substitution formula [4], get final product
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;
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
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
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
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
Then access new user
Otherwise block it; S wherein
MAll MRR user's available resources sums;
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
[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
Because
And Euler approximation
Wherein e is natural logrithm, γ=0.5772nd, and Euler's constant then can be released
With formula [5] and formula [2] substitution formula [4], get final product
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201210589779.6A CN103068004B (en) | 2012-12-29 | 2012-12-29 | Access control method in mobile communication network |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201210589779.6A CN103068004B (en) | 2012-12-29 | 2012-12-29 | Access control method in mobile communication network |
Publications (2)
Publication Number | Publication Date |
---|---|
CN103068004A true CN103068004A (en) | 2013-04-24 |
CN103068004B CN103068004B (en) | 2015-02-18 |
Family
ID=48110425
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201210589779.6A Expired - Fee Related CN103068004B (en) | 2012-12-29 | 2012-12-29 | Access control method in mobile communication network |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN103068004B (en) |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20050176440A1 (en) * | 2004-02-06 | 2005-08-11 | Nec Laboratories America, Inc. | Load-aware handoff and site selection scheme |
CN101521913A (en) * | 2009-03-25 | 2009-09-02 | 宁波大学 | Calling and receiving control method for WiMAX system |
CN102186223A (en) * | 2011-04-25 | 2011-09-14 | 东南大学 | Call admission control method for guaranteeing minimal rate for subscribers in mobile communication system |
-
2012
- 2012-12-29 CN CN201210589779.6A patent/CN103068004B/en not_active Expired - Fee Related
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20050176440A1 (en) * | 2004-02-06 | 2005-08-11 | Nec Laboratories America, Inc. | Load-aware handoff and site selection scheme |
CN101521913A (en) * | 2009-03-25 | 2009-09-02 | 宁波大学 | Calling and receiving control method for WiMAX system |
CN102186223A (en) * | 2011-04-25 | 2011-09-14 | 东南大学 | Call admission control method for guaranteeing minimal rate for subscribers in mobile communication system |
Non-Patent Citations (3)
Title |
---|
HAO WANG等: "QoS Guaranteed Call Admission Control with Opportunistic Scheduling", 《IEEE》, 31 December 2011 (2011-12-31) * |
ZHIHANG LI等: "Dynamic Load Balancing in 3GPP LTE Multi-Cell Fractional Frequency Reuse Networks", 《VEHICULAR TECHNOLOGY CONFERENCE(VTC FALL),2012 IEEE》, 6 September 2012 (2012-09-06) * |
王浩等: "全负载场景中最优调度算法长时平均性能分析", 《东南大学学报(自然科学版)》, vol. 42, no. 2, 31 March 2012 (2012-03-31) * |
Also Published As
Publication number | Publication date |
---|---|
CN103068004B (en) | 2015-02-18 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN102026388B (en) | Method for allocating radio resources under coordinated multipoint transmission/reception (CoMP) in long term evolution-advanced (LTE-A) system | |
CN103024921B (en) | A kind of dispatching method divided into groups based on CQI feedback parameter and SINR numerical value | |
CN101754387A (en) | Method for scheduling resources in wireless communication system and base station | |
CN105307216A (en) | LTE-based radio resource allocation method of Internet of vehicles | |
CN104660394A (en) | Spectrum resource allocation method based on utility function and price mechanism | |
CN101784078B (en) | Load balancing and throughput optimization method in mobile communication system | |
CN103442412B (en) | A kind of network selecting method based on Weighted optimal bipartite graph matching | |
CN105898851A (en) | High energy efficiency power control method which takes energy harvest into consideration in ultra-dense network | |
CN102291842B (en) | Virtual MIMO pairing method taking user QoS into account | |
CN102421104A (en) | Network selection and channel resource configuration method in hybrid wireless network | |
CN103281786A (en) | Method for optimizing resources of family base station double-layer network based on energy efficiency | |
CN103826312A (en) | Improved LTE (Long Term Evolution) scheduling method based on exponential rule | |
CN105874858B (en) | The channel multiplexing method and device of multi-transceiver configuration method, multi-transceiver | |
CN104955154A (en) | LTE (long term evolution) uplink proportion fair resource scheduling method based on user business volume satisfaction degree | |
CN102395158B (en) | Load balance optimization method considering user service quality requirements in mobile communication system | |
CN101841915A (en) | Method for scheduling and distributing resources in communication system and scheduler | |
CN103037528A (en) | Resource dispatching method based on carrier weight in multi-carrier system | |
CN109982439A (en) | The channel resource allocation method of D2D communication system based on cellular network | |
CN101877913A (en) | User scheduling method in LTE (Long Term Evolution) system | |
CN104023400B (en) | For the down channel allocation method based on demand of OFDM base station systems | |
CN103458524A (en) | User scheduling method, device and system | |
CN107087309B (en) | Proportional fair scheduling method for multi-base-station system under fixed rate constraint of user QoS | |
CN106301741B (en) | A kind of distribution method of time frequency resources for selecting characteristic based on channel frequency | |
CN101436891B (en) | Method for scheduling global proportionality equitableness of multiple base stations and multiuser | |
CN102891822A (en) | Resource distribution method of multi-user OFDM (Orthogonal Frequency Division Multiplexing) system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C14 | Grant of patent or utility model | ||
GR01 | Patent grant | ||
CF01 | Termination of patent right due to non-payment of annual fee | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150218 Termination date: 20171229 |