CN101568156B - Method and device for radio resource scheduling and base station - Google Patents
Method and device for radio resource scheduling and base station Download PDFInfo
- 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
- mrow
- real
- time service
- user
- msub
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 15
- 238000012937 correction Methods 0.000 claims description 4
- 238000010295 mobile communication Methods 0.000 description 10
- 238000004891 communication Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 6
- 230000003247 decreasing effect Effects 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000007423 decrease Effects 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 239000000969 carrier Substances 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000005562 fading Methods 0.000 description 1
- 230000002349 favourable effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
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
Technical Field
The present invention relates to the field of wireless communication technologies, and in particular, to a method, an apparatus, and a base station for scheduling wireless resources.
Background
In a communication system providing real-time services and non-real-time services simultaneously, the priority of each user on the carrier resources to be scheduled is usually calculated respectively, and then the carrier resources to be scheduled are allocated to the user with the highest priority.
As shown in fig. 1, which is a schematic diagram of scheduling in a wireless packet scheduling scheme in the prior art, on a downlink, a base station establishes a corresponding data buffer queue for each user; in each scheduling period, the user measures the own channel condition and feeds back the own channel condition to the base station through the dedicated uplink feedback channel. The base station respectively determines the available instantaneous data rate of each user on the carrier resources to be scheduled according to the channel condition fed back by each user, calculates the scheduling priority of each user on the carrier resources to be scheduled according to the determined instantaneous data rate of each user on the carrier resources to be scheduled and other information of each user, such as queue length, quality of service (QoS), queuing delay and the like of the user, sorts the users according to the priority order, and allocates the carrier resources to be scheduled to the users with the highest priority.
Wherein packet scheduling on wireless fading channels has been an important research direction in the communication field. On one hand, the mobile communication system is a resource-limited system, how to utilize limited system resources to meet the increasing user demands has become a problem to be solved urgently by mobile communication system manufacturers and operators, which requires that the mobile communication system must more reasonably and fully utilize the existing wireless resources, and utilize the limited system resources as much as possible to provide better services for more users. On the other hand, in the current mobile communication system, there is a need to simultaneously support a plurality of services, such as VoIP, FTP, WWW, E-mail, Video Streaming, etc. Different services have different QoS requirements, and how to guarantee the QoS requirements of different services is also a very important research direction in mobile communication systems.
Therefore, as a key technology, the radio resource scheduling technology has become a criterion for measuring whether a mobile communication system is feasible and the quality of the system service is good or bad. The efficient wireless resource scheduling scheme can fully utilize the time-varying characteristic of a channel on the premise of ensuring the QoS of the service, and realize multi-user diversity gain so as to improve the average rate of the service and the overall stability of the system. The wireless resource scheduling scheme must take efficiency and fairness into consideration, that is, not only the user with the best channel condition occupies resources to improve the system throughput, but also the user with relatively poor channel condition can get scheduling opportunity within a certain time, thereby ensuring the continuity of the service and the fairness among the users.
However, in the current mobile communication system providing real-time service and non-real-time service simultaneously, when scheduling resources for users, queuing delay factors of non-real-time service users are not usually considered, so that scheduling priority of real-time service users with the same channel condition is always higher than scheduling priority of non-real-time service users, real-time service users are always scheduled preferentially, non-real-time service users cannot be scheduled for a long time, service continuity of non-real-time service users is affected, and fairness to non-real-time service users is lost.
Disclosure of Invention
The invention provides a wireless resource scheduling method, a device and a base station thereof, which are used for fairly treating real-time service users and non-real-time service users on the basis of simultaneously ensuring the QoS of the real-time service users and the non-real-time service users and ensuring the service continuity of the non-real-time service users.
The invention provides a wireless resource scheduling method, which comprises the steps of determining scheduling information of each real-time service user and scheduling information of each non-real-time service user containing current queuing delay of the non-real-time service user aiming at a carrier cluster to be scheduled; calculating the priority of each user on the carrier cluster to be scheduled according to the determined scheduling information of each user; and scheduling the carrier cluster to be scheduled to the user with the highest calculated priority.
The invention also provides a wireless resource scheduling device, which comprises a scheduling information determining unit, a scheduling information determining unit and a scheduling information determining unit, wherein the scheduling information determining unit is used for determining the scheduling information of each real-time service user and the scheduling information of each non-real-time service user containing the current queuing delay of the non-real-time service user aiming at the carrier cluster to be scheduled; a priority calculating unit, configured to calculate, according to the determined scheduling information of each user, a priority of each user on the carrier cluster to be scheduled; and the scheduling unit is used for scheduling the carrier cluster to be scheduled to the user with the highest calculated priority.
The invention also provides a base station, which comprises a scheduling information determining unit, a scheduling information determining unit and a scheduling information determining unit, wherein the scheduling information determining unit is used for determining the scheduling information of each real-time service user and the scheduling information of each non-real-time service user containing the current queuing delay of the non-real-time service user aiming at the carrier cluster to be scheduled; a priority calculating unit, configured to calculate, according to the determined scheduling information of each user, a priority of each user on the carrier cluster to be scheduled; and the scheduling unit is used for scheduling the carrier cluster to be scheduled to the user with the highest calculated priority.
The wireless resource scheduling scheme of the invention fully considers the queuing delay of the non-real-time service user when scheduling resources in a mobile communication system simultaneously providing real-time service and non-real-time service, thus avoiding that the priority of the real-time service user is always higher than that of the non-real-time service user on the basis of basically ensuring the QoS of the real-time service user, so that the non-real-time service user can not be scheduled for a long time, and better ensuring the service continuity and QoS of the non-real-time service user.
Drawings
The embodiments of the present invention will be described in detail below with reference to the accompanying drawings, in which:
fig. 1 is a schematic diagram of a scheduling scheme of a wireless packet scheduling in the prior art;
FIG. 2 is a flowchart illustrating a method for scheduling radio resources according to an embodiment of the present invention;
FIG. 3 is a diagram illustrating the utility function curves of queuing delay variation of real-time service users and non-real-time service users in the solution of the present invention;
fig. 4 is a block diagram of a specific structure of the resource scheduling apparatus according to the present invention.
Detailed Description
The design concept of the invention is that in a mobile communication system which simultaneously carries out resource scheduling on real-time service users and non-real-time service users, queuing time delay of the non-real-time service users is fully considered, and the non-real-time service users are prevented from being scheduled for a long time, so that the service continuity and the QoS of the non-real-time service users are ensured on the basis of basically ensuring the QoS of the real-time service users.
As shown in fig. 2, a processing flow chart of an embodiment of the radio resource scheduling method of the present invention is specifically implemented as follows:
and step 30, scheduling the carrier cluster to be scheduled to the user with the highest calculated priority according to the calculated priority information of each user on the carrier cluster to be scheduled.
The technical scheme of the invention evaluates the satisfaction degree of the user to the wireless communication system, namely the QoS of the user by using the utility function theory in the microscopic economics. The main idea of the utility function is to map system resources (such as bandwidth, power, etc.) or performance indicators (such as data rate, delay, etc.) to corresponding utility values for optimizing the overall communication system. The utility function plays a very important role in radio resource management, guaranteeing the QoS requirement of users and the like.
Embodiments of the invention use U herek(dk) To represent the utility function of user k, i.e. Uk(dk) Representing satisfaction of user k with the mobile communication system, dkRepresenting the queuing delay for user k. Because the satisfaction of the user gradually decreases with the increase of the queuing delay, the utility function should be decreased; and for the maximum allowable queuing delay specified by the service, the closer to the maximum allowable queuing delay, the faster the satisfaction degree of the user is reduced, and the farther away from the maximum allowable queuing delay, the less attention of the user is paid. Therefore, the derivative of the utility function is also decreasing and is negative. So Uk(dk) Should be a non-negative monotonically decreasing convex function. The optimization goal of embodiments of the present invention is to maximize the total utility function value, i.e., to maximize the sum of all users' satisfaction (QoS values).
Based on the above principle, the embodiment of the present invention provides the following optimization objective function:
over dk≥0，1≤k≤K
where K is the number of active users in the cell.
Example of the invention uses rk，m(n) represents the instantaneous data rate that the user k can obtain on the carrier cluster m in the current scheduling time slot n, and generally, the instantaneous data rate that the real-time service user and the non-real-time service user can obtain on the carrier cluster to be scheduled in the current scheduling time slot n can be respectively determined according to the channel quality conditions reported by the real-time service user and the non-real-time service user.
Calculating the average rate of the user k in the current scheduling time slot n according to the following calculation mode:
wherein R isk(n) represents the average rate obtained by user k in the current scheduling time slot n; rk(n-1) represents the average rate of user k in the last scheduled time slot n-1; t iscIndicating a sliding time window, typically the time slot length TsInteger multiples of; wherein:
rk(n-1) represents the sum of instantaneous data rates of the user k on each scheduled carrier cluster m in the last scheduled time slot n-1; r isk，m(n-1) represents the instantaneous data rate obtained by the user k on the m-th carrier cluster scheduled in the last scheduling time slot n-1; deltak(n-1) is a variable representing the carrier cluster allocation situation, if the mth carrier cluster is allocated to user k in the (n-1) th time slot, δk(n-1) ═ 1, otherwise, δk(n-1) ═ 0; and M is the number of carrier clusters for scheduling in the system. To avoid intra-cell interference, in each scheduling slot, a multiple-input multiple-output (MIMO) channel corresponding to each carrier cluster can be uniquely allocated to only one user, so there is an equation <math><mrow>
<msubsup>
<mi>Σ</mi>
<mrow>
<mi>k</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>K</mi>
</msubsup>
<msub>
<mi>δ</mi>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mi>m</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mn>1</mn>
</mrow></math> It holds that if user k is not scheduled to any carrier cluster in the (n-1) th slot, rk(n-1)＝0。
If used dk(n) representing the queuing delay of the user k in the current scheduling time slot n, and calculating the priority of each non-real-time service user on the carrier cluster to be scheduled according to the determined scheduling information of each non-real-time service user in the following mode:
and according to the determined scheduling information of each real-time service user, calculating the priority of each real-time service user on the carrier cluster to be scheduled according to the following mode:
wherein,
representing the priority of the user k on the carrier cluster to be scheduled; r isk，m(n) represents the instantaneous data rate obtained by the user k on the carrier cluster to be scheduled in the current scheduling time slot n; rk(n) represents the average rate obtained by user k in the current scheduling time slot n; w is a correction factor used for adjusting the priority of the real-time service user according to the actual situation, wherein the larger w is, the more favorable the priority of the real-time service user is, and the value is generally set to be larger than 1;
The utility function using the user queuing delay as an index should be a strictly monotonous non-negative decreasing function and be convex. In the embodiment of the invention, the s-type function f (t) is 1- (1+ e)-α(t-β))-1Alpha > 0, beta > 0 as the utility function of the real-time service user. Wherein, the parameter t represents the queuing delay of the real-time service user, and the parameter beta represents the maximum queuing delay allowed by the real-time service; alpha and beta determine the position of the slope and the midpoint of the slope of the utility function, respectively. In general, the greater α, the steeper the slope of the utility function, and the greater the absolute value of the derivative of the utility function at the midpoint of the slope.
The s-type function is selected for the real-time service user, and the following aspects are mainly considered:
(1) before the s-type function has a descending trend, the s-type function is generally relatively flat, so that the absolute value of the derivative of the s-type function is relatively small, and then the non-real-time service user can obtain scheduling preferentially in the period;
(2) when the queuing delay of the real-time service user is close to the maximum queuing delay allowed by the real-time service, the s-shaped function starts to descend at the moment, the intensity of the descending is determined by alpha, the larger the alpha is, the more intense the descending is, the larger the absolute value of the derivative is, so that the real-time service user obtains a higher scheduling weight to reduce the packet loss rate of the real-time service user;
(3) due to the characteristics of the s-type function, when the queuing delay of the real-time service user exceeds the maximum queuing delay allowed by the real-time service, the utility value does not immediately drop to 0, but has a gradual dropping process, so that the real-time service user can continuously participate in the scheduling of resources, and the packet loss rate of the real-time service user can be further reduced.
For the non-real-time service users, the requirement on queuing delay is not as strict as that of the real-time service users, but if the service is not received for a long time, the satisfaction degree of the non-real-time service users is also reduced. Therefore, the queuing delay of the non-real-time service user is generally called as "soft delay", and as the queuing delay increases, the utility function value thereof also gradually decreases. Therefore, in the embodiment of the present invention, f (t) is 1-cea(t-b)A is more than 0, b is more than 0, c is more than 0 as the utility function of the non-real-time service user. Wherein t represents the queuing time delay of a non-real-time service user, and b represents the maximum queuing time delay allowed by the non-real-time service; a. c and b determine the slope, amplitude and delay requirements of the utility function, respectively.
Fig. 3 is a schematic diagram of a utility function curve of queuing delay variation of real-time service users and non-real-time service users in the scheme of the present invention.
According to the above calculation method, the scheduling priority of each user on the carrier cluster m to be scheduled can be calculated, and the user with the maximum scheduling priority is selected from the scheduling prioritiesAllocating the carrier cluster m to be scheduled to the user
. Then, according to the same scheduling scheme, scheduling the next carrier cluster until all the carrier clusters are scheduled. The users scheduled to the carrier cluster can transmit data bits on their corresponding channels.
Correspondingly, the present invention further provides a radio resource scheduling apparatus, which is generally a base station device in a communication system, and as shown in fig. 4, is a specific structural block diagram of the resource scheduling apparatus of the present invention, wherein the scheduling information determining unit 100 is configured to determine, for a carrier cluster to be scheduled, scheduling information of each real-time service user, and determine scheduling information of each non-real-time service user including a current queuing delay of the non-real-time service user; a priority calculating unit 200, configured to calculate, according to the scheduling information of each user determined by the scheduling information determining unit 100, a priority of each user on the carrier cluster to be scheduled; a scheduling unit 300, configured to schedule the carrier cluster to be scheduled to the user with the highest priority calculated by the priority calculating unit 200.
In the foregoing radio resource scheduling apparatus, the scheduling information determining unit 100 determines specific implementations of the scheduling information of the real-time service user and the scheduling information of the non-real-time service user, and the priority calculating unit 200 calculates a calculation manner of the priority of each user on the carrier cluster to be scheduled according to the scheduling information of each real-time service user and the scheduling information of each non-real-time service user, which has been described in detail in the specific implementation of the foregoing method, and is not described here any more.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.
Claims (7)
1. A method for scheduling radio resources, comprising:
determining scheduling information of each real-time service user and scheduling information of each non-real-time service user containing current queuing delay of the non-real-time service user aiming at a carrier cluster to be scheduled;
calculating the priority of each user on the carrier cluster to be scheduled according to the determined scheduling information of each user; and
scheduling the carrier cluster to be scheduled to the user with the highest calculated priority;
the scheduling information of the real-time service user comprises the current average rate of the real-time service user, the current queuing delay of the real-time service user, the maximum queuing delay allowed by the real-time service and the instantaneous data rate obtained by the real-time service user on the carrier cluster to be scheduled;
the scheduling information of the non-real-time service user also comprises the current average rate of the non-real-time service user, the maximum queuing delay allowed by the non-real-time service and the instantaneous data rate obtained by the non-real-time service user on the carrier cluster to be scheduled;
according to the determined scheduling information of each non-real-time service user, calculating the priority of each non-real-time service user on the carrier cluster to be scheduled according to the following mode:
wherein,
representing the priority of the user k on the carrier cluster to be scheduled; m is the serial number of the carrier cluster to be scheduled;
rk，m(n) represents the instantaneous data rate obtained by the user k on the carrier cluster to be scheduled in the current scheduling time slot n;
Rk(n) represents the average rate obtained by user k in the current scheduling time slot n;
according to the determined scheduling information of each real-time service user, calculating the priority of each real-time service user on the carrier cluster to be scheduled according to the following mode:
w is a correction factor used for adjusting the priority of the real-time service user according to the actual situation;
and a second utility function related to the queuing delay of the real-time service user and the maximum queuing delay allowed by the real-time service is expressed.
2. The method of claim 1, wherein the first utility function is:
f(t)＝1-cea(t-b)；
wherein t represents the queuing delay of the non-real-time service user;
a represents the slope of the utility function, b represents the maximum queuing delay allowed by the non-real-time service, and c represents the amplitude of the utility function;
a＞0，b＞0，c＞0。
3. the method of claim 1, wherein the second utility function is:
f(t)＝1-(1+e-α(t-β))-1；
wherein t represents the queuing delay of the real-time service user;
a represents the slope of the utility function, and beta represents the maximum queuing delay allowed by the real-time service;
α＞0，β＞0。
4. the method of claim 1, wherein the current average rates of the real-time service subscribers and the non-real-time service subscribers are calculated as follows:
Rk(n) represents the average rate obtained by user k in the current scheduling time slot n;
Rk(n-1) represents the average rate of user k in the last scheduled time slot n-1;
Tcrepresents a sliding time window;
wherein <math>
<mrow>
<msub>
<mi>r</mi>
<mi>k</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>=</mo>
<munderover>
<mi>Σ</mi>
<mrow>
<mi>m</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>M</mi>
</munderover>
<msub>
<mi>r</mi>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mi>m</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<msub>
<mrow>
<mo>·</mo>
<mi>δ</mi>
</mrow>
<mi>k</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</mrow>
</math>
rk(n-1) represents the sum of instantaneous data rates of the user k on each scheduled carrier cluster m in the last scheduled time slot n-1;
rk，m(n-1) represents the instantaneous data rate obtained by the user k on the m-th carrier cluster scheduled in the last scheduling time slot n-1;
δk(n-1) is a variable representing the carrier cluster allocation situation, if the mth carrier cluster is allocated to user k in the (n-1) th time slot, δk(n-1) ═ 1, otherwise, δk(n-1)＝0；
And M is the number of carrier clusters for scheduling in the system.
5. The method of claim 1, wherein the instantaneous data rates of the real-time service users and the non-real-time service users on the carrier cluster to be scheduled are determined according to channel quality conditions reported by the real-time service users and the non-real-time service users, respectively.
6. A radio resource scheduling apparatus, comprising:
a scheduling information determining unit, configured to determine, for a carrier cluster to be scheduled, scheduling information of each real-time service user and scheduling information of each non-real-time service user including a current queuing delay of the non-real-time service user;
a priority calculating unit, configured to calculate, according to the determined scheduling information of each user, a priority of each user on the carrier cluster to be scheduled; and
a scheduling unit, configured to schedule the carrier cluster to be scheduled to a user with the highest calculated priority;
the scheduling information of the real-time service user comprises the current average rate of the real-time service user, the current queuing delay of the real-time service user, the maximum queuing delay allowed by the real-time service and the instantaneous data rate obtained by the real-time service user on the carrier cluster to be scheduled; the scheduling information of the non-real-time service user also comprises the current average rate of the non-real-time service user, the maximum queuing delay allowed by the non-real-time service and the instantaneous data rate obtained by the non-real-time service user on the carrier cluster to be scheduled;
according to the determined scheduling information of each non-real-time service user, calculating the priority of each non-real-time service user on the carrier cluster to be scheduled according to the following mode:
wherein,
representing the priority of the user k on the carrier cluster to be scheduled; m is the serial number of the carrier cluster to be scheduled;
rk，m(n) represents the instantaneous data rate obtained by the user k on the carrier cluster to be scheduled in the current scheduling time slot n;
Rk(n) represents the average rate obtained by user k in the current scheduling time slot n;
according to the determined scheduling information of each real-time service user, calculating the priority of each real-time service user on the carrier cluster to be scheduled according to the following mode:
w is a correction factor used for adjusting the priority of the real-time service user according to the actual situation;
7. A base station, comprising:
a scheduling information determining unit, configured to determine, for a carrier cluster to be scheduled, scheduling information of each real-time service user and scheduling information of each non-real-time service user including a current queuing delay of the non-real-time service user;
a priority calculating unit, configured to calculate, according to the determined scheduling information of each user, a priority of each user on the carrier cluster to be scheduled; and
a scheduling unit, configured to schedule the carrier cluster to be scheduled to a user with the highest calculated priority;
the scheduling information of the real-time service user comprises the current average rate of the real-time service user, the current queuing delay of the real-time service user, the maximum queuing delay allowed by the real-time service and the instantaneous data rate obtained by the real-time service user on the carrier cluster to be scheduled; the scheduling information of the non-real-time service user also comprises the current average rate of the non-real-time service user, the maximum queuing delay allowed by the non-real-time service and the instantaneous data rate obtained by the non-real-time service user on the carrier cluster to be scheduled;
according to the determined scheduling information of each non-real-time service user, calculating the priority of each non-real-time service user on the carrier cluster to be scheduled according to the following mode:
wherein,
representing the priority of the user k on the carrier cluster to be scheduled; m is the serial number of the carrier cluster to be scheduled;
rk，m(n) represents the instantaneous data rate obtained by the user k on the carrier cluster to be scheduled in the current scheduling time slot n;
Rk(n) represents the average rate obtained by user k in the current scheduling time slot n;
according to the determined scheduling information of each real-time service user, calculating the priority of each real-time service user on the carrier cluster to be scheduled according to the following mode:
w is a correction factor used for adjusting the priority of the real-time service user according to the actual situation;
and a second utility function related to the queuing delay of the real-time service user and the maximum queuing delay allowed by the real-time service is expressed.
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 (5)
| 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 |
| CN109479269B (en) * | 2016-07-19 | 2024-07-12 | 日本电气株式会社 | Method and apparatus for performing communication |
| CN109548161B (en) * | 2018-12-17 | 2023-02-17 | 深圳信息职业技术学院 | Method, device and terminal equipment for scheduling wireless resources |
Citations (4)
| 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 |
-
2008
- 2008-04-25 CN CN2008101050229A patent/CN101568156B/en not_active Expired - Fee Related
Patent Citations (4)
| 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 |
|---|---|---|
| Song et al. | Joint channel-aware and queue-aware data scheduling in multiple shared wireless channels | |
| KR100798854B1 (en) | Method for Adaptive Delay Threshold-based Priority Queueing Scheme for Packet Scheduling in Mobile Broadband Wireless Access System | |
| Parag et al. | A subcarrier allocation algorithm for OFDMA using buffer and channel state information | |
| EP1758312A1 (en) | Scheduling depending on quality of service and channel properties | |
| US20090296574A1 (en) | Traffic load dependent power allocation in multi user wireless communication network with proportional fair scheduling in time and frequency domain | |
| CN109041193A (en) | A kind of dynamic syndicated user-association of network slice and power distribution method based on NOMA | |
| CN101686196A (en) | Service scheduling method and service scheduling device | |
| CN103596285A (en) | Wireless resource scheduling method, wireless resource scheduler and system thereof | |
| CN101568156B (en) | Method and device for radio resource scheduling and base station | |
| CN101436921B (en) | Scheduling method and network side equipment | |
| Chung et al. | A balanced resource scheduling scheme with adaptive priority thresholds for OFDMA downlink systems | |
| CN113079577B (en) | Resource allocation method based on coexistence scene of EMBB and URLLC | |
| WO2006068445A1 (en) | A method for scheduling resources of packet level for integrated level for integrated traffic, and an apparatus therefor | |
| US20120099454A1 (en) | Apparatus and method for scheduling in wireless communication system | |
| CN101772172A (en) | Multi-band based method for allocating frequency spectrum resources, device and system thereof | |
| Zhang et al. | Cross-layer resource allocation for real-time services in OFDM-based cognitive radio systems | |
| CN101247148A (en) | Method, system and base station for implementing power control | |
| Zhu et al. | An adaptive resource allocation scheme in OFDMA based multiservice WiMAX systems | |
| Omiyi et al. | Cross-layer content/channel aware multi-user scheduling for downlink wireless video streaming | |
| Kong et al. | Tradeoff design of radio resource scheduling for power and spectrum utilizations in LTE uplink systems | |
| Xue et al. | Performance analysis of two packet scheduling algorithms in downlink 3gpp lte system | |
| Gan et al. | A cross-layer designed scheduling algorithm for WiMAX uplink | |
| KR20080086595A (en) | Apparatus and method for opportunistic packet scheduling with frequency reuse and quality of service guarantee in wideband wireless access communication system based multi-hop relay | |
| Bokhari et al. | Adaptive token bank fair queuing scheduling in the downlink of 4G wireless multicarrier networks | |
| Kong et al. | Referential bounds analysis of uplink radio resource scheduling in LTE network |
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: 20120606 Termination date: 20200425 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |