[go: up one dir, main page]

CN102098746A - Multi-cell resource allocation method introducing mobile resource reserve mechanism - Google Patents

Multi-cell resource allocation method introducing mobile resource reserve mechanism Download PDF

Info

Publication number
CN102098746A
CN102098746A CN2011100273467A CN201110027346A CN102098746A CN 102098746 A CN102098746 A CN 102098746A CN 2011100273467 A CN2011100273467 A CN 2011100273467A CN 201110027346 A CN201110027346 A CN 201110027346A CN 102098746 A CN102098746 A CN 102098746A
Authority
CN
China
Prior art keywords
user
resource
base station
resource block
allocation
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
Application number
CN2011100273467A
Other languages
Chinese (zh)
Other versions
CN102098746B (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.)
University of Science and Technology of China USTC
Original Assignee
University of Science and Technology of China USTC
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 University of Science and Technology of China USTC filed Critical University of Science and Technology of China USTC
Priority to CN201110027346.7A priority Critical patent/CN102098746B/en
Publication of CN102098746A publication Critical patent/CN102098746A/en
Application granted granted Critical
Publication of CN102098746B publication Critical patent/CN102098746B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

本发明公开了一种引入移动资源预留机制的多小区资源分配方法，特征是移动资源预留模块根据用户移动模型得到预留信息并将其传送给多小区资源分配模块；多小区资源分配模块联合考虑长时统计信道状态信息、预留信息和业务服务质量信息决定各个小区可使用的资源块集合。与现有不考虑预留机制的多小区资源分配方法相比较，本发明充分利用了用户的移动模型，在多小区资源分配时提前为时延敏感业务预留资源，避免了小区间频繁切换给时延敏感业务造成的数据包超时丢包；同时联合考虑了移动用户的服务质量信息、小区间干扰以及信道状态信息，协调小区间资源块的分配，可有效避免干扰，最大化系统吞吐率。

Figure 201110027346

The invention discloses a multi-cell resource allocation method introducing a mobile resource reservation mechanism, which is characterized in that the mobile resource reservation module obtains reserved information according to the user mobility model and transmits it to the multi-cell resource allocation module; the multi-cell resource allocation module Jointly consider the long-term statistical channel state information, reservation information and business service quality information to determine the resource block set that can be used by each cell. Compared with the existing multi-cell resource allocation method that does not consider the reservation mechanism, the present invention makes full use of the user's mobility model, reserves resources for delay-sensitive services in advance during multi-cell resource allocation, and avoids frequent switching between cells. Packet timeout and packet loss caused by delay-sensitive services; at the same time, the quality of service information of mobile users, inter-cell interference, and channel state information are jointly considered to coordinate the allocation of resource blocks between cells, which can effectively avoid interference and maximize system throughput.

Figure 201110027346

Description

A kind of many local resources distribution method of introducing the mobile resources future mechanism
Technical field
The invention belongs to many local resources and distribute the mobile communication technology field, particularly the multi-cell ofdma of introducing mobile resources future mechanism inserts the resource allocation methods in (OFDMA) system.
Background technology
The OFDM access technology is generally believed it is indispensable technology in the 4th third-generation mobile communication system.Under this multiple access technique, system has littler time frequency two-dimensional resources partition size.Growing along with the fast development of radio communication and high-speed mobile environment application demand, radio communication is more and more stronger to the support of high-speed mobile scene.In high-speed mobile environment, because the mobile subscriber is at the frequent switching of minizone and long HO-break duration, for the real time business of delay sensitive provides service quality to guarantee to face great challenge.Resource allocation flexibly is to support one of key technology that wireless network mixed service service quality (QoS) guarantees.
" international electronics and The Institution of Electrical Engineers's radio communication journal " (IEEE Transactions on Wireless Communications, Volume.5, Issue 12, pp.3451-3459, statistical channel state information and decide the method for the operable Resource Block set in each sub-district according to user's request when having introduced a kind of many local resources distribution module Dec.2006) and utilizing the minizone long avoids interference to reach, the purpose of maximized system capacity.But this multi-cell ofdma inserts the algorithm that is adopted in (OFDMA) resource allocation methods often supposes that the user is fixed in certain sub-district.And in mobile scene, because be generally second this order of magnitude the dispatching cycle of the resource allocation of statistical channel state information when long, and the short period of switch decision is generally hundred milliseconds of these orders of magnitude, switches so the minizone can take place in long many local resources assignment period the user; When especially real time business burst switches to adjacent sub-district and but distributes less than resource, can cause the severe exacerbation that customer service is experienced.
" the vehicle-mounted technology journal of international electronics and The Institution of Electrical Engineers " (IEEE Transactions on Vehicular Technology, Volume.58, Issue 3, pp.1415-1428, Mar.2009) having introduced in for real time business adopts mobile resources reservation protocol (MRSVP) all to reserve certain bandwidth for its sub-district that may serve in the professional duration, to avoid serious packet loss, guarantee the service quality of its real time business in handoff procedure; Then only do reservation for non-real-time service in this sub-district; But this mobile resources reservation only limits to many local resources to be assigned as in the definite user's access control afterwards of resource of each cell allocation.And when many local resources are assigned as each cell allocation available resources, only consider the resource of current time sub-district service-user demand, be not thought of as user's reserved resource that in assignment period, may move to this sub-district.If happening suddenly, the user switches to adjacent sub-district in assignment period, can be owing to the inadequate resource that in many local resources distribute, does not cause for this user's reserved resource, refuse other service-user access in this user or the sub-district, thereby greatly influenced mobile subscriber business experience.
Summary of the invention
The present invention proposes a kind of many local resources distribution method of introducing the mobile resources future mechanism, to avoid the frequent overtime packet loss of packet of causing for the delay sensitive business that switches in minizone, coordinate the distribution of minizone Resource Block simultaneously, effectively avoid interference, the maximization system throughput.
The present invention introduces many local resources distribution method of mobile resources future mechanism, statistical channel state information when at first the base station is by inter-base station interface and adjacent sub-district many local resources distribution module exchange length; The statistical channel state information was each base station assigns available resources when many local resources distribution module was grown according to every superframe; The statistical channel state information was come the select target sub-district when switch decision module adopted cycle triggering mode according to user long at each switching cycle; Single local resource distribution module is distributed to this sub-district service-user according to the instantaneous channel condition information of every subframe with the available resources of this base station;
It is characterized in that:
The base station is by measuring instantaneous channel condition information H B, k, n, statistical channel state information G when on average obtaining length during with its length B, k, nStatistical channel state information G when many local resources distribution module obtains length alternately by inter-base station interface B, k, n
Mobile resources in the core net is reserved module and is obtained obligate information according to user's mobility model
Figure BDA0000045253640000021
And send it to many local resources distribution module;
Many local resources distribution module is according to resource obligate information
Figure BDA0000045253640000022
Statistical channel state information G during minizone long B, k, nWith the QoS parameter that application layer module obtains, every superframe carries out first resource and distributes, and determines the spendable Resource Block set in each sub-district according to many local resources allocation algorithm;
The step of described many local resources allocation algorithm is:
At first initialization: establish the numbering base station b=1 of B base station, L, B represents; K user's numbering user k=1, L, K represents; The Resource Block set that all B base station is assigned to is changed to empty set Φ B, b=1...B=[]; The Resource Block set that all K user is assigned to is changed to empty set Ψ K, k=1..K=[]; The number of resource blocks of each user's request is set according to the application layer business information
Figure BDA0000045253640000023
Then b=1 is numbered in the base station, L, the number of resource blocks size (Φ that all base stations numberings of B have been assigned to according to all base stations b) and the base station in number of users K bRatio by descending sort, then the set of the numbering of the base station after the ordering is
Figure BDA0000045253640000024
Wherein sort represents by descending sort, and size represents the size gathered; Check whether number of resource blocks Ψ that all users have distributed equals the Resource Block demand and count Ψ *, promptly whether satisfy Ψ=Ψ *, if, end loop then, allocation algorithm finishes; If not, then carry out subsequent process;
Top base station begins the zero clearing with allocation vector Y the numbering set ψ after ordering: i.e. allocation vector
Figure BDA0000045253640000025
Wherein
Figure BDA0000045253640000026
For
Figure BDA0000045253640000027
The null matrix of row N row; According to obligate information
Figure BDA0000045253640000028
To owning in this base station
Figure BDA0000045253640000029
The gain Ω of all N of individual user Resource Block difference computing system throughputs N, k: make interim allocation vector y equal the allocation vector of Resource Block n
Figure BDA00000452536400000210
Be expressed as
Figure BDA00000452536400000211
According to the shannon formula before distributing
Figure BDA00000452536400000212
Calculate the throughput of system T before Resource Block n distributes to user k K, n(y), wherein P is a base station transmitting power, G B, k, nStatistical channel state information during for length, σ 2Be noise variance, The interference of on Resource Block n, launching for all adjacent sub-districts; K the element of interim allocation vector y put 1, and this operation table is shown y+e K, n, e in the formula K, nFor
Figure BDA00000452536400000214
Dimensional vector, wherein the element of user k correspondence puts 1, all the other Individual element is 0; According to the shannon formula after distributing
Figure BDA00000452536400000216
Calculating is distributed to throughput of system T behind the user k with Resource Block n K, n(y+e K, n), wherein P is a base station transmitting power, G B, k, nStatistical channel state information during for length, σ 2Be noise variance,
Figure BDA0000045253640000031
The interference of on Resource Block n, launching for all adjacent sub-districts; With the throughput of system T after distributing K, n(y+e K, n) deduct and distribute preceding throughput of system T K, n(y) obtain the gain Ω of throughput of system K, n, this operation table is shown Ω K, n=T K, n(y+e K, n)-T K, n(y); In calculating this base station all
Figure BDA0000045253640000032
The gain Ω of the throughput of system of all N Resource Block of individual user N, kSelection makes system throughput flow gain Ω N, kMaximum user k *With Resource Block n *, this operation table is shown: k *, n *← argmax Ω N, k, arg max Ω wherein N, kFor selecting to make system throughput flow gain Ω N, kMaximum user k *With Resource Block n *If the gain of throughput of system
Figure BDA0000045253640000033
Greater than 0 and be user k *The Resource Block set that distributes
Figure BDA0000045253640000034
Do not reach its QoS requirement
Figure BDA0000045253640000035
Promptly
Figure BDA0000045253640000036
The time, with this Resource Block n *Distribute to this user k *, be about to Resource Block n *Join user k *The Resource Block set that distributes
Figure BDA0000045253640000037
In: this operation table is shown And with this Resource Block n *Distribute to this user k *Affiliated base station b is about to Resource Block n *Join the Resource Block set Φ that base station b distributes bIn: this operation table is shown Φ b=Φ b∪ { n *; The k of allocation vector Y *Row n *Row put 1: i.e. allocation vector
Figure BDA0000045253640000039
Until distributing all available resources or all users.
The obtaining of statistical channel state information when long described in the present invention based on following principle:
Set up departments the system in B sub-district arranged, each sub-district is that radius is the hexagon of D.A base station is arranged in each sub-district, be positioned at center of housing estate.K user is randomly dispersed in each sub-district, and maintenance is static and mobile at random between switching cycle in a switching cycle; The number of users that base station b is served is K b, establishing user k is d to the distance of base station b B, k, channel model comprises path attenuation (D/d B, k) γ, γ is a path loss index.The shadow fading s of logarithm B, k, Rayleigh fading h B, k, nWith additive white Gaussian noise n, noise variance is σ 2The transmitted power of base station is P; The signal that base station b sends for user k on Resource Block n is x B, k, n, the received signal of user k is so
y k , n = P ( D d b , k ) γ s b , k h b , k , n x b , k , n + Σ l = 1 , l ≠ b B Σ i = 1 , i ≠ k K P ( D d l , k ) γ s l . k h l , i , n x l , i , n + n ; - - - ( 1 )
Single local resource distribution module obtains the instantaneous channel condition information of user k on each Resource Block n by measuring
H b , k , n = P ( D d b , k ) γ s b , k h b , k , n ; - - - ( 2 )
Statistical channel state information when on average obtaining user k when growing by instantaneous channel condition information so to base station b length
G b , k , n = E { H b , k , n } . - - - ( 3 )
The statistical channel state information can reduce the expense that frequent Signalling exchange brings when many local resources distribution module was grown alternately by inter-base station interface; Statistical channel state information Resources allocation can be avoided disturbing stronger resource block assignments to give this sub-district channels of neighboring areas, thereby can improve the throughput of system of this sub-district during simultaneously according to length.
The principle that obligate information obtains described in the present invention is as follows:
If user's mobility model adopts mobility model at random, being the center of circle, with the movement speed v of user k with user k position kWith mobile resources reservation period t MRSVPProduct be optional in the circle of radius a bit as next position constantly, be the center of circle with user k position so, with the movement speed v of user k kWith mobile resources reservation period t MRSVPProduct be that the area shared percentage of circle in adjacent sub-district covers of radius is the probability that user k moves to the sub-district at b place, base station
p k , b = ( v k t MRSVP ) 2 arccos D - d b , k v k t MRSVP - ( D - d b , k ) ( v k t MRSVP ) 2 - ( D - d b , k ) 2 π ( v k t MRSVP ) 2 ; - - - ( 4 )
If p ThreFor reserving thresholding, if the business that user k uses is real time business, the definition mobile resources is reserved flag bit
ζ k，b＝sig(p k，b，p thre)， (5)
Sign function wherein
sig ( p k , b , p thre ) = 1 , p k , b &GreaterEqual; p thre 0 , p k , b < p thre ; - - - ( 6 )
User's membership is defined as: if mobile resources is reserved flag bit is 1: i.e. ζ K, b=1, user k has the reservation of surpassing thresholding p in the professional duration so ThreProbability be under the jurisdiction of base station b, be expressed as:
Figure BDA0000045253640000043
Figure BDA0000045253640000044
Be illustrated in to have in the professional duration to surpass and reserve thresholding p ThreUser's set of stopping in the sub-district at b place, base station of probability; When reserving thresholding p ThreLess than 1 o'clock, can exist user k to be under the jurisdiction of the situation of a plurality of sub-districts; When reserving thresholding p ThreBe 1 o'clock, distribute corresponding to many local resources of not considering resource reservation.
The Serving cell that may move in the phase at service conversation according to the measurable user of user's mobility model, and divide timing to shift to an earlier date reserved resource for these sub-districts at many local resources, can avoid the real time business burst to switch to this sub-district, because the professional packet loss phenomenon that inadequate resource causes improves the business experience of real time business user in moving process.
Compared with prior art, because the present invention unites and has considered user's mobility model, mobile subscriber's quality of service information, statistical channel state information when the minizone is long, proposed to introduce many local resources distribution method of mobile resources future mechanism, can obtain obligate information according to user's mobility model, statistical channel state information during then according to length, quality of services for users demand and obligate information are each base station assigns resource, avoid the frequent overtime packet loss of packet of causing for the delay sensitive business that switches in minizone, coordinate the distribution of minizone Resource Block simultaneously, can effectively avoid interference the maximization system throughput; Simulation result proves that this method in the less throughput of loss, can better improve mobile subscriber business and experience.
Description of drawings
Fig. 1 is many sub-districts link model;
Fig. 2 introduces the schematic block diagram of many local resources distribution method of mobile resources future mechanism for the present invention;
Fig. 3 is the relation curve of number of users and the networking telephone (VoIP) packet loss;
Fig. 4 is the relation curve of number of users and system throughput.
Embodiment
Embodiment below in conjunction with description of drawings the inventive method.
Embodiment 1:
Present embodiment adopts considers Long Term Evolution (LTE) system down link situation.If channel width is 10MHz, carrier frequency is 2GHz, and channel adopts the Rayleigh channel model.System comprises totally 1024 subcarriers, wherein remove left and right sides boundary belt, direct current subcarrier and pilot sub-carrier after, remain 600 data subcarriers altogether, be divided into 50 Resource Block, each Resource Block comprises 12 adjacent data subcarriers.Power is divided equally on each Resource Block.Descending sub frame is totally 14 OFDM data symbol, and a frame (10ms) comprises 10 subframes.Therefore a Resource Block is a 12*14=168 subcarrier.System's retardation factor Hys is 3dB during switching.Resource reservation probability threshold p ThreBe 0.1.
Corresponding real-time and non-real-time service, present embodiment adopts typical business network phone and HTML (Hypertext Markup Language) (FTP) to weigh systematic function.The QoS parameter is as shown in table 1 below.
Table 1 QoS parameter
Figure BDA0000045253640000051
Accompanying drawing 1 has provided the many sub-districts link model that adopts in the present embodiment: B sub-district arranged in the system, a base station that is positioned at center of housing estate is arranged in each sub-district; K user is randomly dispersed in each sub-district, and maintenance is static and mobile at random between switching cycle in a switching cycle; The number of users of base station b service is K bEach sub-district is that radius is the hexagon of D, and user k is d to the distance of the interior base station of base station b B, k
Accompanying drawing 2 has provided the schematic block diagram that the present invention introduces many local resources distribution method of mobile resources future mechanism.The long evolving system that adopts in the present embodiment mainly comprises mobile resources reservation module (7), many local resources distribution module (8), switch decision module (9) and (10) four modules of single local resource distribution module.
The channel condition information obtaining step: base station module (11) obtains the instantaneous channel condition information H of each user on each Resource Block by received signal formula (1) and instantaneous channel condition information formula (2) B, k, nAnd statistical channel state information formula (3) obtains statistical channel state information G when long when long B, k, nStatistical channel state information G when many local resources distribution module (8) obtains length by inter-base station interface B, k, n
The statistical channel state information can reduce the expense that frequent Signalling exchange brings when many local resources distribution module (8) was grown alternately by inter-base station interface; Statistical channel state information Resources allocation is avoided disturbing stronger resource block assignments to give this sub-district channels of neighboring areas during simultaneously according to length, improves the throughput of system of this sub-district.
The obligate information obtaining step: mobile resources reserves that new probability formula (4), mobile resources that module (7) moves to the sub-district under the b of base station by user k are reserved flag bit formula (5) and sign function formula (6) obtains obligate information
Figure BDA0000045253640000052
And send it to many local resources distribution module (8).
According to the measurable user of user's mobility model at service conversation possible Serving cell in the phase, and divide timing to shift to an earlier date reserved resource for these sub-districts at many local resources, can avoid the real time business burst to switch to this sub-district, because the professional packet loss phenomenon that inadequate resource causes improves the business experience of real time business user in moving process.
Many local resources allocation step: many local resources distribution module (8) is statistical channel state information G during according to minizone long B, k, n, resource obligate information
Figure BDA0000045253640000053
And the every superframe of QoS parameter that obtains of application layer module (12) carries out first resource and distributes, and determines the spendable Resource Block set in each sub-district according to many local resources allocation algorithm.
The concrete steps of described many local resources allocation algorithm are as follows:
At first initialization: establish the numbering base station b=1 of B base station, L, B represents; K user's numbering user k=1, L, K represents; The Resource Block set that all B base station is assigned to is changed to empty set Φ B, b=1...B=[]; The Resource Block set that all K user is assigned to is changed to empty set Ψ K, k=1..K=[]; The number of resource blocks of each user's request is set according to the application layer business information
Figure BDA0000045253640000061
Then to the numbering b=1 of all base stations, L, the number of resource blocks size (Φ that B has been assigned to according to all base stations b) and the base station in number of users K bRatio by descending sort; Then the set of the numbering of the base station after the ordering is
Figure BDA0000045253640000062
Wherein sort represents by descending sort, and size represents the size gathered; Check whether number of resource blocks Ψ that all users have distributed equals the Resource Block demand and count Ψ *, promptly whether satisfy Ψ=Ψ *, if, end loop then, allocation algorithm finishes; If not, then carry out subsequent process;
Top base station begins the zero clearing with allocation vector Y the numbering set ψ after ordering: i.e. allocation vector
Figure BDA0000045253640000063
Wherein
Figure BDA0000045253640000064
For
Figure BDA0000045253640000065
The null matrix of row N row; According to obligate information
Figure BDA0000045253640000066
To owning in this base station
Figure BDA0000045253640000067
The gain Ω of all N of individual user Resource Block difference computing system throughputs N, k: make interim allocation vector y equal the allocation vector of Resource Block n
Figure BDA0000045253640000068
Be expressed as
Figure BDA0000045253640000069
According to the shannon formula before distributing
Figure BDA00000452536400000610
Calculate the throughput of system T before Resource Block n distributes to user k K, n(y), wherein P is a base station transmitting power, G B, k, nStatistical channel state information during for length, σ 2Be noise variance, The interference of on Resource Block n, launching for all adjacent sub-districts; K the element of interim allocation vector y put 1, and this operation table is shown y+e K, n, e in the formula K, nFor
Figure BDA00000452536400000612
Dimensional vector, wherein the element of user k correspondence puts 1, all the other
Figure BDA00000452536400000613
Individual element is 0; According to the shannon formula after distributing
Figure BDA00000452536400000614
Calculating is distributed to throughput of system T behind the user k with Resource Block n K, n(y+e K, n), wherein P is a base station transmitting power, G B, k, nStatistical channel state information during for length, σ 2Be noise variance,
Figure BDA00000452536400000615
The interference of on Resource Block n, launching for all adjacent sub-districts; With the throughput of system T after distributing K, n(y+e K, n) deduct and distribute preceding throughput of system T K, n(y) obtain the gain Ω of throughput of system K, n, this operation table is shown Ω K, n=T K, n(y+e K, n)-T K, n(y); In calculating this base station all
Figure BDA00000452536400000616
The gain Ω of the throughput of system of all N Resource Block of individual user N, kSelection makes system throughput flow gain Ω N, kMaximum user k *With Resource Block n *, this operation table is shown: k *, n *← argmax Ω N, k, arg max Ω wherein N, kFor selecting to make system throughput flow gain Ω N, kMaximum user k *With Resource Block n *If the gain of throughput of system Greater than 0 and be user k *The Resource Block set that distributes
Figure BDA00000452536400000618
Do not reach its QoS requirement
Figure BDA00000452536400000619
Promptly
Figure BDA00000452536400000620
The time, with this Resource Block n *Distribute to this user k *, be about to Resource Block n *Join user k *The Resource Block set that distributes
Figure BDA00000452536400000621
In: this operation table is shown And with this Resource Block n *Distribute to this user k *Base station b under it is about to Resource Block n *Join the Resource Block set Φ that base station b distributes bIn: this operation table is shown Φ b=Φ b∪ { n *; The k of allocation vector Y *Row n *Row put 1: i.e. allocation vector
Figure BDA00000452536400000623
Until distributing all available resources or all users, algorithm finishes.
The switch decision step: switch decision module (9) adopts the cycle triggering mode, and each switching cycle is statistical channel state information G during according to user long B, k, nCome the select target sub-district; If i.e. statistical channel state information G during user k and base station d long D, k, nMean value on all Resource Block
Figure BDA0000045253640000071
Statistical channel state information G during greater than user k and base station b long B, k, nMean value on all Resource Block
Figure BDA0000045253640000072
With retardation factor Hys and, promptly
Figure BDA0000045253640000073
Then user k switches to base station b by base station d and allows access, otherwise refusal; Wherein switching cycle and retardation factor Hys are system configuration; If user k switches to base station b, user k belongs to the service-user set K of base station b so b: k ∈ K b
Single local resource allocation step: single local resource distribution module (10) obtains service-user set K in the sub-district by the switch decision step b, every subframe is according to the channel prompting message H of user on each Resource Block B, k, n, statistical channel state information G when long B, k, nWith the quality of service information of business, give this sub-district service-user for the resource block assignments of this base station many local resources module assigns; The optional polling algorithm of this allocation algorithm, maximum signal to noise ratio algorithm and Proportional Fair algorithm; The preferred proportion fair algorithm.
Accompanying drawing 3 is the simulation curve of network telephone service packet loss and number of users, and transverse axis is represented number of users among the figure, and scope is 19-76, and the longitudinal axis is represented the network telephone service packet loss.The many cell allocation of curve A are not introduced the curve of mobile resources reservation and single local resource allocation algorithm employing maximum signal to noise ratio algorithm, curve C is the curve that many cell allocation are not introduced mobile resources reservation and single local resource allocation algorithm employing equitable proportion algorithm, curve E is the curve that many cell allocation are introduced mobile resources reservation and single local resource allocation algorithm employing maximum signal to noise ratio algorithm, and curve F is the curve that many cell allocation introducing mobile resources reservations and single local resource allocation algorithm adopt the equitable proportion algorithm.Can see by Fig. 3, many local resources of introducing the mobile resources reservation are assigned as the network telephone service reserved resource of delay sensitive, avoided having significantly improved the business experience of network telephone service because the overtime packet loss of the inadequate resource generation that causes is switched in burst.The Proportional Fair algorithm has been considered user's fairness than the algorithm of only considering maximum signal to noise ratio, the probability that is not scheduled when reducing professional chief, thus reduced network telephone service because of the overtime packet loss that causes.
Accompanying drawing 4 is the simulation curve of system throughput and number of users, transverse axis statement number of users among the figure, and scope is 19-76, the longitudinal axis is represented system throughput.The many cell allocation of curve I are not introduced the curve of mobile resources reservation and single local resource allocation algorithm employing maximum signal to noise ratio algorithm, curve J is the curve that many cell allocation are introduced mobile resources reservation and single local resource allocation algorithm employing maximum signal to noise ratio algorithm, curve L is the curve that many cell allocation are not introduced mobile resources reservation and single local resource allocation algorithm employing equitable proportion algorithm, and curve M is the curve that many cell allocation are introduced mobile resources reservation and single local resource allocation algorithm employing equitable proportion algorithm.Can see that curve I, J, L, M are along with the increase of system load, system throughput also increases thereupon.Correlation curve I and J and curve L and M, cause the signal to noise ratio estimated more on the low side owing to considered interference that reserved resource brings when the part reserved resource can not utilize and estimate adjacent area interference, make the method for introducing the mobile resources future mechanism have less throughput loss than actual value.The equitable proportion algorithm causes the reduction of throughput with respect to the maximum signal to noise ratio algorithm owing to consider user fairness in addition.
Compared with prior art, because the present invention unites and has considered user's mobility model, mobile subscriber's quality of service information, statistical channel status information when the minizone is long, many cell resource allocation methods of mobile resources future mechanism have been proposed to introduce, obtain obligate information according to user's mobility model, statistical channel status information during then according to length, user's QoS requirement and obligate information are each base station assigns resource, avoid the frequent overtime packet loss of packet that causes to the delay sensitive business that switches in minizone, coordinate simultaneously the distribution of minizone Resource Block, can effectively avoid interference the maximization system throughput. Simulation results show, the present invention introduces many cell resource allocation methods of mobile resources future mechanism in the less throughput of loss, can better improve mobile subscriber business and experience.

Claims (1)

1.一种引入移动资源预留机制的多小区资源分配方法，首先基站通过基站间接口与邻小区多小区资源分配模块交换长时统计信道状态信息；多小区资源分配模块根据每超帧长时统计信道状态信息为各基站分配可用资源；切换判决模块在每个切换周期采用周期触发方式根据用户的长时统计信道状态信息来选择目标小区；单小区资源分配模块根据每子帧瞬时信道状态信息将该基站的可用资源分配给本小区服务用户；1. A multi-cell resource allocation method that introduces a mobile resource reservation mechanism. First, the base station exchanges long-term statistical channel state information with the multi-cell resource allocation module of adjacent cells through an interface between base stations; Statistical channel state information allocates available resources for each base station; the handover judgment module uses periodic triggering in each handover cycle to select the target cell according to the long-term statistical channel state information of the user; the single cell resource allocation module uses the instantaneous channel state information of each subframe Allocate the available resources of the base station to the service users of the cell; 其特征在于：It is characterized by: 基站通过测量得到瞬时信道状态信息Hb，k，n，将其长时平均得到长时统计信道状态信息Gb，k，n；多小区资源分配模块通过基站间接口交互获得长时统计信道状态信息Gb，k，n；The base station obtains the instantaneous channel state information H b, k, n through measurement, and averages it for a long time to obtain the long-term statistical channel state information G b, k, n ; the multi-cell resource allocation module obtains the long-term statistical channel state through the interface interaction between the base stations Information G b, k, n ; 核心网中的移动资源预留模块根据用户移动模型得到预留信息并将其传送给多小区资源分配模块；The mobile resource reservation module in the core network obtains reservation information according to the user mobility model and transmit it to the multi-cell resource allocation module; 多小区资源分配模块根据资源预留信息小区间的长时统计信道状态信息Gb，k，n和应用层模块得到的业务服务质量参数，每超帧进行一次资源分配，根据多小区资源分配算法决定各个小区可使用的资源块集合；The multi-cell resource allocation module is based on resource reservation information The long-term statistical channel state information Gb, k, n between cells and the business service quality parameters obtained by the application layer module perform resource allocation once per superframe, and determine the set of resource blocks that can be used by each cell according to the multi-cell resource allocation algorithm; 所述多小区资源分配算法的步骤为：The steps of the multi-cell resource allocation algorithm are: 首先初始化：设B个基站的编号用基站b＝1，L，B表示；K个用户的编号用用户k＝1，L，K表示；将所有B个基站分到的资源块集合置为空集Φb，b＝1...B＝[]；将所有K个用户分到的资源块集合置为空集Ψk，k＝1..K＝[]；根据应用层业务信息设置每个用户需求的资源块数
Figure FDA0000045253630000013
Initialize first: set the numbers of B base stations to be represented by base station b=1, L, B; the numbers of K users are represented by users k=1, L, K; set the resource block sets allocated to all B base stations to be empty Set Φ b, b = 1...B = []; set the resource block set assigned to all K users as an empty set Ψ k, k = 1..K = []; set each The number of resource blocks required by a user
Figure FDA0000045253630000013
 然后对基站编号b＝1，L，B的所有基站编号根据所有基站已分配到的资源块数size(Φb)和基站内用户数Kb的比值按降序排序，则排序后的基站的编号集合为
Figure FDA0000045253630000014
其中sort表示按降序排序，size表示集合的大小；检查所有用户已分配的资源块数Ψ是否等于资源块需求数Ψ*，即是否满足Ψ＝Ψ*，如果是，则结束循环，分配算法结束；如果否，则执行后续过程；Then base station numbers b=1, L, all base station numbers of B are sorted in descending order according to the ratio of the resource block number size (Φ b ) allocated to all base stations and the number of users K b in the base station, then the number of the sorted base stations set as
Figure FDA0000045253630000014
Among them, sort means sorting in descending order, and size means the size of the set; check whether the number of resource blocks Ψ allocated by all users is equal to the number of resource block requirements Ψ * , that is, whether Ψ = Ψ * is satisfied, if so, end the loop and the allocation algorithm ends ; If not, execute the follow-up process; 从排序后的编号集合ψ中最前面的基站开始将分配向量Y清零：即分配向量
Figure FDA0000045253630000015
其中
Figure FDA0000045253630000016
为行N列的零矩阵；根据预留信息
Figure FDA0000045253630000018
对在该基站内的所有个用户的所有N个资源块分别计算系统吞吐量的增益Ωn，k：令临时分配向量y等于资源块n的分配向量
Figure FDA00000452536300000110
表示为
Figure FDA00000452536300000111
根据分配前的香农公式计算得到资源块n分配给用户k前的系统吞吐量Tk，n(y)，其中P为基站发射功率，Gb，k，n为长时统计信道状态信息，σ2为噪声方差，
Figure FDA00000452536300000113
为所有邻小区在资源块n上发射的干扰；将临时分配向量y的第k个元素置1，该操作表示为y+ek，n，式中ek，n为
Figure FDA00000452536300000114
维向量，其中用户k对应的元素置1，其余
Figure FDA0000045253630000021
个元素为0；根据分配后的香农公式
Figure FDA0000045253630000022
计算将资源块n分配给用户k后的系统吞吐量Tk，n(y+ek，n)，其中P为基站发射功率，Gb，k，n为长时统计信道状态信息，σ2为噪声方差，
Figure FDA0000045253630000023
为所有邻小区在资源块n上发射的干扰；将分配后的系统吞吐量Tk，n(y+ek，n)减去分配前的系统吞吐量Tk，n(y)得到系统吞吐量的增益Ωk，n，该操作表示为Ωk， n＝Tk，n(y+ek，n)-Tk，n(y)；直至计算出该基站内的所有
Figure FDA0000045253630000024
个用户的所有N个资源块的系统吞吐量的增益Ωn，k；选择使系统吞吐量增益Ωn，k最大的用户k*和资源块n*，该操作表示为：k*，n*←arg maxΩn，k，其中arg maxΩn，k为选择使系统吞吐量增益Ωn，k最大的用户k*和资源块n*；如果系统吞吐量的增益
Figure FDA0000045253630000025
大于0并且为用户k*分配的资源块集合
Figure FDA0000045253630000026
未达到其服务质量需求
Figure FDA0000045253630000027
即
Figure FDA0000045253630000028
时，将该资源块n*分配给该用户k*，即将资源块n*加入到用户k*分配的资源块集合
Figure FDA0000045253630000029
中：该操作表示为
Figure FDA00000452536300000210
并将该资源块n*分配给该用户k*所属的基站b，即将资源块n*加入到基站b分配的资源块集合Φb中：该操作表示为Φb＝Φb∪{n*}；分配向量Y的第k*行第n*列置1：即分配向量
Figure FDA00000452536300000211
直至分配完所有可用资源或所有用户。Starting from the frontmost base station in the sorted number set ψ, the allocation vector Y is cleared: that is, the allocation vector
Figure FDA0000045253630000015
in
Figure FDA0000045253630000016
for Zero matrix with rows and N columns; according to reserved information
Figure FDA0000045253630000018
For all in the base station Calculate the system throughput gain Ω n,k for all N resource blocks of a user respectively: let the temporary allocation vector y be equal to the allocation vector of resource block n
Figure FDA00000452536300000110
Expressed as
Figure FDA00000452536300000111
According to Shannon's formula before allocation Calculate the system throughput T k, n (y) before the resource block n is allocated to user k, where P is the base station transmit power, G b, k, n is the long-term statistical channel state information, σ 2 is the noise variance,
Figure FDA00000452536300000113
is the interference transmitted by all neighboring cells on resource block n; set the kth element of the temporary allocation vector y to 1, and this operation is expressed as y+e k,n , where e k,n is
Figure FDA00000452536300000114
dimension vector, where the element corresponding to user k is set to 1, and the rest
Figure FDA0000045253630000021
elements are 0; according to the assigned Shannon formula
Figure FDA0000045253630000022
Calculate the system throughput T k,n (y+e k,n ) after resource block n is allocated to user k, where P is the transmit power of the base station, G b,k,n is the long-term statistical channel state information, σ 2 is the noise variance,
Figure FDA0000045253630000023
is the interference transmitted by all neighboring cells on resource block n; the system throughput after allocation T k,n (y+e k,n ) is subtracted from the system throughput before allocation T k,n (y) to obtain the system throughput The gain Ω k, n of quantity, this operation is expressed as Ω k, n = T k, n (y+e k, n )-T k, n (y); until all the
Figure FDA0000045253630000024
The system throughput gain Ω n, k of all N resource blocks of a user; select the user k * and the resource block n * that make the system throughput gain Ω n, k the largest, the operation is expressed as: k * , n * ←arg maxΩ n, k , where arg maxΩ n, k is the user k * and resource block n * selected to maximize the system throughput gain Ω n, k ; if the gain of system throughput
Figure FDA0000045253630000025
is greater than 0 and is the set of resource blocks allocated for user k *
Figure FDA0000045253630000026
Not meeting its quality of service requirements
Figure FDA0000045253630000027
Right now
Figure FDA0000045253630000028
, allocate the resource block n * to the user k * , that is, add the resource block n * to the set of resource blocks allocated by user k *
Figure FDA0000045253630000029
In: the operation is expressed as
Figure FDA00000452536300000210
And allocate the resource block n * to the base station b to which the user k * belongs, that is, add the resource block n * to the resource block set Φ b allocated by the base station b: this operation is expressed as Φ b =Φ b ∪{n * } ;The k * th row and n * th column of the allocation vector Y are set to 1: that is, the allocation vector
Figure FDA00000452536300000211
Until all available resources or all users are allocated.
CN201110027346.7A 2011-01-25 2011-01-25 Multi-cell resource allocation method introducing mobile resource reserve mechanism Expired - Fee Related CN102098746B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201110027346.7A CN102098746B (en) 2011-01-25 2011-01-25 Multi-cell resource allocation method introducing mobile resource reserve mechanism

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201110027346.7A CN102098746B (en) 2011-01-25 2011-01-25 Multi-cell resource allocation method introducing mobile resource reserve mechanism

Publications (2)

Publication Number Publication Date
CN102098746A true CN102098746A (en) 2011-06-15
CN102098746B CN102098746B (en) 2013-08-07

Family

ID=44131561

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201110027346.7A Expired - Fee Related CN102098746B (en) 2011-01-25 2011-01-25 Multi-cell resource allocation method introducing mobile resource reserve mechanism

Country Status (1)

Country Link
CN (1) CN102098746B (en)

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103037513A (en) * 2011-09-30 2013-04-10 上海贝尔股份有限公司 Method for enhancing downlink control information for improving system spectral efficiency
CN103401635A (en) * 2013-06-28 2013-11-20 国家超级计算深圳中心(深圳云计算中心) Method and device for analyzing throughout collapse behavior in cluster storage system
CN103687011A (en) * 2012-09-04 2014-03-26 华为技术有限公司 Wireless resource allocation method and system, and access network equipment
CN104883740A (en) * 2014-02-28 2015-09-02 普天信息技术有限公司 Base station and user terminal multi-cell implement method and apparatus
CN105636227A (en) * 2016-01-12 2016-06-01 青岛智能产业技术研究院 Dynamic radio resource management and interface control method in presence of parallel network
WO2017092377A1 (en) * 2015-12-03 2017-06-08 中兴通讯股份有限公司 Dynamic resource allocation method and device in mobile communication system
WO2017148243A1 (en) * 2016-03-03 2017-09-08 中兴通讯股份有限公司 Control method and system for data transmission, and data transmission method and device
CN108471641A (en) * 2018-06-05 2018-08-31 京信通信系统（中国）有限公司 The subscriber resource distribution method and system of multiple cell
CN108738151A (en) * 2018-05-18 2018-11-02 北京航空航天大学 A kind of wireless prediction resource allocation methods based on coarse information
CN109195224A (en) * 2018-10-12 2019-01-11 南方电网科学研究院有限责任公司 Wireless communication resource allocation system and method for intelligent power distribution and utilization service
CN110719610A (en) * 2018-07-11 2020-01-21 普天信息技术有限公司 Method and device for seizing service resources
CN111711986A (en) * 2020-05-06 2020-09-25 哈尔滨工业大学 UC-UDN proportional fair resource allocation method in 5G communication system
CN112601285A (en) * 2020-11-26 2021-04-02 国网电力科学研究院有限公司 Resource allocation method and system based on service quality in 5G scene

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101047622A (en) * 2006-03-29 2007-10-03 华为技术有限公司 Method for scheduling system resource
CN101465811A (en) * 2009-01-07 2009-06-24 上海大学 Method for obligating resource based on layered mobile IPv6 protocol
EP2096796A1 (en) * 2006-12-15 2009-09-02 Panasonic Corporation Radio communication device

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101047622A (en) * 2006-03-29 2007-10-03 华为技术有限公司 Method for scheduling system resource
EP2096796A1 (en) * 2006-12-15 2009-09-02 Panasonic Corporation Radio communication device
CN101465811A (en) * 2009-01-07 2009-06-24 上海大学 Method for obligating resource based on layered mobile IPv6 protocol

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
林蔚: "自组网多径适应动态资源预留路由协议", 《哈尔滨工业大学学报》, vol. 41, no. 1, 31 January 2009 (2009-01-31), pages 1 - 3 *

Cited By (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103037513B (en) * 2011-09-30 2016-08-03 上海贝尔股份有限公司 Strengthen Downlink Control Information with the method improving system spectral efficiency
CN103037513A (en) * 2011-09-30 2013-04-10 上海贝尔股份有限公司 Method for enhancing downlink control information for improving system spectral efficiency
CN103687011A (en) * 2012-09-04 2014-03-26 华为技术有限公司 Wireless resource allocation method and system, and access network equipment
CN103687011B (en) * 2012-09-04 2017-12-01 华为技术有限公司 Wireless resource allocation methods and system, access network equipment
CN103401635A (en) * 2013-06-28 2013-11-20 国家超级计算深圳中心(深圳云计算中心) Method and device for analyzing throughout collapse behavior in cluster storage system
CN104883740A (en) * 2014-02-28 2015-09-02 普天信息技术有限公司 Base station and user terminal multi-cell implement method and apparatus
WO2017092377A1 (en) * 2015-12-03 2017-06-08 中兴通讯股份有限公司 Dynamic resource allocation method and device in mobile communication system
CN106851747A (en) * 2015-12-03 2017-06-13 中兴通讯股份有限公司 Dynamic resource allocation method and device in a kind of GSM
CN106851747B (en) * 2015-12-03 2022-04-22 中兴通讯股份有限公司 Dynamic resource allocation method and device in mobile communication system
CN105636227A (en) * 2016-01-12 2016-06-01 青岛智能产业技术研究院 Dynamic radio resource management and interface control method in presence of parallel network
WO2017148243A1 (en) * 2016-03-03 2017-09-08 中兴通讯股份有限公司 Control method and system for data transmission, and data transmission method and device
CN108738151B (en) * 2018-05-18 2020-08-28 北京航空航天大学 A wireless prediction resource allocation method based on rough information
CN108738151A (en) * 2018-05-18 2018-11-02 北京航空航天大学 A kind of wireless prediction resource allocation methods based on coarse information
CN108471641A (en) * 2018-06-05 2018-08-31 京信通信系统（中国）有限公司 The subscriber resource distribution method and system of multiple cell
CN108471641B (en) * 2018-06-05 2022-05-06 京信网络系统股份有限公司 Multi-cell user resource allocation method and system
CN110719610A (en) * 2018-07-11 2020-01-21 普天信息技术有限公司 Method and device for seizing service resources
CN109195224A (en) * 2018-10-12 2019-01-11 南方电网科学研究院有限责任公司 Wireless communication resource allocation system and method for intelligent power distribution and utilization service
CN109195224B (en) * 2018-10-12 2023-05-02 南方电网科学研究院有限责任公司 Wireless communication resource allocation system and method for intelligent power distribution and utilization service
CN111711986A (en) * 2020-05-06 2020-09-25 哈尔滨工业大学 UC-UDN proportional fair resource allocation method in 5G communication system
CN111711986B (en) * 2020-05-06 2022-06-07 哈尔滨工业大学 UC-UDN proportional fair resource allocation method in 5G communication system
CN112601285A (en) * 2020-11-26 2021-04-02 国网电力科学研究院有限公司 Resource allocation method and system based on service quality in 5G scene
CN112601285B (en) * 2020-11-26 2023-11-17 国网电力科学研究院有限公司 A resource allocation method and system based on service quality in 5G scenarios

Also Published As

Publication number Publication date
CN102098746B (en) 2013-08-07

Similar Documents

Publication Publication Date Title
CN102098746B (en) Multi-cell resource allocation method introducing mobile resource reserve mechanism
Zheng et al. Dynamic performance analysis of uplink transmission in cluster-based heterogeneous vehicular networks
CN103024921B (en) A kind of dispatching method divided into groups based on CQI feedback parameter and SINR numerical value
CN102118759A (en) Downlink transmission frequency division method for cooperating multipoint transmission system on the basis of service quality
CN102036385B (en) Method for scheduling resources among cells, base stations, user equipment and mobile communication system
CN101505482A (en) Semi-distribution type resource distribution method and system
CN101141793B (en) Switch judging method of mobile communication service and mobile communication system
CN102098792B (en) A Round Robin Resource Scheduling Method Based on Quality of Service
CN102378386A (en) Wireless resource scheduling method of LTE (Long Term Evolution) uplink
Masmoudi et al. Efficient radio resource management for D2D-based LTE-V2X communications
Asadi et al. Floating band D2D: Exploring and exploiting the potentials of adaptive D2D-enabled networks
CN102256214B (en) Dynamic channel allocation method for comprehensive services and transmission characteristics of CDMA (Code Division Multiple Access) cluster system
CN102395158A (en) Load balance optimization method considering user service quality requirements in mobile communication system
Yang et al. Resource sharing for device-to-device communications underlaying full-duplex cellular networks
CN102333377A (en) Resource allocation method for avoiding cross-slot interference in long-term evolution time-division system
CN102752757A (en) Method for optimizing frequency spectrum allocation according to minimal waste criterion in frequency spectrum aggregation process
CN101491048B (en) Transmission method and apparatus for the transmission of data in a radio communications system
CN102932308B (en) Mixed service Scene dispatch method and dispatching patcher in a kind of OFDM relay system
Ismaiel et al. PCF-based LTE Wi-Fi aggregation for coordinating and offloading the cellular traffic to D2D network
CN107852708A (en) System and method for carrying out radio resources allocation across multiple resource dimensions
Li et al. A traffic flow-based and dynamic grouping-enabled resource allocation algorithm for LTE-D2D vehicular networks
Olexandr et al. Slot allocation model and data burst scheduling in downlink WiMAX technology
CN101883363B (en) Resource allocation method, device and system
Park et al. Fair semi-distributed resource allocation scheme over relay-enhanced OFDMA networks
CN103281695B (en) A kind of hop relay network frequency spectrum planing method

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

Granted publication date: 20130807

Termination date: 20160125

EXPY Termination of patent right or utility model