CN111385899B - Resource scheduling method and device, network equipment and readable storage medium - Google Patents

Resource scheduling method and device, network equipment and readable storage medium Download PDF

Info

Publication number
CN111385899B
CN111385899B CN201811627502.1A CN201811627502A CN111385899B CN 111385899 B CN111385899 B CN 111385899B CN 201811627502 A CN201811627502 A CN 201811627502A CN 111385899 B CN111385899 B CN 111385899B
Authority
CN
China
Prior art keywords
scheduled
scheduling
prb
resources
ueindx
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.)
Active
Application number
CN201811627502.1A
Other languages
Chinese (zh)
Other versions
CN111385899A (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.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Priority to CN201811627502.1A priority Critical patent/CN111385899B/en
Priority to PCT/CN2019/128944 priority patent/WO2020135648A1/en
Publication of CN111385899A publication Critical patent/CN111385899A/en
Application granted granted Critical
Publication of CN111385899B publication Critical patent/CN111385899B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H04W72/1263—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The resource scheduling method, the resource scheduling device, the network equipment and the readable storage medium provided by the embodiment of the invention are used for counting the Control Channel Element (CCE) resources, the Physical Resource Block (PRB) resources and the Spectrum Efficiency (SE) respectively occupied by the current User Equipment (UE) to be scheduled, as well as the residual total CCE resources, the PRB resources and the total number of the UE to be scheduled in a cell; calculating the dynamic value of the scheduling UE in the current scene based on the data; and determining the UE to be scheduled according to the dynamic value of the scheduled UE, and performing resource scheduling on the UE to be scheduled. Therefore, the dynamic value in the scheme for scheduling the UE is determined according to the resource occupation condition of the UE to be scheduled and the residual resource condition of the cell, and the UE to be scheduled is determined according to the dynamic value, so that the resource utilization rate in the UE scheduling process is improved, and the throughput of the cell is also improved.

Description

Resource scheduling method, device, network equipment and readable storage medium
Technical Field
The embodiments of the present invention relate to, but are not limited to, the field of communications, and in particular, but not limited to, a resource scheduling method, apparatus, network device, and readable storage medium.
Background
The scheduling mainly solves the problem of resource allocation of the system, the resources of the system are limited, different Users (UE) to be scheduled need to occupy different resources, and the flow yield brought by the scheduling is different. How to select the UE, using limited resources to maximize the system capability is a key to improve the cell throughput.
The system resources mainly refer to CCE (Control Channel Elements) and PRB (Physical Resource Block) resources, and the total number of the resources can be determined after the bandwidth is determined. The existing scheduling method mainly aims at scheduling of frequency-division users, and has the principle that resource allocation is performed according to a scheduling sequence output by a Qos (Quality of Service) module, and the contribution of the UE to the cell throughput after scheduling is not considered, and the following situations may occur: according to the Qos ranking, the UE has a high priority, occupies a large number of CCEs or PRBs, but has a low SE (Spectrum Efficiency), and as a final scheduling result, many resources are used to schedule the UE, but the cell throughput is low due to the low SE.
Disclosure of Invention
The resource scheduling method, the resource scheduling device, the network equipment and the readable storage medium provided by the embodiment of the invention mainly solve the technical problem of how to improve the resource utilization rate of UE scheduling and ensure the cell throughput.
In order to solve the foregoing technical problem, an embodiment of the present invention provides a resource scheduling method, including:
counting Control Channel Element (CCE) resources, physical Resource Block (PRB) resources and Spectrum Efficiency (SE) occupied by current User Equipment (UE) to be scheduled, and the total number of the residual CCE resources, the PRB resources and the UE to be scheduled in a cell;
calculating the dynamic value of the scheduling UE in the current scene based on the data;
and determining the UE to be scheduled according to the dynamic value of the scheduled UE, and performing resource scheduling on the UE to be scheduled.
An embodiment of the present invention further provides a resource scheduling apparatus, including:
the counting module is used for counting Control Channel Element (CCE) resources, physical Resource Block (PRB) resources and Spectrum Efficiency (SE) occupied by the current User Equipment (UE) to be scheduled, as well as the total number of the residual CCE resources, the PRB resources and the UE to be scheduled in a cell;
the calculation module is used for calculating the dynamic value of the scheduling UE in the current scene based on the various data;
and the scheduling module is used for determining the UE to be scheduled according to the dynamic value of the scheduled UE and performing resource scheduling on the UE to be scheduled.
The embodiment of the invention also provides network equipment, which comprises a processor, a memory and a communication bus;
the communication bus is used for realizing connection communication between the processor and the memory;
the processor is configured to execute one or more computer programs stored in the memory to implement the steps of the resource scheduling method described above.
Embodiments of the present invention also provide a computer storage medium, where one or more programs are stored in the computer storage medium, and the one or more programs are executable by one or more processors to implement the steps of the resource scheduling method.
The beneficial effects of the invention are:
according to the resource scheduling method, the resource scheduling device, the network equipment and the readable storage medium provided by the embodiment of the invention, CCE (control channel element) resources, PRB (physical resource block) resources and spectrum efficiency SE (spectral efficiency) occupied by the current user equipment UE to be scheduled are counted, and the residual total CCE resources, PRB resources and the total number of the UE to be scheduled of a cell are counted; calculating the dynamic value of the scheduling UE in the current scene based on the data; and determining the UE to be scheduled according to the dynamic value of the scheduled UE, and performing resource scheduling on the UE to be scheduled. Therefore, the dynamic value in the scheme for scheduling the UE is determined according to the resource occupation condition of the UE to be scheduled and the residual resource condition of the cell, and the UE to be scheduled is determined according to the dynamic value, so that the resource utilization rate in the UE scheduling process is improved, and the throughput of the cell is also improved.
Additional features and corresponding advantages of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.
Drawings
Fig. 1 is a flowchart of a resource scheduling method according to a first embodiment of the present invention;
fig. 2 is a schematic diagram illustrating a resource scheduling apparatus according to a fourth embodiment of the present invention;
fig. 3 is a schematic diagram of a network device according to a fifth embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, embodiments of the present invention are described in detail below with reference to the accompanying drawings. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
The first embodiment is as follows:
the present embodiment provides a method for scheduling resources, referring to fig. 1, the method includes:
s101, counting Control Channel Element (CCE) resources, physical Resource Block (PRB) resources and Spectrum Efficiency (SE) occupied by current User Equipment (UE) to be scheduled, as well as cell residual total CCE resources, PRB resources and the total number of the UE to be scheduled;
s102, calculating the dynamic value of the scheduling UE in the current scene based on the data;
s103, according to the dynamic value of the scheduling UE, the UE to be scheduled is determined, and resource scheduling is carried out on the UE to be scheduled.
The CCE resource occupied by the ith UE may be denoted as CCE i It can be output by a PDCCH (Physical Downlink Control Channel) adaptive module; the PRB resource occupied by the ith UE can be represented as PRB i It can be output through the PRB estimation module. SE i The equivalent SE of the ith UE can be represented, and the initial SE, i.e. TBSize of the scheduling unit RB (Resource Block), can be obtained from a table look-up of MCS (Modulation and Coding Scheme).
In addition, in the embodiments of the present invention, the meanings of other parameters are as follows:
CCETotal: the maximum number of CCEs in the system.
PRBTotal: the maximum number of PRBs in the system.
UETotal: the number of UEs to be scheduled in the current TTI (transmission time interval).
V (i, j, k): and a three-dimensional cost function, wherein the first dimension i represents the dimension of the number of the scheduled UEs, the second dimension j represents the CCE dimension, and the third dimension n represents the PRB dimension. The value in V represents the equivalent SE, the initial value of which is 0. The three-dimensional cost function reflects the cost of scheduling UEs, i.e., whether the current UE is suitable to be scheduled.
Loc (i, j, k): and a three-dimensional tracking function, wherein the first dimension i represents the dimension of the number of the scheduled UEs, the second dimension j represents the dimension of the CCE, and the third dimension n represents the dimension of the PRB. The value in Loc indicates whether the UE is scheduled, which is typically 1 or 2, not 0. The three-dimensional tracing function is a function which is based on the three-dimensional cost function and corresponds to whether the corresponding UE is scheduled or not, and whether the UE is scheduled or not can be directly judged based on the three-dimensional tracing function.
PFi: and the ith UE outputs the priority coefficient through the Qos module.
The embodiments of the invention utilize an improved two-dimensional knapsack algorithm, the principle of which is as follows:
V(i,res cce ,res prb ) Indicating that the remaining resources are res cce And res prb The first i UEs are scheduled to obtain the maximum benefit.
When deciding whether to schedule the ith UE, only three cases are considered:
if the CCE needed by the ith UE exceeds the residual CCE total number, the UE can not be scheduled temporarily, and the profit is V (i-1,res) cce ,res prb )。
If CCE required by the ith UE is less than or equal to the rest of resources of the cell and PRB resources required by the ith UE are less than or equal to the rest of resources of the cell, the UE can schedule and obtain the benefit of V (i-1, res) cce -CCE i ,res prb -PRB i )+v i At this time, a comparison V (i-1, res) is required cce ,res prb ) And V (i-1,res) cce -CCE i ,res prb -PRB i )+v i And selecting the great profit as the final scheme.
If CCE required by the ith UE is less than or equal to the residual resources of the cell and the required PRB resources are greater than the residual resources of the cell, the UE can schedule, but RB scheduling needs to be cut off, and the obtained benefit is V (i-1,res) cce -CCE i ,res prb )+v′ i At this time, a comparison V (i-1, res) is required cce ,res p ) And V (i-1,res) cce -CCE i ,res prb )+v′ i And selecting the great profit as the final scheme.
The above principle can be summarized as the following formula:
initialization: v (0,res) cce ,res prb )＝V(i,CCE total ,PRB total )＝0
if res prb ＞PRB i
Figure BDA0001928287420000051
end
if res prb ≤PRB i
Figure BDA0001928287420000052
end
Wherein,
V i '＝res prb ×f(PF i )×SE i V i ＝PRB i ×f(PF i )×SE i
before calculating the dynamic value of the UE in the current scenario, the method may further include:
calculating to obtain equivalent spectrum efficiency (EqualSE) of each UE to be scheduled according to the respective Spectrum Efficiency (SE) of each UE to be scheduled;
and sequencing the UE to be scheduled according to the decreasing order of equal SE. Specifically, the equal se of each UE to be scheduled may include: equal SE = f (PF) × SE; where f (PF) is a function of a priority coefficient PF factor, and f (PF) may specifically be
Figure BDA0001928287420000053
But is not limited to f 1 。
Calculating the dynamic value of scheduling the UE in the current scenario may include:
traversing and generating three-dimensional value functions V (UEindx, CCEindx and PRBindx) corresponding to the first i UEs to be scheduled according to the UE dimension, the CCE dimension and the PRB dimension in sequence, and determining the dynamic values of the first i UEs to be scheduled according to the three-dimensional value functions; the UE index is the dimension of the number of the UE to be scheduled, the CCEindex is the dimension of the CCE resource, and the PRBindx is the dimension of the PRB resource. In this embodiment, the specific dynamic value of each UE is determined by traversing and generating three-dimensional cost functions corresponding to the first i UEs, and whether scheduling is required; the specific implementation is that whether the ith UE should be scheduled is determined according to the relationship between the three-dimensional cost functions of the first i UEs and the first i-1 three-dimensional cost functions, and the same applies to other UEs, that is, whether a specific UE should be scheduled is determined in a manner of repeated iteration. For example, if the three-dimensional cost function of the current i UEs is the same as the function value of the previous i-1 three-dimensional cost function, it indicates that the value improvement is not brought by scheduling the ith UE, and therefore the ith UE is not scheduled; correspondingly, if the difference is not the same, it indicates that the ith UE should be scheduled.
In some embodiments, traversing to generate a three-dimensional cost function V (UEindx, CCEindx, PRBindx) may include:
when the residual PRB resources of the cell are more than or equal to the PRB resources required by the UE to be scheduled, V (UEindx, CCEindx, PRBindx) = Max [ V (UEindx-1, CCEindx, PRBindx), V (UEindx-1, CCEindx-CCE) UEindex ，PRBindx-PRB UEindex )+v UEindx ]Calculating to obtain a three-dimensional value function V (UEindx, CCEindx, PRBindx);
when the residual PRB resources of the cell are smaller than the PRB resources required by the UE to be scheduled, V (UEindx-1, CCEindx, PRBindx) = Max [ V (UEindx-1, CCEindx, PRBindx), V (UEindx-1, CCEindx-CCE) UEindex ，PRBindx-PRB UEindex )+v’ UEindx ]Calculating to obtain a three-dimensional value function V (UEindx, CCEindx, PRBindx); wherein, the CCE mentioned above UEindex And PRB UEindex CCE resource and PRB resource occupied by ith UE respectively UEindx Is a first dynamic value, v 'of an ith UE' UEindx A second dynamic value for the ith UE. The first dynamic value and the second dynamic value are respectively corresponding dynamic values when the cell residual PRB resources are more than or equal to the PRB resources required by the UE to be scheduled, and when the cell residual PRB resources are less than the PRB resources required by the UE to be scheduled, the UE can be scheduled, but the scheduling RB needs to be truncated.
In some embodiments, when the three-dimensional cost function is generated through traversal, the method may further include:
and determining whether to schedule a three-dimensional tracing function Loc (UEindx, CCEindx, PRBindx) of the ith UE according to the relationship between the three-dimensional cost functions of the first i UEs and the first i-1 UEs. The three-dimensional tracking function is related to the three-dimensional cost function, and reflects whether the corresponding UE is scheduled or not and whether the scheduling RB needs to be cut off in the scheduled UE or not.
In some embodiments, determining whether to schedule the three-dimensional tracking function Loc (UEindx, CCEindx, PRBindx) of the ith UE according to the relationship between the three-dimensional cost functions of the first i UEs and the first i-1 UEs may include:
and when the three-dimensional cost function of the i pieces of UE before scheduling is equal to the three-dimensional cost function of each of the i-1 pieces of UE before scheduling, the function value of the three-dimensional tracking function corresponds to the ith UE which is not scheduled. For example, the function value of the three-dimensional cost function of i UEs before scheduling is equal to the function value of the three-dimensional cost function of i-1 UEs before scheduling, which indicates that the value in this scheduling is not improved by the scheduling of the ith UE, the UE is not scheduled; of course, any of the ith UE herein may also be that the jth UE in the first i-1 UEs has the same dynamic value as that of the jth UE scheduled before scheduling, and then the jth UE is not scheduled at this time. That is, the scheduling logic herein is only for whether the specified UE is scheduled in the traversal process, and does not affect the scheduling of other UEs.
The function value of the three-dimensional tracing function can be set in the following way:
when the ith UE needs to be scheduled, the function value is set to be 1; when the ith UE does not need to be scheduled, its function value is set to 0. Of course, the setting manner of the function value is not exclusive, and those skilled in the art can adopt any setting manner that can distinguish the function value from the function value, which is allowed in this embodiment.
And when the function value of the three-dimensional tracking function corresponds to scheduling the ith UE, the function value also corresponds to whether the residual PRB resources of the cell are more than or equal to the PRB resources required by the ith UE. And when the residual PRB resources of the cell are less than the resources required by the ith UE, the scheduling RB needs to be truncated. Specifically, the setting may be made in the following manner:
when the residual PRB resources of the cell are more than or equal to the PRB resources required by the ith UE, setting the function value of the residual PRB resources of the cell to be 1; and when the residual PRB resources of the cell are less than the PRB resources required by the ith UE, setting the function value of the residual PRB resources of the cell to be 2. Of course, the setting manner of the function value is not exclusive, and those skilled in the art can adopt any setting manner that can distinguish the function value from the function value, which is allowed in this embodiment.
In addition, the scheduling method in this embodiment is applicable to network environments including a pure frequency division scenario and a space division scenario, where the space division scenario includes UE that includes space division multiplexing in the system. When null exists, a null packet can be treated as one UE, and for null packets,
Figure BDA0001928287420000071
Figure BDA0001928287420000081
PRB air separation Equal to the number of null packets PRB; where k is the null packet UE index.
In some embodiments, determining the UE to be scheduled based on the dynamic value of the scheduled UE, and performing resource scheduling on the UE to be scheduled may include:
and tracing and scheduling the UE combination according to the scheduling condition of each UE to be scheduled corresponding to the three-dimensional tracing function, and taking the scheduled UE combination as the UE to be scheduled to perform resource scheduling.
When scheduling is carried out, the method comprises the following steps:
s201, traversing the three-dimensional tracing function Loc according to the first dimension UE index, wherein the traversing range is UETotal-1, and the CCE UETotal+1 ＝0，PRB UETotal+1 =0. S202 is performed.
S202, if the maximum flow of the ith UE relative to the (i-1) th UE is different and the tracking function value of the ith UE is equal to 1, the UE is scheduled without RB truncation, the next UE is circulated, and otherwise S203 is executed.
S203, if the maximum flow of the ith UE relative to the (i-1) th UE is different and the tracking function value of the ith UE is equal to 2, the UE is scheduled and RB truncation occurs, the next UE is circulated, and otherwise S204 is executed.
S204, judging that if the maximum flow of the ith UE relative to the (i-1) th UE is the same, the UE is not scheduled, and circulating the next UE until the UE is circulated.
The embodiment provides a resource scheduling method, which includes counting Control Channel Element (CCE) resources, physical Resource Block (PRB) resources and Spectrum Efficiency (SE) occupied by current User Equipment (UE) to be scheduled, and cell residual total CCE resources, PRB resources and total number of the UE to be scheduled; calculating the dynamic value of the scheduling UE in the current scene based on the data; and determining the UE to be scheduled according to the dynamic value of the scheduled UE, and performing resource scheduling on the UE to be scheduled. Therefore, the dynamic value in the scheme for scheduling the UE is determined according to the resource occupation condition of the UE to be scheduled and the residual resource condition of the cell, and the UE to be scheduled is determined according to the dynamic value, so that the resource utilization rate in the UE scheduling process is improved, and the throughput of the cell is also improved.
The second embodiment:
the embodiment provides a resource scheduling method, which comprises the following steps:
s301, parameter statistics. Counting CCE, PRB resource and SE of all UE to be scheduled in current TTI (the ith UE is CCE) i 、PRB i And SE i) Counting the total CCE, PRB resource and UE number to be scheduled (CCE) remained in the cell Total 、PRB Total And UE Total ). Each UE according to SE i And PF i Calculating EqualSE i And ordering the UEs to be scheduled from large to small according to equal SE.
EqualSE i ＝f(PF i )×SE i
f(PF i ) The function of the PF factor output by the Qos module can be specifically
Figure BDA0001928287420000091
But is not limited to, f1 (").
S302, calculating a dynamic value function V and a tracing function Loc according to scenes. The method is divided into two scenes, a pure frequency division Scene (Scene 1) and a Scene containing space division (Scene 2). If the pure frequency division scene is judged currently, step 303 is executed. If the scene containing the space division is judged currently, step 304 is executed.
S3031: the pure frequency division scenario is computed according to the following logic:
s3032: and traversing and generating a three-dimensional value function V (UEindx, CCEindx, PRBindx) and a three-dimensional tracing function Loc (UEindx, CCEindx, PRBindx) according to the dimension of the UE, the dimension of the CCE and the dimension of the PRB in sequence. The UE dimension traversal range is 1-UETotal, the CCE dimension traversal range is CCETotal-CCEUEindex, and the PRB dimension traversal range is PRBTotal-0. S3033 is performed, noting that CCEs and PRBs should be traversed in reverse order.
S3033: and distinguishing two scenes to calculate the cost function V, and executing S3034 when the residual PRB of the cell is greater than or equal to the PRB required by the UE, namely PRBindx is greater than or equal to PRBUEindex. When the cell remaining PRBs are smaller than the UE required PRBs, i.e. PRBindx < PRBUEindex, step S3035 is performed.
S3034: according to the formula V (UEindx, CCEindx, PRBindx) = Max (V (UEindx-1, CCEindx, PRBindx), V (UEindx-1, CCEindx-CCE) UEindex ，PRBindx-PRB UEindex )+v UEindx ) A cost function is calculated. And simultaneously judging whether V (UEindx, CCEindx, PRBindx) is changed relative to V (UEindx-1, CCEindx, PRBindx). Loc (UEindx, CCEindx, PRBindx) =1 if a change has occurred, and Loc (UEindx, CCEindx, PRBindx) =0 if no change has occurred.
S3035: according to the formula V (UEindx, CCEindx, PRBindx) = Max (V (UEindx-1, CCEindx, PRBindx), V (UEindx-1, CCEindx-CCE) UEindex ，PRBindx-PRB UEindex ) + v' UEindx) to compute the cost function. And simultaneously judging whether V (UEindx, CCEindx, PRBindx) is changed relative to V (UEindx-1, CCEindx, PRBindx). Loc (UEindx, CCEindx, PRBindx) =2 if a change has occurred, and Loc (UEindx, CCEindx, PRBindx) =0 if no change has occurred.
The pseudo code of step S303 is as follows:
Figure BDA0001928287420000101
Figure BDA0001928287420000111
s304: when null exists, the null packet is treated as one UE. For null packets
Figure BDA0001928287420000112
PRB Air separation Equal to the number of null packets PRB, where k is the null packet UE index. The method of calculating the dynamic cost function is the same as S303.
S305: and tracking and scheduling the UE combination. After the S302 is calculated, the value stored in V (UETotal, CCETotal, PRBTotal) is the maximum flow rate that can be obtained, and the value stored in Loc is the scheduling UE path that can obtain the maximum flow rate. The specific search method is as follows:
s3051: and traversing the Loc according to the UE index of the first dimension, wherein the traversal range is UETotal = -1, and CCEUETotal +1=0, and PRBUETotal +1=0. S3052 is performed.
S3052: and judging that if the maximum flow of the ith UE relative to the (i-1) th UE is different and the tracking function value of the ith UE is equal to 1, indicating that the UE is scheduled without RB truncation, circulating the next UE, and otherwise, executing S3053.
S3053: and judging whether the maximum flow of the ith UE relative to the (i-1) th UE is different and the tracking function value of the ith UE is equal to 2, indicating that the UE is scheduled and RB truncation occurs, circulating the next UE, and otherwise executing S3054.
S3054: and judging that if the maximum flow of the ith UE relative to the (i-1) th UE is the same, the UE is not scheduled, and circulating the next UE until the UE is circulated completely.
Step S305 pseudo code is as follows:
Loop：UEindx＝UETotal～1
and (3) judging: if V (UEindx, CCETotal-CCE) UEindex+1 ，PRBTotal-PRB UEindex+1 ) With respect to V (UEindx-1, CCETotal-CCE) UEindex+1 ，PRBTotal-PRB UEindex+1 ) The change has occurred, and Loc (UEindx, CCETotal-CCE) UEindex+1 ，PRBTotal-PRB UEindex+1 ) Is equal to 1
1) Indicating that the UE with the UE index number is scheduled and no RB is truncated;
2) Cycling the next UE;
and (3) judging: if V (UEindx, CCETotal-CCE) UEindex+1 ，PRBTotal-PRB UEindex+1 ) With respect to V (UEindx-1, CCETotal-CCE) UEindex+1 ，PRBTotal-PRB UEindex+1 ) The change has occurred, and Loc (UEindx, CCETotal-CCE) UEindex+1 ，PRBTotal-PRB UEindex+1 ) Is equal to 2
1) Indicating that the UE with the UE index number is scheduled and is truncated by the RB;
2) Cycling the next UE;
and (3) judging: if V (UEindx, CCETotal-CCE) UEindex+1 ，PRBTotal-PRB UEindex+1 ) Relative to V (UEindx-1, CCETotal-CCE) UEindex+1 ，PRBTotal-PRB UEindex+1 ) Is not changed
1) Indicating that the UE of the UEth index is not scheduled;
2) Cycling the next UE;
end Loop
EXAMPLE III
The present embodiment provides a specific example of a resource scheduling method, which includes:
example 1: CCE resources are sufficient, and PRB resources are insufficient.
Step 1: and (3) parameter statistics:
CCETotal＝20；
PRBTotal＝20；
UETotal＝4；
equivalent SE set for each UE = [10,9,8,6];
PRB set for each UE = [12, 6,7];
CCE set of each UE = [4,4,2,8].
Step 2: calculating a dynamic value function V and a tracing function Loc:
the final maximum value V (4, 20, 20) =19.83 is obtained.
And step 3: and (3) tracing scheduling UE combination:
1) V (4, 20, 20) =19.83 is not equal to V (3, 20, 20) =18.66, and Loc (4, 20, 20) =1, then UE4 needs scheduling and there is no RB truncation;
2) V (3, 12, 13) =13.83 is not equal to V (2, 12, 13) =10, loc (3, 12, 13) =1, then UE3 needs scheduling and there is no RB truncation;
3) V (2, 10, 7) =5.83 is equal to V (1, 10, 7) =5.83, then UE2 does not need scheduling;
4) V (1, 10, 7) =5.83 is not equal to V (0, 10, 7) =0, then UE1 needs scheduling and Loc (1, 10, 7) =2, and truncation has occurred.
Final scheduling case: UE1 (7 RB), UE3 (6 RB), UE4 (7 RB).
Example 2: CCE is insufficient and PRB is sufficient.
Step 1: and (3) parameter statistics:
CCETotal＝20；
PRBTotal＝20；
UETotal＝4；
equivalent SE set for each UE = [10,9,8,6];
PRB set for each UE = [6,4,5,5];
a CCE set of each UE = [12,4,2,8].
Step 2: calculating a dynamic value function V and a tracing function Loc:
the final maximum value V (4, 20, 20) =27 is obtained.
And 3, step 3: and (3) tracing scheduling UE combination:
1) V (4, 20, 20) =27 is equal to V (3, 20, 20) =27, then UE4 does not need scheduling;
2) V (3, 20, 20) =27 is not equal to V (2, 20, 20) =19, loc (3, 20, 20) =1, then UE3 needs scheduling and no RB truncation;
3) V (2, 18, 15) =19 is not equal to V (1, 18, 15) =10, then UE2 needs scheduling and Loc (2, 18, 15) =1, no RB truncation;
4) V (1, 14, 11) =10 is not equal to V (0, 14, 11) =0, then UE1 needs scheduling and Loc (1, 14, 11) =1, no RB truncation.
Final scheduling situation: UE1 (6 RB), UE3 (4 RB), UE4 (5 RB)
Example 3: CCE is insufficient, and PRB is insufficient.
Step 1: and (3) parameter statistics:
CCETotal＝20；
PRBTotal＝20；
UETotal＝4；
equivalent SE set for each UE = [10,9,8,6];
PRB set for each UE = [12, 6,7];
CCE set of each UE = [12,4,2,8].
And 2, step: calculating a dynamic value function V and a tracing function Loc:
the final maximum value V (4, 20, 20) =19.25 is obtained.
And 3, step 3: and (3) tracing scheduling UE combination:
1) V (4, 20, 20) =19.25 is not equal to V (3, 20, 20) =18.67, and Loc (4, 20, 20) =1, then UE4 needs scheduling and there is no RB truncation;
2) V (3, 12, 13) =13.25 is not equal to V (2, 12, 13) =10, loc (3, 12, 13) =1, then UE3 needs scheduling and there is no RB truncation;
3) V (2, 10, 7) =5.25 is not equal to V (1, 10, 7) =0, then UE2 needs scheduling and Loc (1, 10, 7) =2, truncation has occurred;
4) Since the PRBs have been used up at this point, UE1 will not schedule.
Final scheduling case: UE2 (7 RB), UE3 (6 RB), UE4 (7 RB).
Example four
In this embodiment, an apparatus for scheduling resources is provided, please refer to fig. 2, the apparatus includes:
a counting module 21, configured to count control channel element CCE resources, physical resource block PRB resources, and spectrum efficiency SE that are respectively occupied by current user equipment UE to be scheduled, as well as cell remaining total CCE resources, PRB resources, and a total number of UEs to be scheduled;
a calculating module 22, configured to calculate a dynamic value of the scheduling UE in the current scenario based on the above data;
and the scheduling module 23 is configured to determine the UE to be scheduled according to the dynamic value of the scheduled UE, and perform resource scheduling on the UE to be scheduled.
Before calculating the dynamic value of the UE in the current scenario, the method may further include:
calculating to obtain equivalent spectral efficiency (EqualSE) of each UE to be scheduled according to the respective SE of the UE to be scheduled;
and sequencing the UE to be scheduled according to the decreasing order of equal SE. Specifically, the equal se of each UE to be scheduled may include: equal SE = f (PF) × SE; where f (PF) is a function of a priority coefficient PF factor, and f (PF) may specifically be
Figure BDA0001928287420000151
But is not limited to f 1 。
Calculating the dynamic value of scheduling the UE in the current scenario may include:
traversing and generating three-dimensional value functions V (UEindx, CCEindx, PRBindx) corresponding to the first i pieces of UE to be scheduled according to the dimension of the UE, the dimension of the CCE and the dimension of the PRB in sequence, and determining the dynamic value of the first i pieces of UE to be scheduled according to each three-dimensional value function; the UE index is the dimension of the number of the UE to be scheduled, the CCEindex is the dimension of the CCE resource, and the PRBindx is the dimension of the PRB resource. In this embodiment, the specific dynamic value of each UE is determined by traversing the three-dimensional cost function corresponding to the first i UEs, and whether scheduling is required; the specific implementation is to determine whether the ith UE should be scheduled according to the relationship between the three-dimensional cost functions of the first i UEs and the first i-1 three-dimensional cost functions, and the same applies to other UEs, that is, determine whether a specific UE should be scheduled in a repeated iteration manner. For example, if the three-dimensional cost function of the current i UEs is the same as the function value of the previous i-1 three-dimensional cost function, it indicates that the scheduling of the ith UE does not bring any cost improvement, and therefore the scheduling of the ith UE is not performed; correspondingly, if the difference is not the same, it indicates that the ith UE should be scheduled.
In some embodiments, traversing the generated three-dimensional cost function V (UEindx, CCEindx, PRBindx) may include:
when the residual PRB resource of the cell is largeWhen the resource is equal to the PRB resource required by the UE to be scheduled, according to V (UEindx, CCEindx, PRBindx) = Max [ V (UEindx-1, CCEindx, PRBindx), V (UEindx-1, CCEindx-CCE) UEindex ，PRBindx-PRB UEindex )+v UEindx ]Calculating to obtain a three-dimensional value function V (UEindx, CCEindx, PRBindx);
when the residual PRB resources of the cell are smaller than the PRB resources required by the UE to be scheduled, according to V (UEindx, CCEindx, PRBindx) = Max [ V (UEindx-1, CCEindx, PRBindx), V (UEindx-1, CCEindx-CCE) UEindex ，PRBindx-PRB UEindex )+v’ UEindx ]Calculating to obtain a three-dimensional value function V (UEindx, CCEindx, PRBindx); wherein, the CCE mentioned above UEindex And PRB UEindex CCE resource and PRB resource occupied by ith UE respectively UEindx Is a first dynamic value, v 'of an ith UE' UEindx A second dynamic value for the ith UE. The first dynamic value and the second dynamic value are respectively corresponding dynamic values when the cell residual PRB resources are more than or equal to the PRB resources required by the UE to be scheduled, and when the cell residual PRB resources are less than the PRB resources required by the UE to be scheduled, the UE can be scheduled, but the scheduling RB needs to be truncated.
In some embodiments, when the three-dimensional cost function is generated through traversal, the method may further include:
and determining whether to schedule a three-dimensional tracking function Loc (UEindx, CCEindx, PRBindx) of the ith UE according to the relationship between the three-dimensional cost functions of the first i UEs and the first i-1 UEs. The three-dimensional tracking function is related to the three-dimensional cost function, and is reflected by whether the corresponding UE is scheduled or not and whether the scheduled RB needs to be truncated in the scheduled UE or not.
In some embodiments, determining whether to schedule the three-dimensional tracking function Loc (UEindx, CCEindx, PRBindx) of the ith UE according to a relationship between the three-dimensional cost functions of the first i UEs and the first i-1 UEs may include:
and when the three-dimensional cost function of the i pieces of UE before scheduling is equal to the three-dimensional cost function of each of the i-1 pieces of UE before scheduling, the function value of the three-dimensional tracking function corresponds to the ith UE which is not scheduled. For example, the function value of the three-dimensional cost function of the i UEs before scheduling is equal to the function value of the three-dimensional cost function of the i-1 UEs before scheduling, which means that the value in this scheduling is not improved by the scheduling of the ith UE, the UE is not scheduled; of course, any of the ith UE herein may also be that the jth UE in the first i-1 UEs has the same dynamic value as that of the jth UE scheduled before scheduling, and then the jth UE is not scheduled at this time. That is, the scheduling logic herein is only for whether the specified UE is scheduled in the traversal process, and does not affect the scheduling of other UEs.
The function value of the three-dimensional tracking function can be set by the following method:
when the ith UE needs to be scheduled, the function value is set to be 1; when the ith UE does not need to be scheduled, its function value is set to 0. Of course, the setting manner of the function value is not exclusive, and those skilled in the art can adopt any setting manner that can distinguish the function value from the function value, which is allowed in this embodiment.
And when the function value of the three-dimensional tracking function corresponds to scheduling the ith UE, the function value also corresponds to whether the residual PRB resources of the cell are more than or equal to the PRB resources required by the ith UE. And when the residual PRB resources of the cell are less than the resources required by the ith UE, the scheduling RB needs to be truncated. Specifically, the setting may be performed in the following manner:
when the residual PRB resources of the cell are more than or equal to the PRB resources required by the ith UE, setting the function value of the residual PRB resources of the cell to be 1; and when the residual PRB resource of the cell is smaller than the PRB resource required by the ith UE, setting the function value of the residual PRB resource of the cell to be 2. Of course, the setting manner of the function value is not exclusive, and those skilled in the art can adopt any setting manner that can distinguish the function value from the function value, which is allowed in this embodiment.
In addition, the scheduling method in this embodiment is applicable to network environments including a pure frequency division scenario and a space division scenario, where the space division scenario includes UE with space division multiplexing. When null exists, a null packet can be treated as one UE, and for null packets,
Figure BDA0001928287420000171
Figure BDA0001928287420000181
PRB air separation Equal to the number of null packets PRB; where k is the null packet UE index.
In some embodiments, determining the UE to be scheduled based on the dynamic value of the scheduled UE, and performing resource scheduling on the UE to be scheduled may include:
and tracing and scheduling the UE combination according to the scheduling condition of each UE to be scheduled corresponding to the three-dimensional tracing function, and performing resource scheduling by taking the scheduled UE combination as the UE to be scheduled.
When scheduling is carried out, the method comprises the following steps:
step 1, traversing a three-dimensional tracing function Loc according to a first dimension UE index, wherein the traversal range is UETotal-1, and the CCE UETotal+1 ＝0，PRB UETotal+1 And =0. Step 2 is performed.
And 2, judging that if the maximum flow of the ith UE relative to the (i-1) th UE is different and the tracking function value of the ith UE is equal to 1, indicating that the UE is scheduled without RB truncation, circulating the next UE, and otherwise, executing the step 3.
And 3, judging whether the maximum flow of the ith UE relative to the (i-1) th UE is different and the tracking function value of the ith UE is equal to 2, indicating that the UE is scheduled and RB truncation occurs, circulating the next UE, and otherwise, executing the step 4.
And 4, judging that if the maximum flow of the ith UE relative to the (i-1) th UE is the same, the UE is not scheduled, and circulating the next UE until the UE is circulated.
The embodiment provides a resource scheduling device, which counts Control Channel Element (CCE) resources, physical Resource Block (PRB) resources and Spectrum Efficiency (SE) occupied by current User Equipment (UE) to be scheduled, and the total number of the residual CCE resources, the PRB resources and the UE to be scheduled in a cell; calculating the dynamic value of the scheduling UE in the current scene based on the various data; and determining the UE to be scheduled according to the dynamic value of the scheduled UE, and performing resource scheduling on the UE to be scheduled. Therefore, the dynamic value in the scheme for scheduling the UE is determined according to the resource occupation condition of the UE to be scheduled and the residual resource condition of the cell, and the UE to be scheduled is determined according to the dynamic value, so that the resource utilization rate in the UE scheduling process is improved, and the throughput of the cell is also improved.
EXAMPLE five
The present embodiment further provides a network device, as shown in fig. 3, which includes a processor 31, a memory 32 and a communication bus 33, wherein:
the communication bus 33 is used for realizing connection communication between the processor 31 and the memory 32;
the processor 31 is configured to execute one or more computer programs stored in the memory 32 to implement the steps of the resource scheduling method in the foregoing embodiments, which are not described herein again.
The present embodiments also provide a computer-readable storage medium including volatile or non-volatile, removable or non-removable media implemented in any method or technology for storage of information such as computer-readable instructions, data structures, computer program modules or other data. Computer-readable storage media include, but are not limited to, RAM (Random Access Memory), ROM (Read-Only Memory), EEPROM (Electrically Erasable Programmable Read-Only Memory), flash Memory or other Memory technology, CD-ROM (Compact disk Read-Only Memory), digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer.
The computer readable storage medium in this embodiment may be used to store one or more computer programs, and the stored one or more computer programs may be executed by a processor to implement at least one step of the resource scheduling method in the above embodiments.
The present embodiment also provides a computer program (or computer software), which can be distributed on a computer readable medium and executed by a computing device to implement at least one step of the resource scheduling method in the above embodiments.
The present embodiments also provide a computer program product comprising a computer readable means on which a computer program as shown above is stored. The computer readable means in this embodiment may comprise a computer readable storage medium as shown above.
It will be apparent to those skilled in the art that all or some of the steps of the methods, systems, functional modules/units in the devices disclosed above may be implemented as software (which may be implemented in computer program code executable by a computing device), firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed by several physical components in cooperation. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit.
In addition, as is well known to those of ordinary skill in the art, communication media typically embodies computer readable instructions, data structures, computer program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media. Thus, the present invention is not limited to any specific combination of hardware and software.
The foregoing is a more detailed description of the embodiments of the present invention, and the specific embodiments are not to be considered as limiting the invention. For those skilled in the art to which the invention pertains, several simple deductions or substitutions can be made without departing from the spirit of the invention, and all shall be considered as belonging to the protection scope of the invention.

Claims (10)

1. A resource scheduling method comprises the following steps:
counting Control Channel Element (CCE) resources, physical Resource Block (PRB) resources and Spectrum Efficiency (SE) occupied by current User Equipment (UE) to be scheduled, and the total number of the residual CCE resources, the PRB resources and the UE to be scheduled in a cell;
calculating to obtain the equivalent spectrum efficiency equal of each UE to be scheduled according to the respective spectrum efficiency SE of the UE to be scheduled;
sequencing the UE to be scheduled according to the decreasing order of equal SE;
traversing and generating three-dimensional cost functions V (UEindx, CCEindx, PRBindx) corresponding to the first i UEs to be scheduled according to the UE dimension, the CCE dimension and the PRB dimension in sequence, and determining the dynamic values of the first i UEs to be scheduled according to the three-dimensional cost functions; the UE index is the dimension of the number of the UE to be scheduled, CCEindex is the dimension of a CCE resource, PRBindx is the dimension of a PRB resource, and i is the sequencing serial number of the current UE;
and detecting whether each UE is taken as the UE to be scheduled or not in a cyclic iteration mode, for the ith UE, under the condition that the three-dimensional cost function of the first i UEs is the same as that of the first i-1 UEs, not taking the ith UE as the UE to be scheduled, and under the condition that the three-dimensional cost function of the first i UEs is different from that of the first i-1 UEs, taking the ith UE as the UE to be scheduled, and performing resource scheduling on the UE to be scheduled.
2. The method for resource scheduling according to claim 1, wherein the equal se for each UE to be scheduled comprises:
Figure 140828DEST_PATH_IMAGE001
(ii) a Wherein, the
Figure 863934DEST_PATH_IMAGE002
As a function of the priority coefficient PF factor.
3. The method for resource scheduling according to claim 1 wherein the traversing generates three-dimensional cost functions V (UEindx, CCEindx, PRBindx) corresponding to i UEs before scheduling, comprising:
when the residual PRB resources of the cell are more than or equal to the PRB resources required by the UE to be scheduled, V (UEindx, CCEindx, PRBindx) = Max [ V (UEindx-1, CCEindx, PRBindx), V (UEindx-1, CCEindx-CCE) UEindex ，PRBindx-PRB UEindex ）+ v UEindx ]Calculating to obtain the three-dimensional cost function V (UEindx, CCEindx, PRBindx);
when the residual PRB resources of the cell are smaller than the PRB resources required by the UE to be scheduled, V (UEindx-1, CCEindx, PRBindx) = Max [ V (UEindx-1, CCEindx, PRBindx), V (UEindx-1, CCEindx-CCE) UEindex ，PRBindx-PRB UEindex ）+ v’ UEindx ]Calculating to obtain the three-dimensional cost function V (UEindx, CCEindx, PRBindx); wherein the CCE UEindex And PRB UEindex CCE resources and PRB resources occupied by the ith UE respectively, wherein v is UEindx Is a first dynamic value of the ith UE, the v' UEindx A second dynamic value for the ith UE.
4. The method for scheduling resources according to claim 3, wherein when the traversing generates three-dimensional cost functions corresponding to i UEs before scheduling, further comprising:
and determining whether to schedule a three-dimensional tracking function Loc (UEindx, CCEindx, PRBindx) of the ith UE according to the relationship between the three-dimensional cost functions of the first i UEs and the first i-1 UEs.
5. The method of claim 4, wherein the determining whether to schedule the three-dimensional tracking function Loc (UEindx, CCEindx, PRBindx) of the ith UE according to the relationship between the three-dimensional cost functions of the first i UEs and the first i-1 UEs comprises:
and when the three-dimensional cost function of the i pieces of UE before scheduling is equal to the three-dimensional cost function of each of the i-1 pieces of UE before scheduling, the function value of the three-dimensional tracking function corresponds to the i-th UE which is not scheduled.
6. The method for resource scheduling according to claim 5, wherein the function value of the three-dimensional tracking function, when corresponding to scheduling the ith UE, further corresponds to whether the cell remaining PRB resources are greater than or equal to the PRB resources required by the ith UE.
7. The method for scheduling resources according to claim 5, wherein the scheduling the resources for the UE to be scheduled, comprises:
and tracing and scheduling UE combinations according to the scheduling conditions of the UE to be scheduled corresponding to the three-dimensional tracing function, and taking the scheduling UE combinations as the UE to be scheduled to perform resource scheduling.
8. A resource scheduling apparatus, comprising:
the counting module is used for counting Control Channel Element (CCE) resources, physical Resource Block (PRB) resources and Spectrum Efficiency (SE) occupied by the current User Equipment (UE) to be scheduled, as well as the total number of the residual CCE resources, the PRB resources and the UE to be scheduled in a cell;
the calculating module is used for calculating to obtain the equivalent spectral efficiency equal SE of each UE to be scheduled according to the respective spectral efficiency SE of the UE to be scheduled; sequencing the UE to be scheduled according to the decreasing order of equal SE;
traversing and generating three-dimensional cost functions V (UEindx, CCEindx, PRBindx) corresponding to the first i UEs to be scheduled according to the UE dimension, the CCE dimension and the PRB dimension in sequence, and determining the dynamic values of the first i UEs to be scheduled according to the three-dimensional cost functions; the UE index is the dimension of the number of the UE to be scheduled, CCEindex is the dimension of a CCE resource, PRBindx is the dimension of a PRB resource, and i is the sequencing serial number of the current UE;
and the scheduling module is used for detecting whether each UE is taken as the UE to be scheduled in a cyclic iteration mode, for the ith UE, under the condition that the three-dimensional cost function of the first i UEs is the same as that of the first i-1 UEs, the ith UE is not taken as the UE to be scheduled, and under the condition that the three-dimensional cost function of the first i UEs is different from that of the first i-1 UEs, the ith UE is taken as the UE to be scheduled, and resource scheduling is performed on the UE to be scheduled.
9. A network device comprising a processor, a memory, and a communication bus;
the communication bus is used for realizing connection communication between the processor and the memory; the processor is configured to execute one or more computer programs stored in the memory to implement the steps of the resource scheduling method according to any of claims 1-7.
10. A computer-readable storage medium, having one or more computer programs stored thereon, the one or more computer programs being executable by one or more processors to perform the steps of the resource scheduling method according to any one of claims 1-7.
CN201811627502.1A 2018-12-28 2018-12-28 Resource scheduling method and device, network equipment and readable storage medium Active CN111385899B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201811627502.1A CN111385899B (en) 2018-12-28 2018-12-28 Resource scheduling method and device, network equipment and readable storage medium
PCT/CN2019/128944 WO2020135648A1 (en) 2018-12-28 2019-12-27 Resource scheduling method and apparatus, network device, and readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811627502.1A CN111385899B (en) 2018-12-28 2018-12-28 Resource scheduling method and device, network equipment and readable storage medium

Publications (2)

Publication Number Publication Date
CN111385899A CN111385899A (en) 2020-07-07
CN111385899B true CN111385899B (en) 2023-03-14

Family

ID=71125708

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811627502.1A Active CN111385899B (en) 2018-12-28 2018-12-28 Resource scheduling method and device, network equipment and readable storage medium

Country Status (2)

Country Link
CN (1) CN111385899B (en)
WO (1) WO2020135648A1 (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112533270B (en) * 2020-12-16 2022-09-13 中国联合网络通信集团有限公司 Base station energy-saving processing method and device, electronic equipment and storage medium

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102821475A (en) * 2011-06-10 2012-12-12 中兴通讯股份有限公司 User dispatching method and device
CN102869106A (en) * 2011-07-07 2013-01-09 中兴通讯股份有限公司 Self-adaption adjusting method and device of PDCCH (physical downlink control channel)
CN102958174A (en) * 2011-08-26 2013-03-06 中兴通讯股份有限公司 Method, device and system for reallocation of frequency spectrum resources
CN103716891A (en) * 2013-12-31 2014-04-09 大唐移动通信设备有限公司 Method and system for allocating PUCCH resource positions in LTE-A system
CN104284439A (en) * 2013-07-10 2015-01-14 中国移动通信集团公司 Dispatching method and device for user terminal
CN107155220A (en) * 2016-03-02 2017-09-12 大唐移动通信设备有限公司 A kind of resource regulating method and device
CN108123738A (en) * 2016-11-27 2018-06-05 上海朗帛通信技术有限公司 A kind of method and apparatus in UE for dynamic dispatching, base station
CN108156663A (en) * 2017-12-25 2018-06-12 西安科技大学 A kind of method for improving control channel resource allocation in LTE
CN108235443A (en) * 2016-12-22 2018-06-29 大唐移动通信设备有限公司 The business scheduling method and device of a kind of downlink subframe

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017036550A1 (en) * 2015-09-04 2017-03-09 Telefonaktiebolaget Lm Ericsson (Publ) Dynamic ul prb resource allocation
CN108012333B (en) * 2016-11-02 2020-04-21 普天信息技术有限公司 Resource allocation method and device for downlink control channel in LTE (Long term evolution) system

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102821475A (en) * 2011-06-10 2012-12-12 中兴通讯股份有限公司 User dispatching method and device
CN102869106A (en) * 2011-07-07 2013-01-09 中兴通讯股份有限公司 Self-adaption adjusting method and device of PDCCH (physical downlink control channel)
CN102958174A (en) * 2011-08-26 2013-03-06 中兴通讯股份有限公司 Method, device and system for reallocation of frequency spectrum resources
CN104284439A (en) * 2013-07-10 2015-01-14 中国移动通信集团公司 Dispatching method and device for user terminal
CN103716891A (en) * 2013-12-31 2014-04-09 大唐移动通信设备有限公司 Method and system for allocating PUCCH resource positions in LTE-A system
CN107155220A (en) * 2016-03-02 2017-09-12 大唐移动通信设备有限公司 A kind of resource regulating method and device
CN108123738A (en) * 2016-11-27 2018-06-05 上海朗帛通信技术有限公司 A kind of method and apparatus in UE for dynamic dispatching, base station
CN108235443A (en) * 2016-12-22 2018-06-29 大唐移动通信设备有限公司 The business scheduling method and device of a kind of downlink subframe
CN108156663A (en) * 2017-12-25 2018-06-12 西安科技大学 A kind of method for improving control channel resource allocation in LTE

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
4G网络的资源瓶颈分析;王月珍等;《电信科学》;20170520(第05期);全文 *
基于小区间干扰协调的动态公平调度算法研究;张晓阳等;《信息技术》;20180823(第08期);全文 *

Also Published As

Publication number Publication date
WO2020135648A1 (en) 2020-07-02
CN111385899A (en) 2020-07-07

Similar Documents

Publication Publication Date Title
CN111342941B (en) Configuration method and equipment of feedback control channel
CN104243086B (en) Modulation and Coding Scheme determines method, base station and communication system
CN109963335B (en) Communication method and device
KR101539214B1 (en) Method of scheduling and admission control for guaranteed bit rate and/or maximum bit rate services
US11039448B2 (en) Resource scheduling method and apparatus
CN110248417B (en) Resource allocation method and system for communication service in power Internet of things
CN107682136B (en) Method and equipment for determining EPDCCH (enhanced physical downlink control channel) candidates
CN103828463B (en) Method, network side equipment and the user equipment of Downlink Control Information transmission
WO2020228419A1 (en) Method for signaling transmission, user terminal, base station and storage medium
CN102404862B (en) Method for PDCCH (Physical Downlink Control Channel) resource allocation in LTE (Long Term Evolution) system
CN108650709A (en) A kind of uplink power distribution method and mobile communication system
CN110519728B (en) Vehicle-mounted communication resource allocation method and device
CN111385899B (en) Resource scheduling method and device, network equipment and readable storage medium
CN107124772B (en) Resource scheduling method and device
CN114071472A (en) Resource allocation method and device, and communication equipment
CN105530705B (en) The distribution method and device of down control channel resources
US20210298057A1 (en) Transport Block Scheduling Method and Device, Storage Medium and Electronic Device
US10356799B2 (en) Scheduling method and apparatus of wireless communication system
CN107155220B (en) Resource scheduling method and device
CN111565409B (en) Noise power calculation method and device
WO2018072686A1 (en) Method and device for satellite communication system data scheduling and base station
CN111385902A (en) Data scheduling method and device
CN104053240B (en) Resource allocation methods and device in a kind of Synergistic multi-point system
WO2022218022A1 (en) Resource allocation method and apparatus
CN111970104A (en) Downlink control information transmission method, device and equipment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant