CN101568156B - Method and device for radio resource scheduling and base station - Google Patents

Method and device for radio resource scheduling and base station Download PDF

Info

Publication number
CN101568156B
CN101568156B CN2008101050229A CN200810105022A CN101568156B CN 101568156 B CN101568156 B CN 101568156B CN 2008101050229 A CN2008101050229 A CN 2008101050229A CN 200810105022 A CN200810105022 A CN 200810105022A CN 101568156 B CN101568156 B CN 101568156B
Authority
CN
China
Prior art keywords
user
real
bunch
carrier wave
scheduled
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.)
Expired - Fee Related
Application number
CN2008101050229A
Other languages
Chinese (zh)
Other versions
CN101568156A (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.)
China Mobile Communications Group Co Ltd
Original Assignee
China Mobile Communications Group Co Ltd
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 China Mobile Communications Group Co Ltd filed Critical China Mobile Communications Group Co Ltd
Priority to CN2008101050229A priority Critical patent/CN101568156B/en
Publication of CN101568156A publication Critical patent/CN101568156A/en
Application granted granted Critical
Publication of CN101568156B publication Critical patent/CN101568156B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention discloses a method for radio resource scheduling, which comprises the following steps: aiming at carrier clusters to be scheduled, determining scheduling information of each real-time service user and scheduling information of each non-real time service user containing the current queue time delay of the non-real time service user; according to the determined scheduling information of each user, calculating the priority of each user on the carrier clusters to be scheduled; and scheduling the carrier clusters to be scheduled to the user with calculated highest priority. Correspondingly, the invention also discloses a device for radio resource scheduling and a base station. The invention can fairly treat the real-time service users and the non-real time service users on the basis of simultaneously ensuring Qos of the real-time service users and the non-real time service users, and ensure the service continuity of the non-real time service users.

Description

Scheduling method for wireless resource and device thereof, base station
Technical field
The present invention relates to wireless communication technology field, relate in particular to a kind of scheduling method for wireless resource and device thereof, base station.
Background technology
Providing at the same time in the communication system of real time business and non-real-time service, all is to calculate the priority of each user on carrier resource to be scheduled respectively usually, then carrier resource to be scheduled is distributed to the highest user of priority above that.
As shown in Figure 1, for the scheduling sketch map of packet radio scheduling scheme in the prior art, on down link, the data buffering formation of a correspondence is set up in the base station for each user; In each dispatching cycle, the user measures the channel conditions of oneself, and through the dedicated uplink feedback channel self channel conditions is fed back to the base station.The base station is confirmed each user retrievable instantaneous data rates on carrier resource to be scheduled respectively according to the channel conditions of each user feedback; And the instantaneous data rates that on carrier resource to be scheduled, obtains according to each user who confirms; And each user's out of Memory; Like user's queue length, service quality (QoS), queuing delay etc.; Calculate the dispatching priority of each user on carrier resource to be scheduled, according to priority orders each user is sorted then, and carrier resource to be scheduled is distributed to the highest user of priority.
Wherein the packet scheduling on the wireless fading channel is a very important research direction in the communications field always.On the one hand; GSM is a resource limited system; How to utilize limited system resource to satisfy growing user's request; Become GSM manufacturer and operator's urgent problem, this just requires GSM to utilize existing Radio Resource more rationally, fully, and utilizing limited system resource as much as possible is that more user provides better service.On the other hand, in present GSM, need support multiple business simultaneously, such as, VoIP, FTP, WWW, E-mail, business such as Video Streaming.Different service has different qos requirements, how to ensure the QoS demand of different business, also is a very important research direction in the GSM.
Therefore as a key technology, the wireless resource scheduling technology has become whether GSM system of measurement is feasible, the criterion of system service quality good or not.The wireless resource scheduling scheme can make full use of the time-varying characteristics of channel under the prerequisite that guarantees QoS of survice efficiently, realizes multi-user diversity gain, to improve the professional Mean Speed and the resistance to overturning of system.Wherein the wireless resource scheduling scheme must be taken into account efficient and fair two aspects; That is to say; Should make the best CU resource of channel condition to improve throughput of system; Also to make the relatively poor relatively user of channel condition can access the dispatcher meeting within a certain period of time, guarantee continuity that it is professional and the fairness between the user.
But provide at the same time in the GSM of real time business and non-real-time service at present; When carrying out scheduling of resource for the user; Usually do not consider non-real-time service user's queuing delay factor; Will cause the real time business user's of same channel conditions dispatching priority always to be higher than non-real-time service user's dispatching priority like this, make the real time business user always preferentially obtain scheduling, and make the non-real-time service user can not get scheduling for a long time; Thereby have influence on non-real-time service user's business continuance, and lose fairness the non-real-time service user.
Summary of the invention
The present invention provides a kind of scheduling method for wireless resource and device thereof, base station; On the basis that guarantees real time business user and non-real-time service user QoS at the same time; Be impartial to real time business user and non-real-time service user guarantee non-real-time service user's business continuance.
The invention provides a kind of scheduling method for wireless resource, comprise, confirm each real time business user's schedule information, and each comprises the non-real-time service user's of the current queuing delay of non-real-time service user schedule information to carrier wave to be scheduled bunch; According to each user's who confirms schedule information, calculate the priority of each user on this carrier wave to be scheduled bunch; And this carrier wave to be scheduled bunch scheduling given the highest user of priority calculate.
The present invention also provides a kind of wireless resource scheduling device; Comprise that schedule information confirms the unit; Be used for confirm each real time business user's schedule information, and each comprising the non-real-time service user's of the current queuing delay of non-real-time service user schedule information to carrier wave to be scheduled bunch; Priority calculation unit is used for the schedule information according to each user who confirms, calculates the priority of each user on this carrier wave to be scheduled bunch; And scheduling unit, be used for giving the highest user of priority who calculates with this carrier wave to be scheduled bunch scheduling.
The present invention also provides a kind of base station; Comprise that schedule information confirms the unit; Be used for confirm each real time business user's schedule information, and each comprising the non-real-time service user's of the current queuing delay of non-real-time service user schedule information to carrier wave to be scheduled bunch; Priority calculation unit is used for the schedule information according to each user who confirms, calculates the priority of each user on this carrier wave to be scheduled bunch; And scheduling unit, be used for giving the highest user of priority who calculates with this carrier wave to be scheduled bunch scheduling.
Wireless resource scheduling scheme of the present invention provides in the GSM of real time business and non-real-time service at the same time; When carrying out scheduling of resource, taken into full account non-real-time service user's queuing delay; Like this will be on the basis of basic assurance real time business user QoS; Avoided real time business user's priority always to be higher than non-real-time service user's priority; Cause the non-real-time service user to can not get scheduling for a long time, thereby guaranteed non-real-time service user's business continuance and QoS preferably.
Description of drawings
To combine each accompanying drawing that the practical implementation process of technical scheme of the present invention is carried out elaboration below, wherein in each accompanying drawing:
Fig. 1 is the scheduling sketch map of packet radio scheduling scheme in the prior art;
Fig. 2 is the embodiment process chart of scheduling method for wireless resource of the present invention;
Fig. 3 is the utility function curve synoptic diagram that real time business user and non-real-time service user's among the present invention program queuing delay changes;
Fig. 4 is the concrete composition structured flowchart of resource scheduling device of the present invention.
Embodiment
Design concept of the present invention is at the same time real time business user and non-real-time service user to be carried out in the GSM of scheduling of resource; Take into full account non-real-time service user's queuing delay; Avoid the non-real-time service user to can not get scheduling for a long time; Thereby on the basis of basic assurance real time business user QoS, guarantee non-real-time service user's business continuance and QoS.
As shown in Figure 2, be the embodiment process chart of scheduling method for wireless resource of the present invention, its concrete implementation procedure is following:
Step 10; To the carrier wave to be scheduled bunch (Resource Block that a plurality of carrier waves lump together on the carrier wave bunch finger frequency domain; Can comprise a number of sub-carrier or at least two number of sub-carrier); Confirm each real time business user's schedule information, and confirm that each comprises the non-real-time service user's of the current queuing delay of non-real-time service user schedule information;
Step 20 according to above-mentioned definite each user's schedule information, is calculated the priority of each user on this carrier wave to be scheduled bunch respectively;
Step 30 according to the precedence information of each user who calculates on this carrier wave to be scheduled bunch, is given this carrier wave to be scheduled bunch scheduling the highest user of priority who calculates.
Technical scheme of the present invention is come the satisfaction of assesses user to wireless communication system, i.e. user's QoS through using the utility function theory in the microeconomics.The main thought of utility function is that system resource (like bandwidth, power etc.) or performance index (like data speed, time delay etc.) are mapped to corresponding value of utility, to be used for optimizing whole communication system.Utility function all plays a part very crucial at aspects such as RRM and guarantee user qos requirements.
The embodiment of the invention is used U here k(d k) represent the utility function of user k, promptly use U k(d k) representative of consumer k is to the satisfaction of GSM, d kThe queuing delay of expression user k.Because along with the increase of queuing delay, user's satisfaction descends gradually, and this utility function should be successively decreased; And, allowing queuing delay the closer to this maximum for the maximum permission queuing delay that business is stipulated, user's satisfaction descends fast more, and more away from the place of this maximum permission queuing delay, the user takes notice of less very much more.So the derivative of this utility function also successively decreases, and be negative value.So U k(d k) should be a non-negative monotone decreasing convex function.Total be exactly the utility function value of the optimization aim of embodiment of the invention maximization that is to say to let all users' satisfaction (qos value) sum maximum.
Based on above-mentioned principle, the embodiment of the invention provides following optimization aim function here:
max Σ k = 1 K U k ( d k )
over?d k≥0，1≤k≤K
Wherein, K is the number of excited users in the sub-district.
The embodiment of the invention is used r K, m(n) expression user k in current scheduling time slot n on carrier wave bunch m obtainable instantaneous data rates; Generally can be according to the channel quality status of real time business user and non-real-time service reporting of user; Confirm real time business user and non-real-time service user respectively in current scheduling time slot n, obtainable instantaneous data rates on this carrier wave to be scheduled bunch.
Calculate the Mean Speed of user k in current scheduling time slot n according to following account form:
R k ( n ) = ( 1 - 1 T c ) R k ( n - 1 ) + 1 T c r k ( n - 1 ) ;
R wherein k(n) represent the Mean Speed that user k obtains in current scheduling time slot n; R k(n-1) Mean Speed of expression user k in a last time slot scheduling n-1; T cExpression sliding time window, normally slot length T sIntegral multiple; Wherein:
r k ( n - 1 ) = Σ m = 1 M r k , m ( n - 1 ) · δ k ( n - 1 ) ;
r k(n-1) represent user k in a last time slot scheduling n-1, the instantaneous data rates sum on each carrier wave bunch m that is dispatched to; r K, m(n-1) expression user k is in last a time slot scheduling n-1, the instantaneous data rates of acquisition on m the carrier wave that is dispatched to bunch; δ k(n-1) be the variable of expression carrier wave bunch distribution condition, if m carrier wave bunch given the user k n-1 time slot allocation, δ then k(n-1)=1, otherwise, δ then k(n-1)=0; M is the carrier wave number of clusters order that supplies scheduling in the system.In the sub-district, disturb, in each time slot scheduling, multiple-input and multiple-output (MIMO) channel of each carrier wave bunch correspondence can only be distributed to a user uniquely, so equality is arranged Σ k = 1 K δ k , m ( n - 1 ) = 1 Set up, if user k is not scheduled for any carrier wave bunch, then r in n-1 time slot k(n-1)=0.
If use d k(n) the expression queuing delay of user k in current scheduling time slot n, then according to above-mentioned definite each non-real-time service user's schedule information, calculate the priority of each non-real-time service user on this carrier wave to be scheduled bunch in the following manner:
k ^ = | ∂ U k ( 1 ) ∂ d k | · r k , m ( n ) R k ( n ) ;
And, calculate the priority of each real time business user on this carrier wave to be scheduled bunch in the following manner according to above-mentioned definite each real time business user's schedule information:
k ^ = | ∂ U k ( 2 ) ∂ d k | · r k , m ( n ) R k ( n ) · w ;
Wherein,
Figure S2008101050229D00063
The priority of expression user k on this carrier wave to be scheduled bunch; r K, m(n) instantaneous data rates that in current scheduling time slot n, on this carrier wave to be scheduled bunch, obtains of expression user k; R k(n) represent the Mean Speed that user k obtains in current scheduling time slot n; W is a correction factor, is used for regulating according to actual conditions real time business user's priority, and wherein w is big more, helps improving real time business user's priority more, is traditionally arranged to be the numerical value greater than 1;
Figure S2008101050229D00064
expression and non-real-time service user's queuing delay, the first relevant utility function of maximum queuing delay that non-real-time service allows;
Figure S2008101050229D00065
expression and real time business user's queuing delay, the second relevant utility function of maximum queuing delay that real time business allows.Can change functional value or select different utility functions according to real business demand particularly.
Should be the non-negative subtraction function of a strictly monotone with user's queuing delay as the utility function of index, and epirelief.The embodiment of the invention is here with s type function f (t)=1-(1+e -α (t-β)) -1, α＞0, β＞0 are example, as real time business user's utility function.Wherein, parametric t is represented real time business user's queuing delay, and β representes the maximum queuing delay that real time business allows; α and β determine the position of the slope and the gradient mid point of this utility function respectively.Usually, α is big more, and the gradient of this utility function is just precipitous more, and utility function is also just big more at the absolute value of the derivative of gradient mid point.
Wherein, mainly contain the consideration of the following aspects for the real time business user selects the s type function:
(1) before downward trend appears in the s type function, generally all more smooth, so its derivative absolute value is less, so during this period of time, the non-real-time service user can preferentially obtain scheduling;
(2) when maximum queuing delay that real time business user's queuing delay allows near real time business; This moment, the s type function began to descend, and the severe of decline is determined that by α α is big more; Decline Shaoxing opera is strong; The absolute value of its derivative is also just big more, makes the real time business user obtain higher scheduling weights, to reduce real time business user's packet loss;
(3) because the characteristics of s type function; When real time business user's queuing delay surpasses the maximum queuing delay of real time business permission; Value of utility is not to drop to 0 immediately; But a process that descends is gradually arranged, can make the real time business user continue to participate in the scheduling of resource like this, thereby can further reduce real time business user's packet loss.
As far as the non-real-time service user, because its requirement to queuing delay is so strict unlike the real time business user, if but the service that can't accept for a long time also can cause non-real-time service user's satisfaction to descend.So non-real-time service user's queuing delay is commonly referred to as " soft time delay ", along with the increase of queuing delay, its utility function value also can descend gradually.Therefore, the embodiment of the invention is selected f (t)=1-ce here for use A (t-b), a＞0, b＞0, c＞0 is as non-real-time service user's utility function.Wherein t representes non-real-time service user's queuing delay, and b representes the maximum queuing delay that non-real-time service allows; A, c and b determine slope, amplitude and the delay requirement of this utility function respectively.
Utility function curve synoptic diagram as shown in Figure 3, as to change for real time business user among the present invention program and non-real-time service user's queuing delay.
According to the aforementioned calculation mode; The dispatching priority of each user on this carrier wave to be scheduled bunch m can be calculated; Therefrom select user , should distribute to user
Figure S2008101050229D00072
by a carrier wave to be scheduled bunch m with maximum dispatching priority.Then,, dispatch next carrier wave bunch again according to identical scheduling scheme, up to all carrier waves bunch be scheduled finish till.The user who is scheduled for carrier wave bunch just can be at its corresponding channel data bit.
Corresponding, the present invention also provides a kind of wireless resource scheduling device, and this device is generally the base station equipment in the communication system; As shown in Figure 4; Be the concrete composition structured flowchart of resource scheduling device of the present invention, wherein schedule information is confirmed unit 100, is used for to carrier wave to be scheduled bunch; Confirm each real time business user's schedule information, and confirm that each comprises the non-real-time service user's of the current queuing delay of non-real-time service user schedule information; Priority calculation unit 200 is used for confirming according to schedule information each user's that unit 100 is confirmed schedule information, calculates the priority of each user on this carrier wave to be scheduled bunch; Scheduling unit 300 is used for the highest user of priority who calculates to priority calculation unit 200 this carrier wave to be scheduled bunch scheduling.
In the above-mentioned wireless resource scheduling device; Schedule information confirms that unit 100 confirms real time business users' schedule information and non-real-time service user's the concrete realization of schedule information; And priority calculation unit 200 is according to each real time business user's schedule information and each non-real-time service user's schedule information; Calculate the account form of the priority of each user on this carrier wave to be scheduled bunch, in the practical implementation of said method, given detailed elaboration, no longer give unnecessary details here.
Obviously, those skilled in the art can carry out various changes and modification to the present invention and not break away from the spirit and scope of the present invention.Like this, belong within the scope of claim of the present invention and equivalent technologies thereof if of the present invention these are revised with modification, then the present invention also is intended to comprise these changes and modification interior.

Claims (7)

1. a scheduling method for wireless resource is characterized in that, comprising:
To carrier wave to be scheduled bunch, confirm each real time business user's schedule information, and each comprises the non-real-time service user's of the current queuing delay of non-real-time service user schedule information;
According to each user's who confirms schedule information, calculate the priority of each user on this carrier wave to be scheduled bunch; And
This carrier wave to be scheduled bunch scheduling is given the highest user of priority who calculates;
Comprise the instantaneous data rates that maximum queuing delay that the current queuing delay of the current Mean Speed of real time business user, real time business user, real time business allow and real time business user obtain in said real time business user's the schedule information on this carrier wave to be scheduled bunch;
Also comprise the instantaneous data rates that maximum queuing delay that the current Mean Speed of non-real-time service user, non-real-time service allow and non-real-time service user obtain in said non-real-time service user's the schedule information on this carrier wave to be scheduled bunch;
Wherein, according to each the non-real-time service user's who confirms schedule information, calculate the priority of each non-real-time service user on this carrier wave to be scheduled bunch in the following manner:
k ^ = | ∂ U k ( 1 ) ∂ d k | · r k , m ( n ) R k ( n ) ;
Wherein, the priority of
Figure FDA0000117568460000012
expression user k on this carrier wave to be scheduled bunch; M is the sequence number of carrier wave to be scheduled bunch;
r K, m(n) instantaneous data rates that in current scheduling time slot n, on this carrier wave to be scheduled bunch, obtains of expression user k;
R k(n) represent the Mean Speed that user k obtains in current scheduling time slot n;
Figure FDA0000117568460000013
expression and non-real-time service user's queuing delay, the first relevant utility function of maximum queuing delay that non-real-time service allows; And
According to each the real time business user's who confirms schedule information, calculate the priority of each real time business user on this carrier wave to be scheduled bunch in the following manner:
k ^ = | ∂ U k ( 2 ) ∂ d k | · r k , m ( n ) R k ( n ) · w ;
Wherein, w is a correction factor, is used for regulating according to actual conditions real time business user's priority;
expression and real time business user's queuing delay, the second relevant utility function of maximum queuing delay that real time business allows.
2. the method for claim 1 is characterized in that, said first utility function is:
f(t)＝1-ce a(t-b)；
Wherein, t representes non-real-time service user's queuing delay;
A representes the slope of this utility function, and b representes the maximum queuing delay that non-real-time service allows, and c representes the amplitude of this utility function;
a＞0，b＞0，c＞0。
3. the method for claim 1 is characterized in that, said second utility function is:
f(t)＝1-(1+e -α(t-β)) -1；
Wherein, t representes real time business user's queuing delay;
A representes the slope of this utility function, and β representes the maximum queuing delay that real time business allows;
α＞0，β＞0。
4. the method for claim 1 is characterized in that, according to following account form calculating real-time service-user and the current Mean Speed of non-real-time service user:
R k ( n ) = ( 1 - 1 T c ) R k ( n - 1 ) + 1 T c r k ( n - 1 ) ;
R k(n) represent the Mean Speed that user k obtains in current scheduling time slot n;
R k(n-1) Mean Speed of expression user k in a last time slot scheduling n-1;
T cThe expression sliding time window;
Wherein r k ( n - 1 ) = Σ m = 1 M r k , m ( n - 1 ) · δ k ( n - 1 )
r k(n-1) represent user k in a last time slot scheduling n-1, the instantaneous data rates sum on each carrier wave bunch m that is dispatched to;
r K, m(n-1) expression user k is in last a time slot scheduling n-1, the instantaneous data rates of acquisition on m the carrier wave that is dispatched to bunch;
δ k(n-1) be the variable of expression carrier wave bunch distribution condition, if m carrier wave bunch given the user k n-1 time slot allocation, δ then k(n-1)=1, otherwise, δ then k(n-1)=0;
M is the carrier wave number of clusters order that supplies scheduling in the system.
5. the method for claim 1 is characterized in that, according to the channel quality status of real time business user and non-real-time service reporting of user, confirms real time business user and the non-real-time service user instantaneous data rates on this carrier wave to be scheduled bunch respectively.
6. a wireless resource scheduling device is characterized in that, comprising:
Schedule information is confirmed the unit, is used for confirm each real time business user's schedule information, and each comprising the non-real-time service user's of the current queuing delay of non-real-time service user schedule information to carrier wave to be scheduled bunch;
Priority calculation unit is used for the schedule information according to each user who confirms, calculates the priority of each user on this carrier wave to be scheduled bunch; And
Scheduling unit is used for giving the highest user of priority who calculates with this carrier wave to be scheduled bunch scheduling;
Comprise the instantaneous data rates that maximum queuing delay that the current queuing delay of the current Mean Speed of real time business user, real time business user, real time business allow and real time business user obtain in said real time business user's the schedule information on this carrier wave to be scheduled bunch; Also comprise the instantaneous data rates that maximum queuing delay that the current Mean Speed of non-real-time service user, non-real-time service allow and non-real-time service user obtain in said non-real-time service user's the schedule information on this carrier wave to be scheduled bunch;
Wherein, according to each the non-real-time service user's who confirms schedule information, calculate the priority of each non-real-time service user on this carrier wave to be scheduled bunch in the following manner:
k ^ = | ∂ U k ( 1 ) ∂ d k | · r k , m ( n ) R k ( n ) ;
Wherein, the priority of
Figure FDA0000117568460000032
expression user k on this carrier wave to be scheduled bunch; M is the sequence number of carrier wave to be scheduled bunch;
r K, m(n) instantaneous data rates that in current scheduling time slot n, on this carrier wave to be scheduled bunch, obtains of expression user k;
R k(n) represent the Mean Speed that user k obtains in current scheduling time slot n;
Figure FDA0000117568460000041
expression and non-real-time service user's queuing delay, the first relevant utility function of maximum queuing delay that non-real-time service allows; And
According to each the real time business user's who confirms schedule information, calculate the priority of each real time business user on this carrier wave to be scheduled bunch in the following manner:
k ^ = | ∂ U k ( 2 ) ∂ d k | · r k , m ( n ) R k ( n ) · w ;
Wherein, w is a correction factor, is used for regulating according to actual conditions real time business user's priority;
Figure FDA0000117568460000043
expression and real time business user's queuing delay, the second relevant utility function of maximum queuing delay that real time business allows.
7. a base station is characterized in that, comprising:
Schedule information is confirmed the unit, is used for confirm each real time business user's schedule information, and each comprising the non-real-time service user's of the current queuing delay of non-real-time service user schedule information to carrier wave to be scheduled bunch;
Priority calculation unit is used for the schedule information according to each user who confirms, calculates the priority of each user on this carrier wave to be scheduled bunch; And
Scheduling unit is used for giving the highest user of priority who calculates with this carrier wave to be scheduled bunch scheduling;
Comprise the instantaneous data rates that maximum queuing delay that the current queuing delay of the current Mean Speed of real time business user, real time business user, real time business allow and real time business user obtain in said real time business user's the schedule information on this carrier wave to be scheduled bunch; Also comprise the instantaneous data rates that maximum queuing delay that the current Mean Speed of non-real-time service user, non-real-time service allow and non-real-time service user obtain in said non-real-time service user's the schedule information on this carrier wave to be scheduled bunch;
Wherein, according to each the non-real-time service user's who confirms schedule information, calculate the priority of each non-real-time service user on this carrier wave to be scheduled bunch in the following manner:
k ^ = | ∂ U k ( 1 ) ∂ d k | · r k , m ( n ) R k ( n ) ;
Wherein, the priority of
Figure FDA0000117568460000052
expression user k on this carrier wave to be scheduled bunch; M is the sequence number of carrier wave to be scheduled bunch;
r K, m(n) instantaneous data rates that in current scheduling time slot n, on this carrier wave to be scheduled bunch, obtains of expression user k;
R k(n) represent the Mean Speed that user k obtains in current scheduling time slot n;
Figure FDA0000117568460000053
expression and non-real-time service user's queuing delay, the first relevant utility function of maximum queuing delay that non-real-time service allows; And
According to each the real time business user's who confirms schedule information, calculate the priority of each real time business user on this carrier wave to be scheduled bunch in the following manner:
k ^ = | ∂ U k ( 2 ) ∂ d k | · r k , m ( n ) R k ( n ) · w ;
Wherein, w is a correction factor, is used for regulating according to actual conditions real time business user's priority;
expression and real time business user's queuing delay, the second relevant utility function of maximum queuing delay that real time business allows.
CN2008101050229A 2008-04-25 2008-04-25 Method and device for radio resource scheduling and base station Expired - Fee Related CN101568156B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2008101050229A CN101568156B (en) 2008-04-25 2008-04-25 Method and device for radio resource scheduling and base station

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2008101050229A CN101568156B (en) 2008-04-25 2008-04-25 Method and device for radio resource scheduling and base station

Publications (2)

Publication Number Publication Date
CN101568156A CN101568156A (en) 2009-10-28
CN101568156B true CN101568156B (en) 2012-06-06

Family

ID=41284038

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2008101050229A Expired - Fee Related CN101568156B (en) 2008-04-25 2008-04-25 Method and device for radio resource scheduling and base station

Country Status (1)

Country Link
CN (1) CN101568156B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101636382B1 (en) * 2009-09-28 2016-07-20 삼성전자주식회사 Method and device for user schedulling and managing transmit power in hierarchical-cell or multi-cell communication system
CN105636210A (en) * 2014-11-13 2016-06-01 中兴通讯股份有限公司 Method and apparatus for allocating resource
CN105873128B (en) * 2016-05-31 2019-05-14 杭州电子科技大学 A kind of LTE fairness dispatching method based on delay sensitive
CN109548161B (en) * 2018-12-17 2023-02-17 深圳信息职业技术学院 Method, device and terminal equipment for scheduling wireless resources

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1509094A (en) * 2002-12-16 2004-06-30 ��������ͨ���о�Ժ Downstream data-pack dispatching system and method in mobile communication system
CN1571324A (en) * 2003-07-15 2005-01-26 大唐移动通信设备有限公司 Method for packet data scheduling of multi-level service in CDMA mobile communication system
CN1856165A (en) * 2005-04-29 2006-11-01 大唐移动通信设备有限公司 Method for arranging non-realtime business
CN101060474A (en) * 2006-04-20 2007-10-24 大唐移动通信设备有限公司 A service quality assurance-based grouping service wireless resource dispatching method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1509094A (en) * 2002-12-16 2004-06-30 ��������ͨ���о�Ժ Downstream data-pack dispatching system and method in mobile communication system
CN1571324A (en) * 2003-07-15 2005-01-26 大唐移动通信设备有限公司 Method for packet data scheduling of multi-level service in CDMA mobile communication system
CN1856165A (en) * 2005-04-29 2006-11-01 大唐移动通信设备有限公司 Method for arranging non-realtime business
CN101060474A (en) * 2006-04-20 2007-10-24 大唐移动通信设备有限公司 A service quality assurance-based grouping service wireless resource dispatching method

Also Published As

Publication number Publication date
CN101568156A (en) 2009-10-28

Similar Documents

Publication Publication Date Title
CN101364856B (en) Resource distribution method and apparatus
CN100431360C (en) Method and apparatus for scheduling packet
CN1973497B (en) Packet transmission control device and packet transmission control method
CN100550691C (en) The method of dispatching group data transmission
CN100463441C (en) Packet transmission control apparatus and packet transmission control method
CN101557644B (en) Adjusting method for wireless signal-path band width
CN100459581C (en) A method for packet dispatching of variable parameter for real-time mixed service environment
CN100502361C (en) Communication system scheduling method
CN104066192A (en) High energy efficiency frequency power distribution method based on quality of experience of users
CN101568156B (en) Method and device for radio resource scheduling and base station
CN106793133A (en) The dispatching method of multi-service QoS is ensured in a kind of electric power wireless communication system
CN102083221A (en) Resource scheduling method and device based on HSDPA (high speed downlink packet access)
CN103096485B (en) A kind of method of multi-user's multiple-input, multiple-output frequency selection scheduling in LTE system
CN102858015A (en) Multi-service scheduling method
CN100512503C (en) Proportional fair scheduling algorithm multi-mode configuration and scheduling method
CN1866810A (en) Method and apparatus for realizing high-speed downlink packet dispatching
CN103068051A (en) Distribution method and distribution device of downstream resources
CN103402237B (en) Based on interrupting preferential relay selection method in the multi-relay cooperation communication system of single source
CN103929822A (en) LTE proportional fair scheduling method
CN103582100A (en) Dynamic resource allocation method for OFDMA downlink system based on dynamic energy obtaining
CN101436921A (en) Scheduling method and network side equipment
CN101877913B (en) User scheduling method in LTE (Long Term Evolution) system
CN102056317B (en) Dispatching method for high-speed downlink packet access
CN103402238B (en) Ultrahigh speed WLAN (wireless local area network) downlink relay connection control method
CN101415242A (en) System and method for scheduling wideband wireless access non-real time business

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: 20120606

Termination date: 20200425