CN111224761B - Uplink scheduling method and device - Google Patents

Uplink scheduling method and device Download PDF

Info

Publication number
CN111224761B
CN111224761B CN201811419706.6A CN201811419706A CN111224761B CN 111224761 B CN111224761 B CN 111224761B CN 201811419706 A CN201811419706 A CN 201811419706A CN 111224761 B CN111224761 B CN 111224761B
Authority
CN
China
Prior art keywords
cell
base station
ues
scheduled
current maximum
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
CN201811419706.6A
Other languages
Chinese (zh)
Other versions
CN111224761A (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.)
Chengdu Huawei Technology Co Ltd
Original Assignee
Chengdu Huawei Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Chengdu Huawei Technology Co Ltd filed Critical Chengdu Huawei Technology Co Ltd
Priority to CN201811419706.6A priority Critical patent/CN111224761B/en
Publication of CN111224761A publication Critical patent/CN111224761A/en
Application granted granted Critical
Publication of CN111224761B publication Critical patent/CN111224761B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/56Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/003Arrangements for allocating sub-channels of the transmission path
    • H04L5/0078Timing of allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/14Two-way operation using the same type of signal, i.e. duplex
    • H04L5/1469Two-way operation using the same type of signal, i.e. duplex using time-sharing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/535Allocation or scheduling criteria for wireless resources based on resource usage policies

Abstract

The embodiment of the invention provides an uplink scheduling method and device, relates to the technical field of communication, and aims to improve the user perception rate to a certain extent and improve the user experience. The method comprises the following steps: the base station determines N first UEs from M UEs to be scheduled, wherein M is larger than or equal to N, M is a positive integer larger than or equal to 2, and N is a positive integer larger than or equal to 1; and the base station determines a first time period; and the base station performs priority scheduling on the N first UEs in the first time period.

Description

Uplink scheduling method and device
Technical Field
The embodiment of the invention relates to the technical field of communication, in particular to an uplink scheduling method and device.
Background
In a communication system, when a base station communicates with User Equipment (UE), the base station may perform uplink scheduling on the UE, and allocate scheduling resources and scheduling time to the UE.
Generally, when a UE has an uplink data transmission requirement, the UE first sends an uplink scheduling request to a base station, and then the base station sends an uplink scheduling grant (i.e. UL grant) to the UE after receiving the uplink scheduling request, so that the UE carries a data amount of data to be transmitted in a buffer status report and sends the data amount to the base station, and the base station schedules a plurality of UEs by using any scheduling method, such as round-robin scheduling, enhanced proportional fair scheduling, maximum carrier-to-interference ratio scheduling, or weight-based scheduling, to implement uplink data transmission of the UE.
However, in the above several existing scheduling methods, there may be a situation that all users are transmitting data in the whole transmission time period, so that the average rate of users is relatively low and the user experience is poor.
Disclosure of Invention
The application provides an uplink scheduling method and device, which can improve the user perception rate to a certain extent and improve the user experience.
In order to achieve the purpose, the technical scheme is as follows:
in a first aspect, the present application provides an uplink scheduling method, which may include: the base station determines N first UEs from M UEs to be scheduled, wherein M is greater than or equal to N, M is a positive integer greater than or equal to 2, and N is a positive integer greater than or equal to 1; then the base station determines a first time period; and in the first time period, the N first UEs are scheduled preferentially.
According to the uplink scheduling method provided by the application, the base station can firstly ensure that the N first UEs finish data transmission preferentially in the first time period, and the N first UEs can only transmit data in the first time period, so that the perception rate of users corresponding to the N first UEs is improved according to the transmitted data volume and the transmission time (namely the first time period) of the N first UEs, and the user experience is improved. Further, since the N first UEs have completed data transmission in the first time period, it can be known that the average number of active users is reduced in comparison with the prior art in the whole data transmission time, so that the average sensing rate of the cell is increased. Generally, the uplink scheduling method provided by the application can improve the user perception rate to a certain extent and improve the user experience.
In a possible implementation manner, the method for the base station to determine N first UEs from M UEs to be scheduled may include: the base station determines the current maximum throughput of the cell; and determining the number N of the first UEs according to the current maximum throughput and the cell target rate; and determining N first UEs from the M UEs to be scheduled according to the data volume to be transmitted of the M UEs to be scheduled and/or the time for sending the data transmission request by the M UEs to be scheduled respectively.
In the present application, a base station may determine, according to a current maximum throughput of a cell, the number of first UEs that can reach a cell target rate, specifically, a ratio of the current maximum throughput of the cell to the cell target rate is the number of the first UEs, where the cell target rate may be an expected maximum rate at which the cell currently processes a certain service, for example, the service may be a web browsing service, a text transmission service, a picture transmission service, a video transmission service, or the like; the target rate of the cell may also be an average rate expected to be achieved by the cell, and the average rate may be an average of expected maximum rates of various services handled by the cell; the target rate of the cell may be other rates that meet the actual usage requirement, and the application is not particularly limited.
In a possible implementation manner, the method for the base station to determine N first UEs from M UEs to be scheduled may specifically include any one of A1 to A3:
a1, a base station determines N first UE from M UE to be scheduled according to data quantity transmitted by the M UE to be scheduled respectively. In the application, the base station sequences the data volumes to be transmitted of the M UEs to be scheduled, and determines the first N UEs with the smallest data volumes as the first UE, that is, the base station preferentially selects the UE with the small data volume to be transmitted.
And A2, the base station determines N first UEs from the M UEs to be scheduled according to the time when the M UEs to be scheduled respectively send data transmission requests. In the application, the base station determines the first N earliest UEs sending the data transmission requests as the first UEs according to the sequence of the times when the M UEs to be scheduled send the data transmission requests, that is, the base station preferentially selects the UE sending the data transmission request earlier.
And A3, the base station determines N first UEs from the M UEs to be scheduled according to the data volume transmitted by the M UEs to be scheduled respectively and the time for sending data transmission requests by the M UEs to be scheduled respectively. In one implementation, the base station may determine the N first UEs from the M UEs to be scheduled according to a comprehensive sequence of a sequence of data amounts transmitted by the UEs and a sequence of times when the UEs send data transmission requests.
In a possible implementation manner, the base station may further determine a comprehensive ranking of the UEs in a weighting manner of the ordering of the data amount transmitted by the UEs and the ordering of the time when the UEs send the data transmission requests, for example, assign a larger weight to the ordering of the data amount transmitted by the UEs, assign a smaller weight to the ordering of the time when the UEs send the data transmission requests, or assign a smaller weight to the ordering of the data amount transmitted by the UEs, and assign a larger weight to the ordering of the time when the UEs send the data transmission requests, which is not specifically limited in this application.
In a possible implementation manner, the method for the base station to determine the current maximum throughput of the cell may include: and the base station determines the current maximum throughput of the cell according to the throughput of the cell in the historical statistical period and the average resource utilization rate in the historical statistical period, wherein the current maximum throughput of the cell is the ratio of the throughput of the cell in the historical statistical period to the average resource utilization rate in the historical statistical period.
In a possible implementation manner, the method for the base station to determine the current maximum throughput of the cell may include: the base station may be based on one or more of the following factors: the frequency spectrum efficiency of M UE to be scheduled, the current bandwidth of the cell, the uplink and downlink subframe ratio and the current maximum throughput of the cell are determined.
In one possible implementation, if the duplex mode of the cell is the frequency division duplex, FDD, mode, the current maximum throughput of the cell is determined using the following formula:
Figure BDA0001880287400000021
where T _ max is the current maximum throughput of the cell, SE i For the spectral efficiency of the ith UE among the M UEs to be scheduled, RE _ num is the number of REs corresponding to the current bandwidth of the cell.
In one possible implementation, if the duplex mode of the cell is the TDD mode, the current maximum throughput of the cell is determined by using the following formula:
Figure BDA0001880287400000022
where T _ max is the current maximum throughput of the cell, SE i The method includes the steps that the spectrum efficiency of the ith UE in M UEs to be scheduled is obtained, RE _ num is the number of REs corresponding to the current bandwidth of a cell, and subframe _ r is the ratio of uplink subframes to downlink subframes.
In the present application, an MCS is configured on a UE, and specifically, the MCS is embodied in a form of an MCS table, and the MCS table of one UE includes a mapping relationship between an index value of the MCS and a signal to interference plus noise ratio (SINR), a Spectral Efficiency (SE), and the like of the UE.
In a possible implementation manner, the first time period is configured in advance at the base station.
In a possible implementation manner, the method for the base station to determine the first time period may include: and the base station determines a first time period according to the data volume to be transmitted of the N first UEs and the target speed of the cell. Specifically, the base station determines a time for each of the N first UEs to transmit data, and takes the sum of the times for the N first UEs to transmit data as a first time period, that is:
Figure BDA0001880287400000031
wherein it is present>
Figure BDA0001880287400000032
Wherein T _ N is a first time period T i Time of data transmission for ith first UE of N first UEs i And V _ rate is the target rate of the cell, and is the data volume to be transmitted by the ith first UE.
In a second aspect, the present application provides a base station including a first determining module, a second determining module, and a scheduling module. The first determining module is used for determining N first UEs from M UEs to be scheduled, wherein M is larger than or equal to N, M is a positive integer larger than or equal to 2, and N is a positive integer larger than or equal to 1; a second determining module for determining the first time period; and the scheduling module is used for carrying out priority scheduling on the N first UEs in the first time period.
In a possible implementation manner, the first determining module is specifically configured to determine a current maximum throughput of a cell; and determining the number N of the first UEs according to the current maximum throughput and the cell target rate; and determining N first UEs from the M UEs to be scheduled according to the data volume to be transmitted of the M UEs to be scheduled and/or the time for sending the data transmission request by the M UEs to be scheduled respectively.
In a possible implementation manner, the first determining module is specifically configured to determine the current maximum throughput of the cell according to the throughput of the cell in the historical statistics period and the average resource utilization rate in the historical statistics period, where the current maximum throughput of the cell is a ratio of the throughput of the cell in the historical statistics period to the average resource utilization rate in the historical statistics period.
In a possible implementation manner, the first determining module is specifically configured to determine, according to one or more of the following factors: the frequency spectrum efficiency of M UE to be scheduled, the current bandwidth of the cell, the uplink and downlink subframe ratio and the current maximum throughput of the cell are determined.
In a possible implementation manner, the duplex mode of the cell is an FDD mode, and the first determining module is specifically configured to determine the current maximum throughput of the cell by using the following formula:
Figure BDA0001880287400000033
/>
where T _ max is the current maximum throughput of the cell, SE i And RE _ num is the number of REs corresponding to the current bandwidth of the cell, and is the spectral efficiency of the ith UE in the M UEs to be scheduled.
In a possible implementation manner, the duplex mode of the cell is a TDD mode, and the first determining module is specifically configured to determine the current maximum throughput of the cell by using the following formula:
Figure BDA0001880287400000034
where T _ max is the current maximum throughput of the cell, SE i For the spectral efficiency of the ith UE among M UEs to be scheduled, RE _ num is the current cellThe number of REs corresponding to the bandwidth, subframe _ r, is the uplink and downlink subframe ratio.
In a possible implementation manner, the first time period is configured in advance at the base station.
In a possible implementation manner, the second determining module is specifically configured to determine the first time period according to the data amount to be transmitted by the N first UEs and the target cell rate. Specifically, the base station determines the time for each of the N first UEs to transmit data, and takes the sum of the times for the N first UEs to transmit data as a first time period, that is:
Figure BDA0001880287400000041
wherein it is present>
Figure BDA0001880287400000042
Wherein T _ N is a first time period T i Time of transmission of data for ith first UE of N first UEs, data i And V _ rate is the target rate of the cell, and is the data volume to be transmitted by the ith first UE.
In a third aspect, the present application provides a base station comprising a processor and a memory coupled to the processor; the memory is configured to store computer instructions, and when the base station runs, the processor executes the computer instructions stored in the memory, so that the base station executes the uplink scheduling method described in any one of the first aspect and various possible implementation manners thereof.
In a fourth aspect, the present application provides a computer-readable storage medium, which may include computer instructions, and when the computer instructions are executed on a computer, the computer instructions cause a base station to execute the uplink scheduling method described in any one of the first aspect and various possible implementation manners thereof.
In a fifth aspect, the present application provides a computer program product comprising computer instructions, which when run on a computer, causes the base station to execute the uplink scheduling method of the first aspect and any one of its various possible implementations.
It is to be understood that the base station according to the second aspect, the base station according to the third aspect, the computer storage medium according to the fifth aspect, and the computer program product according to the sixth aspect are all configured to execute the corresponding method provided above, and therefore, the beneficial effects achieved by the base station according to the second aspect and the corresponding method provided above can be referred to, and are not described herein again.
Drawings
Fig. 1 is a block diagram of a wireless communication system according to an embodiment of the present invention;
fig. 2 is a hardware schematic diagram of a base station according to an embodiment of the present invention;
fig. 3 is a first schematic diagram illustrating an uplink scheduling method according to an embodiment of the present invention;
fig. 4 is a schematic diagram illustrating a second uplink scheduling method according to an embodiment of the present invention;
FIG. 5 is a schematic diagram illustrating a cumulative distribution of user perception rates according to an embodiment of the present invention;
fig. 6 is a first schematic structural diagram of a base station according to an embodiment of the present invention;
fig. 7 is a schematic structural diagram of a base station according to an embodiment of the present invention.
Detailed Description
The term "and/or" herein is merely an association describing an associated object, meaning that three relationships may exist, e.g., a and/or B, may mean: a exists alone, A and B exist simultaneously, and B exists alone.
The terms "first" and "second," and the like in the description and in the claims of embodiments of the present invention, are used for distinguishing between different objects and not for describing a particular order of the objects. For example, the first UE and the second UE, etc. are for distinguishing different UEs, not for describing a specific order of the UEs.
In the present embodiments, words such as "exemplary" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "e.g.," an embodiment of the present invention is not necessarily to be construed as preferred or advantageous over other embodiments or designs. Rather, use of the word "exemplary" or "such as" is intended to present relevant concepts in a concrete fashion.
In the description of the embodiments of the present invention, "a plurality" means two or more unless otherwise specified. For example, a plurality of processing units refers to two or more processing units; the plurality of systems refers to two or more systems.
First, some concepts related to the uplink scheduling method and apparatus provided in the embodiment of the present invention are explained.
Sensing rate: it can be understood as the actual rate of uplink data transmission by the UE, and in the embodiment of the present invention, the perceived rate may include the perceived rate of a single user (i.e., a user corresponding to one UE) and the average perceived rate of the cell.
The perceived rate for an individual user is: and R = Data/T, where R is the perceived rate of the user, data is the amount of uplink Data transmitted by the UE corresponding to the user, and T is the time for transmitting the uplink Data by the UE.
The average perceived rate of the cell is:
Figure BDA0001880287400000051
wherein, R _ m is the average sensing rate of the cell, data _ m is the total amount of uplink Data transmitted by UEs corresponding to all users in the cell, UE _ num is the average number of activated users in the cell, and T _1 is the time for transmitting uplink Data by the UEs corresponding to all users in the cell.
The number of activated users: the user (or UE) in which data is cached in each Transmission Time Interval (TTI), that is, a user having data to be transmitted.
Average number of active users: for example, if a time period with a duration of T includes 3 TTIs, in the first TTI, there are 3 active users, in the second TTI, there are 2 active users, and in the third TTI, there is 1 active user, then the average number of active users in the time period is (3 +2+ 1)/T.
Based on the problems existing in the background art, the embodiments of the present invention provide an uplink scheduling method and apparatus, where a base station determines N first UEs from M UEs to be scheduled, where M is greater than or equal to N, M is a positive integer greater than or equal to 2, and N is a positive integer greater than or equal to 1; and the base station determines a first time period, and preferentially schedules the N first UEs in the first time period.
The uplink scheduling method and apparatus provided in the embodiments of the present invention may be applied to a wireless communication system, such as a Long Term Evolution (LTE) system or a system using a fifth generation mobile communication technology (which may be referred to as a 5G system or an NR system). As shown in fig. 1, which is a schematic structural diagram of an LTE system provided in an embodiment of the present invention, the LTE system includes a base station 10 and a UE 11, and after the base station 10 establishes a connection with the UE 11 (that is, the UE 11 accesses a network), the base station 10 and the UE 11 may communicate with each other to implement downlink data transmission or uplink data transmission. Specifically, when the UE 11 needs to transmit uplink data, the UE 11 first sends an uplink scheduling request (scheduling request) to the base station 10 to notify the base station 10 that the UE 11 has uplink data to be transmitted, then the base station 10 sends an uplink scheduling grant to the UE 11, and further the UE 11 carries the data volume of the data to be transmitted in a buffer status report and sends the data volume to the base station 10, so that the base station 10 schedules a plurality of UEs that need to transmit data by using a certain scheduling method.
The base station provided in the embodiment of the present invention may be a commonly used base station, an evolved node base station (eNB), a next generation base station (gNB) in a 5G system, a new radio base station (new radio eNB), a macro base station, a micro base station, a high frequency base station, or a Transmission and Reception Point (TRP). For example, the embodiment of the present invention takes a commonly used base station as an example, and introduces a hardware structure of the base station. The following describes each component of the base station provided in the embodiment of the present invention with reference to fig. 2. As shown in fig. 2, a base station provided in the embodiment of the present invention may include: parts 20 and 21. The 20 part is mainly used for receiving and transmitting radio frequency signals and converting the radio frequency signals and baseband signals; the 21 part is mainly used for baseband processing, base station control and the like. The 20 portion may be generally referred to as a transceiver unit, transceiver, transceiving circuitry, transceiver, or the like. Part 21 is typically the control center of the base station and may be generally referred to as a processing unit.
The transceiver unit of part 20, which may also be referred to as a transceiver, or a transceiver, etc., includes an antenna and a radio frequency unit, or only includes a radio frequency unit or a portion thereof, where the radio frequency unit is mainly used for radio frequency processing. Optionally, a device used for implementing the receiving function in the part 20 may be regarded as a receiving unit, and a device used for implementing the sending function may be regarded as a sending unit, that is, the part 20 includes the receiving unit and the sending unit. A receiving unit may also be referred to as a receiver, a receiving circuit, or the like, and a transmitting unit may be referred to as a transmitter, a transmitting circuit, or the like.
Portion 21 may comprise one or more boards or chips, each of which may comprise one or more processors and one or more memories, the processors for reading and executing programs in the memories to implement baseband processing functions and control of the base stations. If a plurality of single boards exist, the single boards can be interconnected to increase the processing capacity. As an alternative implementation, multiple boards may share one or more processors, or multiple boards may share one or more memories. The memory and the processor may be integrated together or may be provided separately. In some embodiments, the 20 and 21 sections may be integrated or may be separate. In addition, all functions in the part 21 may be integrated in one chip, or part of the functions may be integrated in one chip to implement another part of the functions may be integrated in one or more other chips to implement, which is not limited in this embodiment of the present invention.
As shown in fig. 3, an embodiment of the present invention provides an uplink scheduling method, which may include S101 to S103:
s101, the base station determines N first UEs from M UEs to be scheduled.
Wherein M is more than or equal to N, M is a positive integer more than or equal to 2, and N is a positive integer more than or equal to 1.
In the embodiment of the present invention, the M UEs to be scheduled refer to M UEs that have data transmission requirements, that is, the M UEs have already sent uplink scheduling requests to the base station, and after the M UEs to be scheduled send uplink scheduling requests to the base station, the base station selects N UEs (hereinafter, collectively referred to as N first UEs) from the M UEs to be scheduled, and then schedules the N first UEs and the M-N UEs.
Optionally, with reference to fig. 3, as shown in fig. 4, the foregoing S101 may specifically be implemented by S1011 to S1013:
s1011, the base station determines the current maximum throughput of the cell.
Specifically, the base station may determine the current maximum throughput of the cell using S1011a or S1011b as follows:
and S1011a, the base station determines the current maximum throughput of the cell according to the throughput of the cell in the historical statistical period and the average resource utilization rate in the historical statistical period.
In the embodiment of the present invention, the current maximum throughput of the cell is a ratio of the throughput of the cell in the historical statistics period to an average resource utilization rate in the historical statistics period, that is, the current maximum throughput of the cell is determined by using the following formula (1):
Figure BDA0001880287400000061
wherein, thick _ n is the current maximum throughput of the cell, thick _ h is the throughput of the cell in the historical statistical period, and PRB _ rate is the average resource utilization rate in the historical statistical period.
It should be noted that the duration of the historical statistics period may be determined according to an actual situation, the duration of the historical statistics period is not limited in the embodiment of the present invention, and the RB _ rate is an average resource utilization rate in the historical statistics period.
S1011b, the base station according to one or more of the following factors: the frequency spectrum efficiency of M UE to be scheduled, the current bandwidth of the cell, the ratio of uplink sub-frames to downlink sub-frames and the current maximum throughput of the cell are determined.
In one implementation, if the duplex mode of the cell in which the M UEs to be scheduled are located is a Frequency Division Duplex (FDD) mode, the following formula (2) may be used to determine the current maximum throughput of the cell:
Figure BDA0001880287400000062
where T _ max is the current maximum throughput of the cell, SE i For the spectral efficiency of the ith UE of the M UEs to be scheduled,
Figure BDA0001880287400000063
is the sum of the spectral efficiencies of the M UEs to be scheduled, and RE _ num is the number of resource elements RE corresponding to the current bandwidth of the cell.
In the embodiment of the present invention, a Modulation and Coding Scheme (MCS) is configured on a UE, and specifically, the MCS is embodied in a form of an MCS table, the MCS table of a UE includes a mapping relationship between an index value of the MCS and a signal to interference plus noise ratio (SINR), a Spectrum Efficiency (SE) of the UE, and the like, and the number of REs corresponding to a current bandwidth may be calculated according to the current bandwidth of a cell.
Illustratively, the MCS table shown in table 1 below is an example of an MCS table of a certain UE.
TABLE 1
MCS index SINR SE
0 -6.54 0.2
1 -5.43 0.25
2 -4.53 0.31
3 -3.43 0.41
4 -2.36 0.5
5 -1.63 0.62
6 -0.87 0.73
7 0.06 0.86
8 0.85 0.98
9 1.81 1.11
10 2.59 1.23
Table 1 is an example of only a part of the content in the MCS table of one UE, and the content in the MCS table may be different for different UEs, not for the entire content of the MCS table.
In combination with the above equation (2), the current maximum throughput of the cell can be determined according to the SE in the MCS table of all UEs with data transmission requirements in the cell (i.e. the above M UEs to be scheduled) and the current bandwidth of the cell.
In another implementation, when the duplex mode of the cell in which the M UEs to be scheduled are located is a Time Division Duplex (TDD) mode, the following formula (3) may be used to determine the current maximum throughput of the cell:
Figure BDA0001880287400000071
where T _ max is the current maximum throughput of the cell, SE i The spectrum efficiency of the ith UE in the M UEs to be scheduled is obtained, RE _ num is the number of REs corresponding to the current bandwidth of the cell, and subframe _ r is the uplink and downlink subframe ratio.
Optionally, with reference to the foregoing S1011a and S1011b, in an actual application process, the current maximum throughput of the cell obtained in the foregoing S1011a and S1011b may be corrected, so that the current maximum throughput is closer to an actual value, specifically, an existing correction method may be used for correction, and an embodiment of the present invention is not limited.
S1012, the base station determines the number N of the first UE according to the current maximum throughput of the cell and the target rate of the cell.
In the embodiment of the present invention, the base station may determine, according to the current maximum throughput of the cell, the number of first UEs capable of reaching the cell target rate, and specifically, a ratio of the current maximum throughput of the cell to the cell target rate is the number of the first UEs.
Optionally, the target rate of the cell may be an expected maximum rate at which the cell currently processes a certain service, for example, the service may be a web browsing service, a text transmission service, a picture transmission service, or a video transmission service; the target rate of the cell may also be an average rate expected to be achieved by the cell, and the average rate may be an average of expected maximum rates of various services handled by the cell; the target rate of the cell may be other rates that meet the actual usage requirement, and the embodiment of the present invention is not particularly limited.
S1013, the base station determines N first UEs from the M UEs to be scheduled according to the data volume to be transmitted of the M UEs to be scheduled and/or the time for the M UEs to be scheduled to respectively send data transmission requests.
Optionally, in the embodiment of the present invention, the method for the base station to determine N first UEs from M UEs to be scheduled may specifically include any one of A1 to A3:
a1, a base station determines N first UE from M UE to be scheduled according to data quantity transmitted by the M UE to be scheduled respectively.
In the embodiment of the invention, the base station sequences the data volume to be transmitted of the M pieces of UE to be scheduled, and determines the first N pieces of UE with the least data volume as the first UE, namely the base station preferentially selects the UE with the less data volume to be transmitted.
And A2, the base station determines N first UEs from the M UEs to be scheduled according to the time when the M UEs to be scheduled respectively send data transmission requests.
In the embodiment of the invention, the base station determines the first N UEs which send the data transmission requests earliest as the first UE according to the sequence of the time when the M UEs to be scheduled send the data transmission requests, namely the base station preferentially selects the UE which sends the data transmission request earlier.
And A3, the base station determines N first UEs from the M UEs to be scheduled according to the data volume transmitted by the M UEs to be scheduled respectively and the time for sending data transmission requests by the M UEs to be scheduled respectively.
In an implementation manner, the base station may determine the N first UEs from the M UEs to be scheduled according to a comprehensive sequence of a sequence of data amount transmitted by each UE and a sequence of time for the UE to send the data transmission request.
For example, assuming that M is 10 and n is 5, that is, 5 UEs are determined as the first UE from 10 UEs to be scheduled, as shown in table 1 below, an example of ordering of data volumes of the 10 UEs from small to large and sequencing of data transmission request time is given.
TABLE 2
Figure BDA0001880287400000081
Optionally, in this embodiment of the present invention, the comprehensive ranking of the UE may be a sum of a ranking index of the amount of data to be transmitted by the UE and a ranking index of the time when the UE sends the data transmission request, for example, in table 2, the comprehensive ranking of UE 1 is 4 (i.e., 1+ 3), and specifically, the comprehensive ranking of the 10 UEs to be scheduled is shown in table 3 below.
TABLE 3
UE Data volume ordering Data storage mediumTime ordering of input requests Comprehensive sorting
UE
1 1 3 4
UE 2 2 4 6
UE 3 3 1 4
UE 4 4 5 9
UE 5 5 2 7
UE 6 6 6 12
UE 7 7 9 16
UE 8 8 7 15
UE 9 9 10 19
UE 10 10 8 18
In table 3, in the comprehensive ranking of 10 UEs to be scheduled, the first 5 UEs in the comprehensive ranking are determined as the first UE.
It should be noted that, in the embodiment of the present invention, the base station may further determine the comprehensive ranking of the UEs in a weighting manner of the ordering of the data amount transmitted by the UE and the ordering of the time when the UE sends the data transmission request, for example, assign a larger weight to the ordering of the data amount transmitted by the UE, assign a smaller weight to the ordering of the time when the UE sends the data transmission request, or assign a smaller weight to the ordering of the data amount transmitted by the UE, and assign a larger weight to the ordering of the time when the UE sends the data transmission request, which is not specifically limited in the embodiment of the present invention.
With reference to S1012 and S1013, it can be understood that the base station needs to determine that N first UEs are placed into one scheduling set from M UEs to be scheduled, specifically, in S1012, the base station first determines the number N of UEs that can be accommodated in the scheduling set, and then selects N first UEs from the M UEs to be scheduled to be placed into the scheduling set.
S102, the base station determines a first time period.
In this embodiment of the present invention, the first time period may be configured in advance on the base station, that is, the first time period is fixed. Or, the base station may determine a first time period according to the data amount to be transmitted by the N first UEs and the cell target rate, specifically, the base station determines time for each of the N first UEs to transmit data, and takes a sum of the time for each of the N first UEs to transmit data as the first time period, that is:
Figure BDA0001880287400000091
wherein it is present>
Figure BDA0001880287400000092
T _ N is a first time period, T i Time of data transmission for ith first UE of N first UEs i The V _ rate is the target rate of the cell, which is the amount of data to be transmitted by the ith first UE.
In summary, it can be understood that the first time period is a time period that can ensure that the data to be transmitted by the N first UEs is completely transmitted, in this embodiment of the present invention, the first time period that meets the actual requirement may also be determined by using other methods, and the embodiment of the present invention is not limited specifically.
S103, the base station performs priority scheduling on the N first UEs in the first time period.
In the embodiment of the present invention, a base station performs priority scheduling on N first UEs among the M UEs to be scheduled in a first time period, that is, the base station sets a higher scheduling priority for the N first UEs than the M-N UEs to be scheduled, and in a process of scheduling the M UEs to be scheduled by the base station, first, it is ensured that the N first UEs are scheduled preferentially in the first time period, that is, the base station preferentially allocates resources to the N first UEs, so that the N first UEs complete data transmission in the first time period, and then the base station reallocates resources for the remaining M-N UEs to be scheduled to transmit data.
Assuming that the total time for transmitting data by the M UEs to be scheduled is t, when the base station schedules the M UEs to be scheduled, the base station may first ensure that the N first UEs complete data transmission preferentially in the first time period, so that the N first UEs can only transmit data in the first time period, and therefore, according to the transmitted data amount and the transmission time (i.e., the first time period) of the N first UEs, the sensing rate of the user corresponding to the N first UEs is improved, and the user experience is improved.
In the embodiment of the present invention, a change of the user perception rate is analyzed through a Cumulative Distribution Function (CDF) of the user perception rate, as shown in fig. 5, a curve S1 in fig. 5 shows a cumulative distribution of the user perception rate under the condition that the existing uplink scheduling method is adopted (i.e., M users to be scheduled are scheduled at the same time), and a curve S2 shows a cumulative distribution of the user perception rate under the condition that the uplink scheduling method provided by the embodiment of the present invention is adopted.
With reference to fig. 5, table 4 shows user perceived rates when CDFs are different values and gain conditions of the user perceived rates in the uplink scheduling method provided in the embodiment of the present invention, compared with the prior art.
TABLE 4
Figure BDA0001880287400000101
In table 4, the unit of the sensing rate of the user is kilobits/second (i.e., kbps), and as can be seen from table 4, when the CDF value is in the range of 0.3 to 0.4, in the uplink scheduling method provided in the embodiment of the present invention, the sensing rate of a part of users is higher than the sensing rate of the users in the prior art, specifically, when the CDF value is 0.4, and the sensing rate of the user is 249.518, the number of UEs corresponding to the sensing rate accounts for 0.4, and from the gain of the sensing rate, the CDF value is in the range of 0.3 to 0.4, and the sensing rate of the part of users has a positive gain value.
Further, in the embodiment of the present invention, since the N first UEs have completed data transmission in the first time period, it is known that the average number of active users is reduced in comparison with the prior art in the whole data transmission time t, so that the average sensing rate of the cell can be improved according to the calculation formula of the average sensing rate of the cell in the embodiment.
Illustratively, table 5 below is an example of a simulation result.
TABLE 5
Average throughput of cell Time of data transmission Average number of active users Average perceived rate of cell
S1 1077(Mb) 20(s) 48 1121Kbps
S2 1036(Mb) 20(s) 42 1233Kbps
With reference to table 5, by using the uplink scheduling method provided in the embodiment of the present invention, the average number of active users is reduced, the average sensing rate of the cell is increased, and the gain of the average sensing rate of the cell is 10%.
Optionally, the method for the base station to perform priority scheduling on the N first UEs may be flexibly selected, and the embodiment of the present invention is not limited in particular.
For example, the base station may schedule the N first UEs in several ways: in a first time period, N first UEs transmit data simultaneously; or part of the N first UEs simultaneously transmit data; or the N first UEs sequentially perform data transmission, where the order of data transmission performed by the N first UEs may not be limited.
According to the uplink scheduling method provided by the embodiment of the invention, the base station can determine N first UEs from M UEs to be scheduled, determine the first time period, and perform priority scheduling on the N first UEs in the first time period, so that the perception rate of users corresponding to the N first UEs is improved, and the average perception rate of a cell is also improved, so that the uplink scheduling method provided by the embodiment of the invention can improve the perception rate of users to a certain extent and improve the user experience.
The above description mainly introduces the solution provided by the embodiments of the present invention from the perspective of the base station. It will be appreciated that each network element, e.g. base station, for performing the above functions, comprises corresponding hardware structures and/or software modules for performing the respective functions. Those of skill in the art will readily appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as hardware or combinations of hardware and computer software. Whether a function is performed as hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
The embodiments of the present invention may perform the division of the function modules on the base station according to the above method examples, for example, each function module may be divided corresponding to each function, or two or more functions may be integrated into one processing module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. It should be noted that, the division of the modules in the embodiment of the present invention is schematic, and is only a logic function division, and there may be another division manner in actual implementation.
Fig. 6 shows a schematic diagram of a possible structure of the base station in the above embodiment, in the case of dividing each functional module according to each function. As shown in fig. 6, the base station may include a first determining module 30, a second determining module 31, and a scheduling module 32. The first determining module 30 is configured to support the base station to perform S101 (including S1011-S1013, where S1011 includes S1011a or S1011 b) in the foregoing method embodiment; the second determining module 31 is configured to support the base station to perform S102 in the foregoing method embodiment; the scheduling module 32 is configured to support the base station to perform S103 in the foregoing method embodiment. All relevant contents of the steps related to the method embodiment may be referred to the functional description of the corresponding functional module, and are not described herein again.
In the case of integrated units, fig. 7 shows a possible structural diagram of the base station involved in the above-described embodiment. As shown in fig. 7, the base station may include: a processing module 40 and a communication module 41. The processing module 40 may be configured to control and manage the operation of the base station, for example, the processing module 40 may be configured to support the base station to perform S101 to S103 in the foregoing method embodiment, where S101 includes S1011 to S1013, and S1011 includes S1011a or S1011b. The communication module 41 may be used to support communication of the base station with other network entities; optionally, as shown in fig. 7, the base station may further include a storage module 42 for storing program codes and data of the terminal. The communication module 41 is illustratively a radio frequency transceiver circuit for up-mixing a signal to be transmitted when transmitting and down-mixing a received signal when receiving.
The processing module 40 may be a processor or a controller (e.g., the processor in the portion 21 shown in fig. 2), such as a Central Processing Unit (CPU), a general-purpose processor, a Digital Signal Processor (DSP), an application-specific integrated circuit (ASIC), a Field Programmable Gate Array (FPGA), or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. Which may implement or execute the various illustrative logical blocks, modules, and circuits described in connection with the embodiment disclosure. The processor described above may also be a combination of computing functions, e.g., comprising one or more microprocessors in combination, a DSP and a microprocessor in combination, or the like. The communication module 41 may be a transceiver, a transceiver circuit, a communication interface, or the like (for example, may be the radio frequency unit in the section 20 shown in fig. 2). The storage module 42 may be a memory (e.g., may be the memory described above in section 21 of fig. 2).
When the processing module 40 is a processor, the communication module 41 is a transceiver, and the storage module 42 is a memory, the processor, the transceiver, and the memory may be connected by a bus. The bus may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc.
When performing signal transmission, the processing module 40 and the communication module 41 together implement signal transmission. Specifically, the processing module 40 controls or calls the communication module 41 to transmit. The processing module 40 is a determiner and a controller of the transmission behavior, and the communication module 41 is an executor of the transmission behavior.
In the above embodiments, all or part of the implementation may be realized by software, hardware, firmware, or any combination thereof. When implemented using a software program, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the flow or functions according to embodiments of the invention, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored on a computer readable storage medium or transmitted from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by wire (e.g., coaxial cable, fiber optic, digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device including one or more available media integrated servers, data centers, and the like. The usable medium may be a magnetic medium (e.g., floppy disk, magnetic tape), an optical medium (e.g., digital Video Disk (DVD)), or a semiconductor medium (e.g., solid State Drive (SSD)), among others.
Through the above description of the embodiments, it is clear to those skilled in the art that, for convenience and simplicity of description, the foregoing division of the functional modules is merely used as an example, and in practical applications, the above function distribution may be completed by different functional modules according to needs, that is, the internal structure of the device may be divided into different functional modules to complete all or part of the above described functions. For the specific working processes of the system, the apparatus and the unit described above, reference may be made to the corresponding processes in the foregoing method embodiments, and details are not described here again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules or units is only one logical division, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one position, or may be distributed on multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) or a processor to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: flash memory, removable hard drive, read only memory, random access memory, magnetic or optical disk, and the like.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the appended claims.

Claims (15)

1. An uplink scheduling method, comprising:
the base station determines the current maximum throughput of the cell;
the base station determines the number N of the first UE according to the current maximum throughput and the target rate of the cell;
the base station determines the N first UEs from the M UEs to be scheduled according to the data volume to be transmitted of the M UEs to be scheduled and/or the time for the M UEs to be scheduled to respectively send data transmission requests; wherein M is more than or equal to N, M is a positive integer more than or equal to 2, and N is a positive integer more than or equal to 1;
the base station determines a first time period;
and the base station performs priority scheduling on the N first UEs in the first time period.
2. The method of claim 1, wherein the base station determines a current maximum throughput of the cell, and wherein the determining comprises:
the base station determines the current maximum throughput of the cell according to the throughput of the cell in a historical statistical period and the average resource utilization rate in the historical statistical period, wherein the current maximum throughput of the cell is the ratio of the throughput of the cell in the historical statistical period to the average resource utilization rate in the historical statistical period.
3. The method of claim 1, wherein the base station determines a current maximum throughput of the cell, comprising:
the base station may be based on one or more of the following factors: and determining the current maximum throughput of the cell according to the spectrum efficiency of the M UEs to be scheduled, the current bandwidth of the cell and the ratio of uplink subframes to downlink subframes.
4. The method of claim 3,
the duplex mode of the cell is a Frequency Division Duplex (FDD) mode, and the current maximum throughput of the cell is determined by adopting the following formula:
Figure FDA0003861933780000011
wherein T _ max is the current maximum throughput, SE, of the cell i For the spectral efficiency of the ith UE in the M UEs to be scheduled, RE _ num is the number of resource elements RE corresponding to the current bandwidth of the cell;
the duplex mode of the cell is a Time Division Duplex (TDD) mode, and the current maximum throughput of the cell is determined by adopting the following formula:
Figure FDA0003861933780000012
wherein T _ max is the current maximum throughput, SE, of the cell i The resource allocation method includes that the resource allocation is the spectrum efficiency of the ith UE in the M UEs to be scheduled, RE _ num is the number of REs corresponding to the current bandwidth of the cell, and subframe _ r is the uplink and downlink subframe ratio.
5. The method according to any one of claims 1 to 4,
the first time period is pre-configured on the base station.
6. The method according to any of claims 1 to 4, wherein the base station determines the first time period, comprising:
and the base station determines the first time period according to the data volume to be transmitted by the N first UEs and the cell target rate.
7. A base station comprising a first determining module, a second determining module, and a scheduling module;
the first determining module is specifically configured to determine a current maximum throughput of a cell; determining the number N of the first UE according to the current maximum throughput and the target rate of the cell; determining the N first UEs from the M UEs to be scheduled according to the data volume to be transmitted of the M UEs to be scheduled and/or the time for sending data transmission requests by the M UEs to be scheduled respectively; wherein M is more than or equal to N, M is a positive integer more than or equal to 2, and N is a positive integer more than or equal to 1;
the second determining module is used for determining a first time period;
the scheduling module is configured to perform priority scheduling on the N first UEs in the first time period.
8. The base station of claim 7,
the first determining module is specifically configured to determine the current maximum throughput of the cell according to the throughput of the cell in the historical statistics period and the average resource utilization rate in the historical statistics period, where the current maximum throughput of the cell is a ratio of the throughput of the cell in the historical statistics period to the average resource utilization rate in the historical statistics period.
9. The base station of claim 7,
the first determining module is specifically configured to determine, according to one or more of the following factors: and determining the current maximum throughput of the cell according to the spectrum efficiency of the M UEs to be scheduled, the current bandwidth of the cell and the ratio of uplink subframes to downlink subframes.
10. The base station of claim 9,
the duplex mode of the cell is a Frequency Division Duplex (FDD) mode, and the first determining module is specifically configured to determine the current maximum throughput of the cell by using the following formula:
Figure FDA0003861933780000021
wherein T _ max is the current maximum throughput, SE, of the cell i For the spectral efficiency of the ith UE in the M UEs to be scheduled, RE _ num is the number of Resource Elements (REs) corresponding to the current bandwidth of the cell;
the duplex mode of the cell is a Time Division Duplex (TDD) mode, and the first determining module is specifically configured to determine the current maximum throughput of the cell by using the following formula:
Figure FDA0003861933780000022
wherein T _ max is the current maximum throughput, SE, of the cell i And RE _ num is the number of REs corresponding to the current bandwidth of the cell, and subframe _ r is the uplink and downlink subframe ratio, wherein the RE _ num is the spectral efficiency of the ith UE in the M UEs to be scheduled.
11. Base station according to any of claims 7 to 10,
the first time period is pre-configured on the base station.
12. Base station according to any of claims 7 to 10,
the second determining module is specifically configured to determine the first time period according to the data amount to be transmitted by the N first UEs and the cell target rate.
13. A base station comprising a processor and a memory coupled to the processor;
the memory is configured to store computer instructions, and when the base station runs, the processor executes the computer instructions stored in the memory, so as to enable the base station to perform the uplink scheduling method according to any one of claims 1 to 6.
14. A computer-readable storage medium, comprising computer instructions, which when executed on a computer, cause a base station to perform the uplink scheduling method according to any one of claims 1 to 6.
15. A computer program product comprising computer instructions for causing a base station to perform the uplink scheduling method according to any one of claims 1 to 6 when the computer program product is run on a computer.
CN201811419706.6A 2018-11-26 2018-11-26 Uplink scheduling method and device Active CN111224761B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811419706.6A CN111224761B (en) 2018-11-26 2018-11-26 Uplink scheduling method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811419706.6A CN111224761B (en) 2018-11-26 2018-11-26 Uplink scheduling method and device

Publications (2)

Publication Number Publication Date
CN111224761A CN111224761A (en) 2020-06-02
CN111224761B true CN111224761B (en) 2023-03-28

Family

ID=70827095

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811419706.6A Active CN111224761B (en) 2018-11-26 2018-11-26 Uplink scheduling method and device

Country Status (1)

Country Link
CN (1) CN111224761B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113810941B (en) * 2020-06-17 2023-09-19 中国移动通信集团设计院有限公司 PRB utilization rate calculation method and device

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102550112A (en) * 2009-10-15 2012-07-04 高通股份有限公司 Methods and apparatus for transport block size determination applying an adjustment factor
CN106507701A (en) * 2015-06-01 2017-03-15 华为技术有限公司 A kind of resource regulating method and device
CN108271048A (en) * 2018-02-09 2018-07-10 北京邮电大学 A kind of code check self-adapting adjusting apparatus and method for taking into account handling capacity and video buffer

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2262341B1 (en) * 2006-03-07 2016-11-02 Panasonic Corporation Overhead reduction of uplink control signaling in a mobile communication system
CN100464608C (en) * 2006-07-07 2009-02-25 华为技术有限公司 Method for confirming scheduling priority and scheduling method
EP2120477A4 (en) * 2007-03-01 2014-01-01 Ntt Docomo Inc Base station device, user device, and communication control method
CA2679220A1 (en) * 2007-03-01 2008-09-04 Ntt Docomo, Inc. Base station apparatus and communication control method
CN102547852A (en) * 2010-12-14 2012-07-04 中国移动通信集团广东有限公司 Packet scheduling method and device
US8817690B2 (en) * 2011-04-04 2014-08-26 Qualcomm Incorporated Method and apparatus for scheduling network traffic in the presence of relays
US8693489B2 (en) * 2011-04-28 2014-04-08 Alcatel Lucent Hierarchical profiled scheduling and shaping
CN103929268A (en) * 2013-01-15 2014-07-16 索尼公司 Device, method, base station and system for determining uplink and downlink subframe allocation
EP2993844B1 (en) * 2013-05-22 2018-10-24 Huawei Technologies Co., Ltd. Priority scheduling method, user equipment and base station
CN103458520B (en) * 2013-08-23 2016-03-30 京信通信系统(中国)有限公司 A kind of distribution method of uplink frequency domain resources and device
EP3138341B1 (en) * 2014-04-30 2018-10-03 Telefonaktiebolaget LM Ericsson (publ) Method and radio network node for scheduling of wireless devices in a cellular network
CN105338634B (en) * 2014-08-04 2019-02-12 华为技术有限公司 Resource regulating method, base station and user equipment
CN106488577B (en) * 2016-09-26 2019-11-26 华为技术有限公司 Transmit the method and user equipment of information
CN108271182B (en) * 2016-12-30 2021-05-07 华为技术服务有限公司 Method, device and system for determining number of CPE (customer premises equipment)

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102550112A (en) * 2009-10-15 2012-07-04 高通股份有限公司 Methods and apparatus for transport block size determination applying an adjustment factor
CN106507701A (en) * 2015-06-01 2017-03-15 华为技术有限公司 A kind of resource regulating method and device
CN108271048A (en) * 2018-02-09 2018-07-10 北京邮电大学 A kind of code check self-adapting adjusting apparatus and method for taking into account handling capacity and video buffer

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
LTE系统基于QoS的上行调度算法研究;解珊珊;《中国优秀硕士学位论文全文数据库 (信息科技辑) 》;全文 *
Nokia等.R2-073055 "CQI Trigger Mechanism".《3GPP tsg_ran\WG2_RL2》.2007, *

Also Published As

Publication number Publication date
CN111224761A (en) 2020-06-02

Similar Documents

Publication Publication Date Title
KR101539214B1 (en) Method of scheduling and admission control for guaranteed bit rate and/or maximum bit rate services
US11363581B2 (en) Resource allocation determination method, resource allocation indication method, user equipment and network device
KR102382913B1 (en) Method and Apparatus for Wireless Resource Scheduling with Guaranteed QoS in Mobile Communication System
US9814061B2 (en) Data scheduling method and device
WO2008148358A1 (en) System and method for dynamic resource allocation in wireless communications networks
CN107615846B (en) Method, device and system for resource allocation and base station
US10368361B2 (en) Adaptive communication resource allocation in a wireless network
CN108029107A (en) Shorten uplink data transmission method, device and the communication system of time delay
US10448418B2 (en) Decreasing free-riding data traffic in uplink scheduling
KR20200064140A (en) Uplink data packet resource allocation method and user terminal
CN109963308B (en) Resource scheduling method and device in wireless communication system
CN111224761B (en) Uplink scheduling method and device
KR20150002316A (en) Wireless communication apparatus and method of operating the same
WO2013008167A1 (en) Packet scheduling in a cellular communication network for the purpose of device -to -device communications
CN110612684B (en) Response feedback method, terminal and network equipment
CN104284435A (en) PDCCH dispatching method and equipment
CN103858472A (en) System, device and method for coordinating load balance
US11438920B2 (en) Downlink scheduling of terminal devices
CN111602457B (en) Information transmission method, communication device, and storage medium
CN108370558A (en) Information source determines method, resource allocation methods and device
WO2018157719A1 (en) Network node, user device, and method for wireless communication system
CN113170437A (en) Method and base station for multi-user multiple-input multiple-output
CN109996335A (en) A kind of transmission time processing method and relevant device
KR101713474B1 (en) Method and device for communicating data
CN111699735B (en) Information indication method and related 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