CN110933707A - LTE uplink scheduling method and device - Google Patents

LTE uplink scheduling method and device Download PDF

Info

Publication number
CN110933707A
CN110933707A CN201911287296.9A CN201911287296A CN110933707A CN 110933707 A CN110933707 A CN 110933707A CN 201911287296 A CN201911287296 A CN 201911287296A CN 110933707 A CN110933707 A CN 110933707A
Authority
CN
China
Prior art keywords
ith
real
jth
time service
delay
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201911287296.9A
Other languages
Chinese (zh)
Other versions
CN110933707B (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.)
State Grid Corp of China SGCC
State Grid Shaanxi Electric Power Co Ltd
Information and Telecommunication Branch of State Grid Shaanxi Electric Power Co Ltd
Original Assignee
State Grid Corp of China SGCC
State Grid Shaanxi Electric Power Co Ltd
Information and Telecommunication Branch of State Grid Shaanxi Electric Power 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 State Grid Corp of China SGCC, State Grid Shaanxi Electric Power Co Ltd, Information and Telecommunication Branch of State Grid Shaanxi Electric Power Co Ltd filed Critical State Grid Corp of China SGCC
Priority to CN201911287296.9A priority Critical patent/CN110933707B/en
Publication of CN110933707A publication Critical patent/CN110933707A/en
Application granted granted Critical
Publication of CN110933707B publication Critical patent/CN110933707B/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
    • H04W72/1268—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows of uplink data flows
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0278—Traffic management, e.g. flow control or congestion control using buffer status reports
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/10—Flow control between communication endpoints
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/52—Allocation or scheduling criteria for wireless resources based on load
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

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

Abstract

The invention discloses a method and a device for scheduling an LTE uplink, and belongs to the technical field of communication. The method of the invention comprises the following steps: acquiring the flow generated when the ith UE sends data through the jth RC, wherein the flow is obtained from the buffer area state of the real-time service, i is more than or equal to 1, and j is more than or equal to 1; and executing scheduling operation according to the flow and a target integer linear programming model, wherein the target integer linear programming model comprises a delay constraint condition of the real-time service. The invention solves the problem that the related scheduling method can not be suitable for the real-time service, and because the base station can execute the scheduling operation according to the delay constraint condition of the real-time service, the real-time service packet can be transmitted within the delay time limit, so the invention is suitable for the real-time service and is used for LTE uplink scheduling.

Description

LTE uplink scheduling method and device
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method and an apparatus for LTE uplink scheduling.
Background
Long Term Evolution (LTE) is the 4th generation mobile communication technology (4G) wireless technology standard. LTE employs a shared channel mechanism, and in order to more efficiently utilize and allocate shared resources, scheduling needs to be performed between different User Equipments (UEs). The scheduling function is performed by a scheduler in a Media Access Control (MAC) layer of the base station side.
Currently, most of the research on LTE scheduling focuses on downlink scheduling, while uplink scheduling is relatively less studied. To achieve uplink scheduling, a UE with higher channel quality is typically allocated Physical Resource Blocks (PRBs), even if the UE does not have enough data in its buffer to use the allocated PRBs. The MAC layer throughput is low since the buffer status is not taken into account.
In the LTE uplink scheduling method in the prior art, scheduling operation is executed based on an integer linear programming model, and the integer linear programming model takes the buffer state into consideration, so that the throughput of an MAC layer is higher; however, the current uplink scheduling method is not suitable for real-time services, has a poor scheduling effect for the real-time services, and cannot ensure that real-time service packets are transmitted within a delay period.
In summary, a new LTE uplink scheduling method and apparatus are needed.
Disclosure of Invention
The present invention is directed to a method and an apparatus for LTE uplink scheduling, so as to solve one or more of the above technical problems. The LTE uplink scheduling method and the LTE uplink scheduling device can solve the problem that the existing LTE uplink scheduling method is not suitable for real-time services. In the invention, the scheduling operation can be executed according to the delay constraint condition of the real-time service, so that the real-time service packet can be transmitted within the delay time limit, and the method is suitable for the real-time service and is used for LTE uplink scheduling.
In order to achieve the purpose, the invention adopts the following technical scheme:
the LTE uplink scheduling method comprises the following steps:
acquiring the flow generated when the ith user equipment transmits data through the jth resource block, wherein the flow is obtained from the buffer area state of the real-time service; wherein i is more than or equal to 1, j is more than or equal to 1, and each resource block comprises a plurality of continuous physical resource blocks;
and executing scheduling operation according to the flow and a target integer linear programming model, wherein the target integer linear programming model comprises a delay constraint condition of the real-time service.
A further improvement of the present invention is that the acquiring traffic generated when the ith user equipment transmits data through the jth resource block includes:
obtaining a buffer area state of the real-time service, wherein the buffer area state is used for indicating the capacity of the buffer area;
acquiring the maximum data volume, wherein the maximum data volume is the maximum data volume of data transmitted by the ith user equipment through the jth resource block;
and taking the smaller value of the maximum data volume and the buffer area state as the flow generated when the ith UE sends data through the jth RC.
In a further improvement of the present invention, the target integer linear programming model further comprises: an objective function, a first constraint and a second constraint;
the objective function is:
Figure BDA0002318373660000021
the first constraint condition is as follows:
Figure BDA0002318373660000022
the second constraint condition is as follows:
Figure BDA0002318373660000023
the delay constraint is:
Figure BDA0002318373660000024
in the formula, αi,jFor binary variable, α when the ith user equipment is allocated the jth resource blocki,j1, when the ith UE is not assigned the jth RC αi,jIs 0; w is ai,jThe traffic generated when the ith UE sends data through the jth RC is generated;
δidelay of header packet for ith user equipment when ith user equipment is currently transmittingWhen the inter-interval is scheduled,
Figure BDA0002318373660000031
when the ith UE is not scheduled in the current transmission time interval,
Figure BDA0002318373660000032
Dthand t is the delay deadline of the real-time service and the length of the current transmission time interval.
A further improvement of the present invention is that the obtaining of the buffer status of the real-time service includes:
obtaining a buffer status report from the ith user equipment;
extracting the buffer status from the buffer status report.
A further improvement of the invention is that the buffer status is the number of bytes of the buffer; the maximum data amount is the maximum byte number of data sent by the ith user equipment through the jth resource block.
The invention discloses an LTE uplink scheduling device, which comprises:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring the flow generated when the ith user equipment UE transmits data through the jth resource block RC, the flow is obtained by the buffer area state of a real-time service, i is more than or equal to 1, j is more than or equal to 1, and each RC comprises a plurality of continuous physical resource blocks PRB;
and the scheduling module is used for executing scheduling operation according to the flow and a target integer linear programming model, and the target integer linear programming model comprises a delay constraint condition of the real-time service.
In a further development of the invention, the acquisition module comprises:
a first obtaining submodule, configured to obtain a buffer status of the real-time service, where the buffer status is used to indicate a capacity of the buffer;
a second obtaining submodule, configured to obtain a maximum data volume, where the maximum data volume is a maximum data volume of data sent by the ith UE through the jth RC;
and the processing submodule is used for taking the smaller value of the maximum data volume and the buffer area state as the flow generated when the ith UE sends data through the jth RC.
In a further development of the invention, the target integer linear programming model further comprises an objective function, a first constraint and a second constraint,
the objective function is:
Figure BDA0002318373660000041
the first constraint condition is as follows:
Figure BDA0002318373660000042
the second constraint condition is as follows:
Figure BDA0002318373660000043
the delay constraint is
Figure BDA0002318373660000044
Wherein, the αi,jIs a binary variable, said α being when said ith UE is assigned said jth RCi,j1, said α when said ith UE is not assigned said jth RCi,jIs 0, said wi,jThe flow generated when the ith UE sends data through the jth RC is deltaiA delay of a header HoL packet for the ith UE, when the ith UE is scheduled in a current transmission time interval, TTI,
Figure BDA0002318373660000045
when the ith UE is not scheduled in the current TTI,
Figure BDA0002318373660000046
said DthAnd the delay deadline of the real-time service is the t is the length of the current TTI.
In a further development of the invention, the first acquisition submodule is configured to:
obtaining a buffer status report from the ith UE;
extracting the buffer status from the buffer status report.
In a further improvement of the present invention, the buffer status is the number of bytes of the buffer, and the maximum data amount is the maximum number of bytes of data transmitted by the ith UE through the jth RC.
Compared with the prior art, the invention has the following beneficial effects:
in the LTE uplink scheduling method, a base station firstly acquires the flow generated when the ith UE sends data through the jth RC, and the flow is obtained by the buffer area state of real-time service. The base station executes scheduling operation according to the flow and the target integer linear programming model, the target integer linear programming model comprises delay constraint conditions of the real-time service, and the base station can execute the scheduling operation according to the delay constraint conditions of the real-time service, so that real-time service packets can be transmitted within a delay deadline and the method is suitable for the real-time service.
According to the LTE uplink scheduling method provided by the invention, a base station firstly acquires the flow generated when the ith UE sends data through the jth RC, and the flow is obtained from the buffer area state of real-time service. The base station executes scheduling operation according to the flow and the target integer linear programming model, the target integer linear programming model comprises delay constraint conditions of the real-time service, and the base station can execute the scheduling operation according to the delay constraint conditions of the real-time service, so that real-time service packets can be transmitted within a delay deadline and the method is suitable for the real-time service.
Specifically, when the existing method is used for uplink scheduling, for real-time traffic, if a packet is not transmitted within a delay time limit, the packet is discarded, which may reduce Quality of service (QoS). Aiming at the real-time service, the target integer linear programming model provided by the invention comprises the delay constraint condition of the real-time service, so that the packet can be transmitted within the delay time limit, and the QoS is improved.
The device of the invention can realize the method of the invention and can solve the problem that the existing LTE uplink scheduling method is not suitable for real-time service.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art are briefly introduced below; it is obvious that the drawings in the following description are some embodiments of the invention, and that for a person skilled in the art, other drawings can be derived from them without inventive effort.
FIG. 1 is a schematic diagram of an implementation environment in which embodiments of the invention are implemented;
fig. 2 is a schematic block diagram of a flow of an LTE uplink scheduling method according to an embodiment of the present invention;
fig. 3 is a schematic block diagram of a flow of another LTE uplink scheduling method according to an embodiment of the present invention;
fig. 4 is a schematic block diagram of a process for a base station to obtain a real-time service buffer status according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of an LTE uplink scheduling apparatus according to an embodiment of the present invention;
fig. 6 is a schematic structural diagram of an obtaining module according to an embodiment of the present invention;
fig. 7 is a schematic structural diagram of another LTE uplink scheduling apparatus according to an embodiment of the present invention;
with the above figures, certain embodiments of the invention have been illustrated and described in more detail below. The drawings and the description are not intended to limit the scope of the inventive concept in any way, but rather to illustrate it by those skilled in the art with reference to specific embodiments.
Detailed Description
In order to make the purpose, technical effect and technical solution of the embodiments of the present invention clearer, the following clearly and completely describes the technical solution of the embodiments of the present invention with reference to the drawings in the embodiments of the present invention; it is to be understood that the described embodiments are only some of the embodiments of the present invention. Other embodiments, which can be derived by one of ordinary skill in the art from the disclosed embodiments without inventive faculty, are intended to be within the scope of the invention.
Referring to fig. 1, fig. 1 is a schematic diagram of an implementation environment according to an embodiment of the present invention, the implementation environment including: a base station 01 and a plurality of UEs 02. In uplink scheduling, the UE02 sends a scheduling request to the base station 01, when the base station 01 receives the scheduling request of the UE02, the embodiment of the present invention is adopted to perform scheduling operation, and then, the UE02 sends uplink data through an allocated Resource block (RC).
Wherein each RC comprises a plurality of consecutive PRBs. The number of the UEs 02 and the number of the RCs are not limited in the embodiment of the present invention.
Referring to fig. 2, fig. 2 shows an LTE uplink scheduling method according to an embodiment of the present invention, where the scheduling method is used for a base station, and specifically includes the following steps:
and step 110, acquiring the flow generated when the ith UE sends data through the jth RC.
The flow is obtained from the buffer area state of the real-time service, i is more than or equal to 1, and j is more than or equal to 1.
And 120, executing scheduling operation according to the flow and a target integer linear programming model, wherein the target integer linear programming model comprises a delay constraint condition of the real-time service.
In summary, in the LTE uplink scheduling method provided in the embodiment of the present invention, the base station first obtains the traffic generated when the ith UE sends data through the jth RC, and the traffic is obtained from the buffer status of the real-time service. The base station executes scheduling operation according to the flow and the target integer linear programming model, the target integer linear programming model comprises delay constraint conditions of the real-time service, and the base station can execute the scheduling operation according to the delay constraint conditions of the real-time service, so that real-time service packets can be transmitted within a delay deadline and the method is suitable for the real-time service.
Referring to fig. 3 and fig. 4, fig. 3 shows another LTE uplink scheduling method provided in an embodiment of the present invention, where the method is used in a base station, and the method may include:
step 210, obtaining a buffer status of the real-time service, where the buffer status is used to indicate a capacity of the buffer.
In this embodiment, the real-time service is a service with a delay requirement, such as a voice service or a video service.
As shown in fig. 4, the acquiring, by the base station, the buffer status of the real-time service may include:
step 211, obtaining a buffer status report from the ith UE.
Wherein i is more than or equal to 1.
Step 212, extract the buffer status from the buffer status report.
Illustratively, the buffer status acquired by the base station may be the number of bytes of the buffer.
In addition, the buffer status may also be represented by other capacity measurement units, such as bits, which is not limited in this embodiment.
Step 220, obtaining the maximum data volume, where the maximum data volume is the maximum data volume of the ith UE sending data through the jth RC.
Wherein j is equal to or greater than 1, and the upper limits of i and j are not limited in this embodiment. In the present embodiment, each RC is composed of 6 consecutive PRBs.
Illustratively, the maximum data size obtained by the base station is the maximum number of bytes of data transmitted by the ith UE through the jth RC. The maximum data amount may be expressed by other units, which is not limited in this embodiment.
And step 230, taking the smaller value of the maximum data volume and the buffer area state as the flow generated when the ith UE sends data through the jth RC.
Let p bei,jMaximum number of bytes of data transmitted by jth RC for ith UE, biIs the byte number of the buffer area, the flow w generated when the ith UE sends data through the jth RCi,jCan be represented as wi,j＝min(pi,j,bi)，wi,jGet pi,jAnd biThe smaller of these.
wi,j＝min(pi,j,bi) Indicates the maximum number of bytes p even if the ith data is transmitted through the jth RCi,jNumber of bytes greater than buffer biThe ith UE also cannot transmit the ratio biMore data because the ith UE sends byte number biAfter the data(s), no more data needs to be transmitted in the current Transmission Time Interval (TTI). On the contrary, due to the limitation of the physical channel capacity, the maximum number of bytes p when the ith UE transmits data through the jth RCi,jNumber of bytes less than buffer biThe maximum number of data bytes that the UE can send is pi,j。
Step 240, the scheduling operation is performed according to the traffic and the target integer linear programming model, which includes the delay constraint condition of the real-time service.
The target integer linear programming model also comprises an objective function, a first constraint condition and a second constraint condition, and the base station executes scheduling operation according to the target integer linear programming model based on the first constraint condition, the second constraint condition and the delay constraint condition
Figure BDA0002318373660000081
A maximization process is performed.
The objective function is:
Figure BDA0002318373660000082
the first constraint is:
Figure BDA0002318373660000083
the second constraint is:
Figure BDA0002318373660000084
the delay constraint is
Figure BDA0002318373660000085
Wherein, αi,jIs twoA binary variable, α when the ith UE is assigned the jth RCi,j1, α when the ith UE is not assigned the jth RCi,jIs 0, wi,jFor the traffic, δ, generated when the ith UE transmits data through the jth RCiThe delay of the head of line (HoL) packet for the ith UE, when the ith UE is scheduled in the current TTI,
Figure BDA0002318373660000086
when the ith UE is not scheduled in the current TTI,
Figure BDA0002318373660000091
Dthfor the delay period of real-time services, t is the length of the current TTI.
Figure BDA0002318373660000092
Indicating that when HoL packets for the ith UE exceed the delay period, the base station forces scheduling for the ith UE.
With the uplink scheduling in the related art, for real-time traffic, if a packet is not transmitted within a delay period, the packet is discarded, which degrades Quality of service (QoS). For real-time services, the target integer linear programming model provided by the embodiment includes delay constraint conditions of the real-time services, so that packets can be transmitted within a delay deadline, and the QoS is improved.
In summary, in the LTE uplink scheduling method provided in the embodiment of the present invention, the base station first obtains the traffic generated when the ith UE sends data through the jth RC, and the traffic is obtained from the buffer status of the real-time service. The base station executes scheduling operation according to the flow and the target integer linear programming model, the target integer linear programming model comprises delay constraint conditions of the real-time service, and the base station can execute the scheduling operation according to the delay constraint conditions of the real-time service, so that real-time service packets can be transmitted within a delay deadline and the method is suitable for the real-time service.
It should be noted that, the order of the steps of the LTE uplink scheduling method provided in the embodiment of the present invention may be appropriately adjusted, and the steps may also be increased or decreased according to the situation, and any method that can be easily changed within the technical scope disclosed by the present invention by a person skilled in the art should be covered within the protection scope of the present invention, and therefore, no further description is given.
Referring to fig. 5, fig. 5 shows an LTE uplink scheduling apparatus 500 according to an embodiment of the present invention, where the apparatus is used for a base station, and the apparatus 500 includes:
an obtaining module 510, configured to obtain a traffic generated when an ith UE sends data through a jth RC, where the traffic is obtained from a buffer status of a real-time service, i is greater than or equal to 1, and j is greater than or equal to 1. Each RC includes a plurality of consecutive PRBs.
A scheduling module 520, configured to perform a scheduling operation according to the traffic and a target integer linear programming model, where the target integer linear programming model includes a delay constraint condition of the real-time service.
Optionally, as shown in fig. 6, the obtaining module 510 includes:
the first obtaining sub-module 511 is configured to obtain a buffer status of the real-time service, where the buffer status is used to indicate a capacity of a buffer.
The second obtaining sub-module 512 is configured to obtain a maximum data size, where the maximum data size is a maximum data size of data sent by the ith UE through the jth RC.
And the processing sub-module 513 is configured to use the smaller of the maximum data size and the buffer status as the traffic generated when the ith UE transmits data through the jth RC.
In this embodiment, the target integer linear programming model further includes an objective function, a first constraint, and a second constraint. When the base station executes the scheduling operation according to the target integer linear programming model, the base station carries out the scheduling operation based on the first constraint condition, the second constraint condition and the delay constraint condition
Figure BDA0002318373660000101
A maximization process is performed.
The objective function is:
Figure BDA0002318373660000102
the first constraint is:
Figure BDA0002318373660000103
the second constraint is:
Figure BDA0002318373660000104
the delay constraint is
Figure BDA0002318373660000105
Wherein, αi,jFor binary variables, α when the ith UE is assigned the jth RCi,j1, α when the ith UE is not assigned the jth RCi,jIs 0, wi,jFor the traffic, δ, generated when the ith UE transmits data through the jth RCiDelay of header HoL packet for ith UE when ith UE is scheduled in current transmission time interval TTI
Figure BDA0002318373660000106
When the ith UE is not scheduled in the current TTI
Figure BDA0002318373660000107
DthFor the delay period of real-time services, t is the length of the current TTI.
Optionally, the first obtaining sub-module 511 is configured to: obtaining a buffer status report from the ith UE; buffer status is extracted from the buffer status report.
Illustratively, the buffer status obtained by the first obtaining sub-module 511 is the number of bytes of the buffer, and the maximum data size obtained by the second obtaining sub-module 512 is the maximum number of bytes of data sent by the ith UE through the jth RC.
The LTE uplink scheduling apparatus provided in the embodiment of the present invention implements the method embodiments shown in fig. 2, fig. 3, or fig. 4 through the cooperation of the above modules.
In summary, in the LTE uplink scheduling apparatus provided in the embodiment of the present invention, the base station first obtains the traffic generated when the ith UE sends data through the jth RC, and the traffic is obtained from the buffer status of the real-time service. The base station executes scheduling operation according to the flow and the target integer linear programming model, the target integer linear programming model comprises delay constraint conditions of the real-time service, and the base station can execute the scheduling operation according to the delay constraint conditions of the real-time service, so that real-time service packets can be transmitted within a delay deadline and the method is suitable for the real-time service.
Referring to fig. 7, another LTE uplink scheduling apparatus 700 is provided in an embodiment of the present invention, for a base station, as shown in fig. 7, the apparatus 700 includes a processor 710 and a memory 720, where the memory 720 stores one or more computer programs 721, and the processor 710 implements the following steps when executing the one or more computer programs:
and acquiring the flow generated when the ith UE sends data through the jth RC, wherein the flow is obtained from the buffer area state of the real-time service, i is more than or equal to 1, j is more than or equal to 1, and each RC comprises a plurality of continuous PRBs.
The scheduling operation is performed according to the traffic and a target integer linear programming model that includes delay constraints for real-time traffic.
Further, the processor 710 in this embodiment may also implement the method shown in fig. 3 or fig. 4 when executing one or more computer programs.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention, as claimed. It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described apparatuses and modules may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
To sum up, the embodiments of the present invention provide an LTE uplink scheduling method and apparatus for solving the problem that the current uplink scheduling method is not suitable for real-time services and cannot guarantee transmission of real-time service packets within a delay deadline, in which a base station can first obtain a traffic generated when an ith UE sends data through a jth RC, the traffic is obtained from a buffer state of the real-time services, and then perform a scheduling operation according to the traffic and a target integer linear programming model, and since the target integer linear programming model includes a delay constraint condition of the real-time services, the base station can perform the scheduling operation according to the delay constraint condition of the real-time services, so that real-time service packets can be transmitted within the delay deadline, and is suitable for the real-time services and improves QoS.
It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program instructing relevant hardware, where the program may be stored in a computer-readable storage medium, and the above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.
Although the present invention has been described in detail with reference to the above embodiments, those skilled in the art can make modifications and equivalents to the embodiments of the present invention without departing from the spirit and scope of the present invention, which is set forth in the claims of the present application.

Claims (10)

1. An LTE uplink scheduling method, comprising:
acquiring the flow generated when the ith user equipment transmits data through the jth resource block, wherein the flow is obtained from the buffer area state of the real-time service; wherein i is more than or equal to 1, j is more than or equal to 1, and each resource block comprises a plurality of continuous physical resource blocks;
and executing scheduling operation according to the flow and a target integer linear programming model, wherein the target integer linear programming model comprises a delay constraint condition of the real-time service.
2. The method of claim 1, wherein the obtaining the traffic generated when the ith user equipment transmits data through the jth resource block comprises:
obtaining a buffer area state of the real-time service, wherein the buffer area state is used for indicating the capacity of the buffer area;
acquiring the maximum data volume, wherein the maximum data volume is the maximum data volume of data transmitted by the ith user equipment through the jth resource block;
and taking the smaller value of the maximum data volume and the buffer area state as the flow generated when the ith UE sends data through the jth RC.
3. The LTE uplink scheduling method of claim 1 or 2, wherein the target integer linear programming model further comprises: an objective function, a first constraint and a second constraint;
the objective function is:
Figure FDA0002318373650000011
the first constraint condition is as follows:
Figure FDA0002318373650000012
the second constraint condition is as follows:
Figure FDA0002318373650000013
the delay constraint is:
Figure FDA0002318373650000014
in the formula, αi,jFor binary variable, α when the ith user equipment is allocated the jth resource blocki,j1, when the ith UE is not assigned the jth RC αi,jIs 0; w is ai,jThe traffic generated when the ith UE sends data through the jth RC is generated;
δithe delay of the header packet for the ith user equipment, when the ith user equipment is scheduled in the current transmission time interval,
Figure FDA0002318373650000021
when the ith UE is not scheduled in the current transmission time interval,
Figure FDA0002318373650000022
Dthand t is the delay deadline of the real-time service and the length of the current transmission time interval.
4. The method of claim 2, wherein the obtaining the buffer status of the real-time service comprises:
obtaining a buffer status report from the ith user equipment;
extracting the buffer status from the buffer status report.
5. The LTE uplink scheduling method of claim 2, wherein the buffer status is the number of bytes in the buffer; the maximum data amount is the maximum byte number of data sent by the ith user equipment through the jth resource block.
6. An LTE uplink scheduling apparatus, the apparatus comprising:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring the flow generated when the ith user equipment UE transmits data through the jth resource block RC, the flow is obtained by the buffer area state of a real-time service, i is more than or equal to 1, j is more than or equal to 1, and each RC comprises a plurality of continuous physical resource blocks PRB;
and the scheduling module is used for executing scheduling operation according to the flow and a target integer linear programming model, and the target integer linear programming model comprises a delay constraint condition of the real-time service.
7. The LTE uplink scheduling apparatus of claim 6, wherein the obtaining module comprises:
a first obtaining submodule, configured to obtain a buffer status of the real-time service, where the buffer status is used to indicate a capacity of the buffer;
a second obtaining submodule, configured to obtain a maximum data volume, where the maximum data volume is a maximum data volume of data sent by the ith UE through the jth RC;
and the processing submodule is used for taking the smaller value of the maximum data volume and the buffer area state as the flow generated when the ith UE sends data through the jth RC.
8. The apparatus of claim 6 or 7, wherein the target integer linear programming model further comprises an objective function, a first constraint and a second constraint,
the objective function is:
Figure FDA0002318373650000031
the first constraint condition is as follows:
Figure FDA0002318373650000032
the second constraint condition is as follows:
Figure FDA0002318373650000033
the delay constraint is
Figure FDA0002318373650000034
Wherein, the αi,jIs a binary variable, said α being when said ith UE is assigned said jth RCi,j1, said α when said ith UE is not assigned said jth RCi,jIs 0, said wi,jThe flow generated when the ith UE sends data through the jth RC is deltaiA delay of a header HoL packet for the ith UE, when the ith UE is scheduled in a current transmission time interval, TTI,
Figure FDA0002318373650000035
when the ith UE is not scheduled in the current TTI,
Figure FDA0002318373650000036
said DthAnd the delay deadline of the real-time service is the t is the length of the current TTI.
9. The apparatus of claim 7, wherein the first obtaining sub-module is configured to:
obtaining a buffer status report from the ith UE;
extracting the buffer status from the buffer status report.
10. The apparatus of claim 7, wherein the buffer status is a number of bytes of a buffer, and wherein the maximum amount of data is a maximum number of bytes of data transmitted by the ith UE via the jth RC.
CN201911287296.9A 2019-12-14 2019-12-14 LTE uplink scheduling method and device Active CN110933707B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911287296.9A CN110933707B (en) 2019-12-14 2019-12-14 LTE uplink scheduling method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911287296.9A CN110933707B (en) 2019-12-14 2019-12-14 LTE uplink scheduling method and device

Publications (2)

Publication Number Publication Date
CN110933707A true CN110933707A (en) 2020-03-27
CN110933707B CN110933707B (en) 2023-05-23

Family

ID=69863596

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911287296.9A Active CN110933707B (en) 2019-12-14 2019-12-14 LTE uplink scheduling method and device

Country Status (1)

Country Link
CN (1) CN110933707B (en)

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080232260A1 (en) * 2005-10-05 2008-09-25 Electronics And Telecommunications Research Institute Method for Requesting Resource and Scheduling for Uplink Traffic in Mobile Communication and Apparatus Thereof
US20150009826A1 (en) * 2012-02-17 2015-01-08 Vid Scale, Inc Hierarchical traffic differentiation to handle congestion and/or manage user quality of experience
CN105939539A (en) * 2015-03-05 2016-09-14 思科技术公司 System and method for dynamic bandwidth adjustments for cellular interfaces in a network environment
WO2016192810A1 (en) * 2015-06-05 2016-12-08 Huawei Technologies Co., Ltd. Method and apparatus for configuring sounding reference symbol (srs)
US20170257156A1 (en) * 2010-09-29 2017-09-07 Lg Electronics Inc. Method and apparatus for performing effective feedback in wireless communication system supporting multiple antennas
CN107645731A (en) * 2017-09-21 2018-01-30 北京邮电大学 Load-balancing method based on self-organizing resource allocation in a kind of non-orthogonal multiple access system
CN110113221A (en) * 2015-03-05 2019-08-09 思科技术公司 System and method for the dynamic bandwidth adjustment of cellular interface in network environment
CN110301143A (en) * 2016-12-30 2019-10-01 英特尔公司 Method and apparatus for radio communication

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080232260A1 (en) * 2005-10-05 2008-09-25 Electronics And Telecommunications Research Institute Method for Requesting Resource and Scheduling for Uplink Traffic in Mobile Communication and Apparatus Thereof
US20170257156A1 (en) * 2010-09-29 2017-09-07 Lg Electronics Inc. Method and apparatus for performing effective feedback in wireless communication system supporting multiple antennas
US20150009826A1 (en) * 2012-02-17 2015-01-08 Vid Scale, Inc Hierarchical traffic differentiation to handle congestion and/or manage user quality of experience
CN105939539A (en) * 2015-03-05 2016-09-14 思科技术公司 System and method for dynamic bandwidth adjustments for cellular interfaces in a network environment
CN110113221A (en) * 2015-03-05 2019-08-09 思科技术公司 System and method for the dynamic bandwidth adjustment of cellular interface in network environment
WO2016192810A1 (en) * 2015-06-05 2016-12-08 Huawei Technologies Co., Ltd. Method and apparatus for configuring sounding reference symbol (srs)
CN110301143A (en) * 2016-12-30 2019-10-01 英特尔公司 Method and apparatus for radio communication
CN107645731A (en) * 2017-09-21 2018-01-30 北京邮电大学 Load-balancing method based on self-organizing resource allocation in a kind of non-orthogonal multiple access system

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
SUMIKO MIYATA: "Characteristic analysis of individual call blocking rate and resource utilization by using our mixed delay and loss system", 《 2011 IEEE INTERNATIONAL WORKSHOP TECHNICAL COMMITTEE ON COMMUNICATIONS QUALITY AND RELIABILITY (CQR)》 *
李顺: "LTE系统中实时业务调度机制的研究与实现", 《中国优秀硕士学位论文全文数据库》 *
费长江: "基于LTE的卫星移动通信系统无线资源调度技术研究", 《中国优秀硕士学位论文全文数据库》 *

Also Published As

Publication number Publication date
CN110933707B (en) 2023-05-23

Similar Documents

Publication Publication Date Title
US10708940B2 (en) Method and apparatus for reporting buffer state by user equipment in communication system
US9295040B2 (en) Packet scheduling in communications
US9326290B2 (en) Resource scheduling method, apparatus and base station
US9300431B2 (en) Apparatus, method and computer readable medium for payload segmentation of wireless packet data transmissions
US11039448B2 (en) Resource scheduling method and apparatus
WO2018126839A1 (en) Data transmission method, terminal device and network device
CN109728927B (en) Time delay optimization method, service scheduling method and storage medium
CA2790671A1 (en) Method for scheduling guaranteed bit rate service based on quality of service
KR20160040197A (en) Infrastructure equipment, wireless communications network and method
AU2019460320B2 (en) Sharing HARQ processes by multiple configured grants resources
US20160278111A1 (en) Service scheduling method and device
CN108322939B (en) Method and apparatus for wireless communication system supporting multiple physical layer methods
Afrin et al. A delay sensitive LTE uplink packet scheduler for M2M traffic
CN110933707B (en) LTE uplink scheduling method and device
WO2016101148A1 (en) Method, device and system for scheduling physical radio resource block
EP3456121B1 (en) Granting resources to a wireless device
CN107211400B (en) Network access control method, access point and access controller
CN110933699B (en) Packet forwarding method and device
Afrin et al. A packet age based LTE uplink packet scheduler for M2M traffic
EP3198813B1 (en) Method, apparatus and system
WO2023143189A1 (en) Signaling transmission method, device, and storage medium
Liu et al. Limited factors and calculation method of VOLTE capacity
US20240114434A1 (en) Improved Base Station Efficiency
JP2009100299A (en) Radio control apparatus, radio communication apparatus and radio control method

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