CN112752347B - Method and apparatus for scheduling data transmission - Google Patents

Abstract

The present application provides a method and device for scheduling data transmission. Network equipment obtains channel information, data packet arrival information, and scheduling parameters within the time range to be scheduled, and uses a scheduling algorithm to treat the data included in the scheduling time range according to the order of time. The paths in each time scheduling unit are expanded to obtain a scheduling path with an optimal compromise of at least two performance indicators of the communication system within the time range to be scheduled. Scheduling the data transmission of the terminal equipment within the scheduling time range according to the scheduling path can achieve a better compromise of performance indicators such as throughput, fairness, and packet loss rate of the communication system, which helps to improve the scheduling performance of the communication system.

Description

Method and device for scheduling data transmission

technical field

The present application relates to the technical field of wireless communication, and more specifically, to a method and device for scheduling data transmission.

Background technique

In cellular networks, medium access control (MAC) layer scheduling is mainly used to solve problems such as time-frequency resource allocation, modulation and coding scheme (MCS) selection, user pairing, and precoding. A compromise between throughput and fairness of the communication system can be achieved through scheduling.

The existing scheduling algorithms of the MAC layer often model the communication system as a definite model, and on the basis of this model, the scheduling scheme is obtained through formula derivation. Commonly used scheduling algorithms include round robin (RR) algorithm, maximum carrier-to-interference ratio (Max C/I) algorithm and proportional fair algorithm (proportional fair, PF) algorithm. Among them, the PF algorithm can achieve a better compromise between throughput and fairness, so it is widely used.

However, due to the complexity of communication systems, modeling them with closed-form models and formulas cannot be accurate. Therefore, it is impossible for formula-based scheduling algorithms to achieve better communication system performance.

Contents of the invention

The present application provides a method and device for scheduling data transmission, which helps to improve the scheduling performance of a communication system.

In a first aspect, the present application provides a method for scheduling data transmission, including: acquiring channel information within the time range to be scheduled, arrival information of data packets, and scheduling parameters, wherein the scheduling parameters are used to configure a scheduling algorithm, and the The scheduling algorithm is used to expand the paths in each time scheduling unit included in the time range to be scheduled in order of time, so as to obtain the maximum value of at least two performance indicators of the communication system within the time range to be scheduled. A compromised scheduling path; determine a first scheduling path according to the channel information, the arrival information of the data packet, the scheduling parameter, and the scheduling algorithm, where the first scheduling path is used to indicate the The decision of scheduling the terminal device to perform data transmission within the time range to be scheduled is described; according to the first scheduling path, the data transmission of the terminal device is scheduled within the time range to be scheduled.

In this application, the scheduling algorithm used by network equipment to schedule terminal equipment for data transmission is a scheduling path determined by performing path expansion in sequence in time order in the time scheduling unit included in the time unit to be scheduled, or in other words, Considering the joint scheduling of multiple time scheduling units within a certain period of time, at least two performance indicators such as throughput, scheduling fairness and packet loss rate of the communication system can be optimally compromised. Therefore, the scheduling performance of the communication system can be improved.

With reference to the first aspect, in some implementations of the first aspect, the scheduling parameters include one or more of the following parameters: the number of scheduled terminal devices, the number of streams, the scheduling unit of time-frequency resources, the waiting The length N of the scheduling time range, the list size L of the scheduling algorithm, and the packet arrival distribution model of the data packets, wherein the scheduling unit of the time-frequency resource includes a time scheduling unit and a frequency scheduling unit.

With reference to the first aspect, in some implementation manners of the first aspect, the time range to be scheduled includes N time scheduling units, and according to the channel information, the arrival information of the data packet, the scheduling The parameters and the scheduling algorithm determine the first scheduling path, including: (1) expanding the path in the nth time scheduling unit to obtain Z paths, and judging whether Z is greater than L; (2) when Z>L , sorting and screening the Z paths, selecting L paths from the Z paths; (3) judging whether n is equal to N; (4) when n<N, making n=n+1, And return to (1); when n=N, output the first scheduling path according to a preset system preference or threshold, the system preference or threshold is set according to at least one performance index of the communication system, Wherein, 1≤n≤N, Z, L, and N are all positive integers.

The scheduling algorithm of this application introduces the list size L on the basis of the existing Pareto (Pareto) algorithm, and performs path expansion in each time scheduling unit according to the order of time, as well as possible path sorting and screening, A better tradeoff between throughput, fairness, and packet loss can be achieved.

With reference to the first aspect, in some implementation manners of the first aspect, when Z>L, sorting and filtering the Z paths to select L paths from the Z paths includes: When Z>L, the Z paths are sorted and screened according to the following criteria to select the L paths from the Z paths: the Z paths obtained according to the expansion in the nth time scheduling unit Path, determine the Pareto boundary, and sort the path with the smaller number of Pareto boundary layers; the paths in the same Pareto boundary layer are sorted from large to small according to the path difference measure and DMS parameters; in Before sorting the Z paths, all paths with a DMS parameter of 0 in the Z paths are deleted in advance.

Since the state of each path includes different performance indicators such as throughput, fairness, and packet loss rate, and there may be conflicts between these performance indicators, they cannot be optimized at the same time. For example, the pursuit of maximum throughput will inevitably lead to poor fairness. This application sets the above three criteria to sort and filter the Z paths obtained after expansion in the nth time scheduling unit, which can ensure the optimality and diversity of the paths.

With reference to the first aspect, in some implementation manners of the first aspect, the time range to be scheduled includes N time scheduling units, and according to the channel information, the arrival information of the data packet, the scheduling parameter, and The scheduling algorithm determines the first scheduling path, including: (1) expanding the paths in the nth time scheduling unit to obtain Z paths, and judging whether Z is greater than L; (2) when Z≤L, Determine whether n is equal to N; (3) when n<N, make n=n+1, and return to (1); when n=N, determine the first schedule according to the preset system preference or threshold The path, the system preference or the threshold is set according to at least one performance index of the communication system, where 1≤n≤N, Z, L, and N are all positive integers.

With reference to the first aspect, in some implementation manners of the first aspect, the expanding the paths in the nth time scheduling unit to obtain Z paths includes: according to the legal path in the nth time scheduling unit Decision-making, extending the path in the nth time scheduling unit, where the legal decision in the nth time scheduling unit refers to the nth time in the nth time scheduling unit The legal terminal device in the unit makes a scheduling decision, wherein the legal terminal device in the nth time scheduling unit means that the amount of cached data in the nth time scheduling unit is greater than or equal to a preset threshold, And the corresponding channel supports a terminal device for data transmission.

Existing PF algorithms, etc. use closed-type models and formulas to model the communication system and determine the scheduling scheme, regardless of the data buffering situation of the terminal equipment and its channel situation, and proceed according to the model of the communication system established with idealized parameters. Scheduling may not match the actual scenario. In contrast, this application schedules legal terminal devices according to legal decisions in each time scheduling unit within the time range to be scheduled, fully considering the buffered data volume of terminal devices and their channel conditions, and can be closer to the actual scene , which can improve scheduling performance.

With reference to the first aspect, in some implementation manners of the first aspect, the scheduling the transmission of the terminal device according to the first scheduling path includes: adjusting the first scheduling path to obtain a second scheduling path; According to the second scheduling path, data transmission of the terminal device is scheduled within the to-be-scheduled time range.

Considering that in a non-ideal scenario, the channel information and the arrival information of the data packet cannot be obtained perfectly, it is a scenario that is closer to reality. In this scenario, the scheduling path output by the scheduling algorithm (that is, the first scheduling path above) cannot be directly used for scheduling within the time range to be scheduled, but the first scheduling path output by the scheduling algorithm is adjusted, Then, the adjusted scheduling path is used for scheduling, which can make the scheduling path closer to and conform to the actual scene, and further improve the scheduling performance.

With reference to the first aspect, in some implementations of the first aspect, the first scheduling path includes a decision sequence consisting of M decisions in time order, each of the M decisions is used to instruct the network device For the terminal devices scheduled in the one or more time scheduling units, M≤N and M is an integer, adjusting the first scheduling path to obtain a second scheduling path includes: The sequence of the M decisions is adjusted; and/or, the terminal devices scheduled by one or more of the M decisions are adjusted to obtain the second scheduling path.

By adjusting the original scheduling path (that is, the first scheduling path) output by the scheduling algorithm provided by this application, the second scheduling path thus obtained is more in line with the actual channel and packet arrival conditions, so that better scheduling can be obtained performance.

With reference to the first aspect, in some implementation manners of the first aspect, the adjusting the order of the M decisions, and/or the scheduled terminal for one or more decisions in the M decisions Equipment adjustments, including:

(1) Initializing a first decision sequence and a second decision sequence, wherein the initialized first decision sequence is the decision sequence composed of the M decisions in order, and the second decision sequence is an empty set;

(2) In the nth time scheduling unit, if the second decision sequence includes the first legal decision to schedule terminal equipment for data transmission in the nth time scheduling unit, then in the nth time scheduling unit The time scheduling unit schedules the terminal device for data transmission according to the first legal decision, and deletes the first legal decision from the second decision sequence, and enters (4); if there is no Including a legal decision to schedule terminal equipment for data transmission in the nth time scheduling unit, then enter (3);

(3) In the nth time scheduling unit, if the first decision sequence includes the first legal decision to schedule terminal equipment for data transmission in the nth time scheduling unit, then in the nth time scheduling unit The time scheduling unit schedules the terminal device to perform data transmission according to the first legal decision, and deletes other decisions in the first decision sequence before the first legal decision from the first decision sequence and moves them to At the end of the second decision sequence, enter (4); if the first decision sequence does not include the first legal decision to schedule terminal equipment for data transmission in the nth time scheduling unit, according to the preset The scheduled scheduling policy schedules the terminal equipment for data transmission, and enters

(4), wherein, the preset scheduling policy is set according to at least one performance index of the communication system;

(4) judge whether n is equal to N;

(5) When n<N, make n=n+1, and return to (1); when n=N, output the second scheduling path according to the preset system preference or threshold, the system preference Or the threshold is set according to at least one performance index of the communication system, where 1≤n≤N, Z, L, and N are all positive integers.

According to the adjustment method of the above-mentioned scheduling path, the path extensions in the original scheduling path (that is, the first scheduling path) output by the PL algorithm of the present application that do not conform to the actual scene are adjusted, so that only legal terminals are used in each time scheduling unit The scheduling of the equipment can make the adjusted path more consistent and close to the actual scene, thereby improving the scheduling performance of the communication system.

With reference to the first aspect, in some implementation manners of the first aspect, the scheduling the data transmission of the terminal device according to the first scheduling path includes:

Sending downlink control information DCI to the terminal device, the DCI carrying scheduling information of a first time range, the length of the first time range is equal to m time scheduling units, m≤N and m is an integer, the first The scheduling information of the time range is used to indicate resources used by the terminal device for data transmission within the first time range.

According to the scheduling scheme of this application, when the channel conditions and the arrival of data packets are relatively stable, and there are enough data packets in the buffer of the terminal device to support data transmission, the network device can schedule the terminal device at m scheduling times through a PDCCH Data transmission within a unit, so that the overhead of the PDCCH can be saved in the following (m-1) time scheduling units.

With reference to the first aspect, in some implementations of the first aspect, the DCI carries scheduling information in a first time range, including: the DCI includes a first field and a second field, and the first field is used to indicate For resource allocation within the first time range, the second field is used to indicate the time scheduling unit.

In a second aspect, the present application provides a communication device, where the communication device has a function of implementing the method in the first aspect or any possible implementation thereof. The functions described above may be implemented by hardware, or may be implemented by executing corresponding software on the hardware. The hardware or software includes one or more units corresponding to the above functions.

In a third aspect, the present application provides a network device, including one or more processors, one or more memories, and one or more transceivers. Wherein, the one or more memories are used to store computer programs, and the one or more processors are used to invoke and run the computer programs stored in the memories, and control the one or more transceivers to send and receive signals, so that the network The device executes the method in the first aspect or any possible implementation thereof.

In a fourth aspect, the present application provides a computer-readable storage medium, where computer instructions are stored in the computer-readable storage medium, and when the computer instructions are run on the computer, the computer executes the first aspect or any possible implementation thereof method in .

In a fifth aspect, the present application provides a computer program product, the computer program product includes computer program code, and when the computer program code is run on a computer, the computer is made to execute the first aspect or any possible implementation thereof. method.

In a sixth aspect, the present application provides a communication device, including a processor and an interface circuit, the interface circuit is used to receive computer codes or instructions, and transmit them to the processor, and the processor is used to run the computer codes or instructions Instructions to execute the method in the first aspect or any possible implementation thereof.

In a seventh aspect, the present application provides a wireless communication system, including the network device as described in the third aspect.

Description of drawings

FIG. 1 is a schematic diagram of a communication system applicable to an embodiment of the present application.

Fig. 2 is a schematic flowchart of a method for scheduling data transmission provided by the present application.

Fig. 3 is an example of the scheduling algorithm provided by this application.

Fig. 4 is an example illustration of the Pateto boundary of criterion 1 provided in this application.

FIG. 5 is a schematic flowchart of a method for scheduling data transmission provided by the present application.

FIG. 6 is a schematic diagram of the process of adjusting the original scheduling path output by the PL algorithm provided in the present application.

FIG. 7 is a schematic flowchart of a method for scheduling data transmission provided by the present application.

FIG. 8 is an example of the format of DCI.

FIG. 9 is a simulation diagram of the technical solution of the present application relative to the gain of the PF algorithm.

FIG. 10 is a simulation diagram of the technical solution of the present application relative to the gain of the PF algorithm.

FIG. 11 is a simulation diagram of the technical solution of the present application relative to the gain of the PF algorithm.

Fig. 12 is a schematic block diagram of a communication device 1000 provided in the present application.

FIG. 13 is a schematic structural diagram of a communication device 10 provided by the present application.

Detailed ways

The technical solution in this application will be described below with reference to the accompanying drawings.

The technical solution of the present application can be applied to a scenario where a base station or other central nodes in a wireless communication system perform media access control (medium access control, MAC) layer scheduling data transmission. The technical solution of the present application is applicable to both the scheduling of uplink data transmission and the scheduling of downlink data transmission.

The wireless communication systems mentioned in this application include but are not limited to: narrow band-Internet of things (NB-IoT), global system for mobile communications (GSM), enhanced data rate GSM evolution system (enhanced data rate for GSMevolution, EDGE), wideband code division multiple access system (wideband code division multiple access, WCDMA), code division multiple access 2000 system (code division multiple access, CDMA2000), time division synchronous code division multiple access system ( Time division-synchronization code division multiple access, TD-SCDMA), long term evolution system (long term evolution, LTE) and the three application scenarios of 5G mobile communication system, namely enhanced mobile broadband (eMBB), high reliability Low latency communication (ultrareliable and low latency communication, URLLC) and enhanced machine type communication (enhanced machine type communication, eMTC), etc.

Referring to FIG. 1 , FIG. 1 is a schematic diagram of a communication system applicable to an embodiment of the present application. As shown in FIG. 1 , a wireless communication system is usually composed of cells, each cell includes a network device, and the network device provides communication services to multiple mobile stations (mobile stations, BSs). Optionally, the network device may include a baseband unit (baseband unit, BBU) and a remote radio unit (remote radio unit, RRU). BBU and RRU can be placed in different places. For example, RRUs are remote and placed in high traffic areas, and BBUs are placed in the central equipment room. The BBU and RRU can also be placed in the same equipment room. The BBU and the RRU may also be different components under one rack, which is not limited in this application.

The network devices mentioned in this application refer to access network (access network, AN) devices, for example, base stations (or access points), unless otherwise specified. Access network equipment refers to the equipment in the access network that communicates with wireless terminal equipment through one or more cells through the air interface. The access network device may be an evolved base station (NodeB or eNB or e-NodeB, evolutional Node B) in long term evolution (long term evolution, LTE) or advanced long term evolution (long term evolution-advanced, LTE-A), or It can also be the fifth generation mobile communication technology (the 5 ^th generation, 5G) or the next generation node B (next generation node B, gNB) in the new air interface (new radio, NR) system, or it can also be the cloud access network Centralized unit (CU) and distributed unit (DU) in the (cloud radio access network, Cloud RAN) system. Optionally, the access network device may include a baseband unit (baseband unit, BBU) and a remote radio unit (remote radio unit, RRU). BBU and RRU can be placed in different places. For example, RRUs are remote and placed in high traffic areas, and BBUs are placed in the central equipment room. The BBU and RRU can also be placed in the same equipment room. The BBU and the RRU may also be different components under one rack. The embodiment of this application is not limited.

The MS mentioned in this application may include various terminal devices with wireless communication functions, for example, handheld devices, vehicle-mounted devices, wearable devices, computing devices or other processing devices connected to wireless modems. The MS can also be called a terminal (terminal), and the MS can also be a subscriber unit (subscriber unit), a cellular phone (cellularphone), a smart phone (smart phone), a wireless data card, a personal digital assistant (personal digital assistant, PDA) computer , tablet computer, wireless modem (modem), handheld device (handset), laptop computer (laptop computer), machine type communication (machine type communication, MTC) terminal, etc.

The technical solutions provided by this application are introduced below.

Referring to FIG. 2 , FIG. 2 is a schematic flowchart of a method for scheduling data transmission provided by the present application.

210. The network device acquires channel information, arrival information of data packets, and scheduling parameters within the time range to be scheduled, wherein the scheduling parameters are used to configure a scheduling algorithm, and the scheduling algorithm processes the time range to be scheduled in chronological order The paths in each time scheduling unit included in the time range are extended to obtain the optimal compromise scheduling path of at least two performance indicators of the communication system within the to-be-scheduled time range, the at least two performance indicators include One or more of throughput, fairness of scheduling, and packet loss rate.

Optionally, the to-be-scheduled time range may also be referred to as a to-be-scheduled time window, which refers to a future period of time in which the terminal device needs to perform data transmission under the scheduling of the network device.

For example, taking a cell covered by a network device as an example, the cell includes multiple terminal devices. For a period of time in the future, the sending of uplink data or the receiving of downlink data of the multiple terminal devices in the cell requires scheduling by the network device. The future period of time is the time range to be scheduled in this application.

Optionally, the length of the time range to be scheduled can be configured by the network device according to the actual scheduling situation. For example, if the channel condition is good and the terminal device has enough data to send, the length of the time range to be scheduled can be configured to be longer. However, if the channel condition is poor and changes greatly, the length of the time range to be scheduled can be configured to be shorter.

Optionally, the length of the time range to be scheduled may be represented by a scheduling unit of time. For example, if a transmission time interval (transmission time interval, TTI) is defined as a time scheduling unit, the time range to be scheduled may include N TTIs, where N≥1 and N is an integer.

In addition, the channel information is used to characterize the channel conditions of the terminal devices that may be scheduled by the network device within the time range to be scheduled.

The arrival information of the data packets is used to characterize the arrival of respective data packets of the terminal devices that may be scheduled by the network device within the scheduling time range. For example, the number of arriving data packets, and the arrival distribution of data packets within the to-be-scheduled time range.

Optionally, the arrival distribution of data packets may include uniform distribution, Poisson distribution, equal interval distribution, and the like.

Wherein, the channel information and the arrival information of the data packet within the time range to be scheduled can be obtained by the network device in various ways.

Optionally, in an example, the channel information and the arrival information of the data packets within the to-be-scheduled time range may be predicted by the network device according to a machine learning algorithm.

Or, in another example, the channel information within the to-be-scheduled time range may be obtained by the network device by estimating historical channels and performing extrapolation. At the same time, the arrival information of the data packet can also be obtained by the network device by estimating the historical arrival situation of the data packet of the terminal device.

In addition, in another example, the channel information within the time range to be scheduled can also be estimated by the network device through the historical channel, and the estimated result of the historical channel can be used as the channel information of a certain period of time in the future. At the same time, the arrival information of the data packet may also be estimated by the network device on the historical arrival of the data packet of the terminal device as the arrival information of the data packet within a certain period of time in the future.

In this application, the scheduling parameters are used to configure the scheduling algorithm. Wherein, the scheduling algorithm is used to extend the path of each time scheduling unit in the time range to be scheduled according to the order of time, so as to output the scheduling path from the first time scheduling unit to the Nth time scheduling unit, so that At least two performance indicators of the system reach an optimal compromise within the to-be-scheduled time range. Wherein, the time range to be scheduled includes N time scheduling units in total. The at least two performance indicators may include one or more of throughput, fairness and packet loss rate.

Optionally, the scheduling parameters may include one or more of the following parameters:

The number of users, the number of flows, the scheduling unit of time-frequency resources, the time range to be scheduled, the list size L of the scheduling algorithm, the arrival distribution model and average value of data packets, etc.

It should be understood that "user" in this application refers to a terminal device unless otherwise specified.

The arrival distribution and mean value of data packets refer to the arrival distribution and mean value of upper layer data packets received by the MAC layer.

In addition, the scheduling unit of the time-frequency resource may include two dimensions of a time scheduling unit and a frequency scheduling unit.

Therefore, the duration of the time range to be scheduled can be represented by a time scheduling unit. For example. The length of the time range to be scheduled can be recorded as N, which means that the time range to be scheduled includes the length of N time scheduling units.

Optionally, the time scheduling unit may be one or more TTIs. The frequency scheduling unit may be a resource block group (resource block group, RBG).

When the time scheduling unit is 1 TTI, the length of the time range to be scheduled can be recorded as N, which means that the time range to be scheduled includes the length of N TTIs. When the time scheduling unit is 2 TTIs, the length N of the time range to be scheduled means that the scheduling time unit includes N 2TTIs, that is, the length of 2N TTTs.

Optionally, N may be related to the user's movement rate, or related to the user channel and the ability to obtain information about the arrival of data packets within the time range to be scheduled.

It should be understood that N is related to the user's movement rate, which means that the user's movement rate affects the channel change speed.

As shown in Table 1, Table 1 shows an example of the relationship between N and the user's movement rate when the time scheduling unit is 1 TTI, predicting the channel condition of the user and the arrival of the data packet through the machine learning algorithm.

Table 1

User Movement Rate 0-10km/h 10km/h-15km/h >15km/h N 500TTI 100TTI 10TTI

As shown in Table 2, Table 2 shows that estimation is performed through historical channels and data packet arrival conditions, and the estimation result is used as another example of the relationship between channel information and data packet arrival information within the time range to be scheduled.

Table 2

User Movement Rate 0-1km/h 1km/h-5km/h >1km/h N 500TTI 100TTI 10TTI

Optionally, when the scheduling parameters include the list size L of the scheduling algorithm, the setting of L may be related to the number of users and the number of flows. Referring to Table 3, Table 3 shows an example of the relationship between L and the number of users.

table 3

active users 1-5 6-10 11-20 L 200 500 1000

Optionally, when the scheduling parameter includes a list size L of the scheduling algorithm, L may also be related to computing capability. For example, the stronger the computing power, the larger L can be.

Optionally, the scheduling parameters also include parameters such as an arrival distribution model and an average value of data packets sent by the RRC layer to the MAC layer. The arrival model of the data packet can be configured through identification, as shown in Table 4, for example.

Table 4

Packet Arrival Distribution Evenly distributed Poisson distribution equally spaced distribution logo 1 2 3

As shown in Table 4, the mark "1" indicates that the arrival distribution of the data packets conforms to the uniform distribution, the mark "2" indicates that the arrival distribution of the data packets conforms to the Poisson distribution, and the mark "3" indicates that the arrival distribution of the data packets conforms to the equidistant distribution.

In addition, the technical solution of the present application is applicable to both the scheduling of uplink data and downlink data.

During downlink data transmission, the terminal device may report the result of channel estimation or channel prediction to the network device. Therefore, the network device can obtain channel information. For example, the terminal device reports channel quality information (channel quality information, CQI) to the network device. The network device predicts or extrapolates the future channel according to the historical CQI fed back by the terminal device to obtain channel information. The arrival information of the downlink packet can be obtained by the network device itself.

In uplink data transmission, network equipment can obtain channel information through channel estimation or channel prediction. The packet arrival information can be obtained through the report of the terminal device.

In addition, the present application does not limit that the network device may obtain channel information and packet arrival information in other ways.

220. The network device determines a first scheduling path according to the channel information, the arrival information of the data packet, the scheduling parameter, and the scheduling algorithm.

Wherein, the first scheduling path is used to instruct the network device to schedule the terminal device to perform data transmission within the to-be-scheduled time range.

For example, the first scheduling path is used to instruct the network device to decide to schedule the terminal devices in each of the N time scheduling units included in the time range to be scheduled.

For another example, the first scheduling path is used to indicate the scheduling decision of the network device in each of the N time scheduling units included in the time range to be scheduled.

230. The network device schedules the terminal device to perform data transmission according to the first scheduling path.

Wherein, the data transmission may include receiving downlink data or sending uplink data.

As mentioned above, the first scheduling path is used to instruct the network device to schedule the terminal device to perform data transmission within the to-be-scheduled time range. Therefore, according to the first scheduling path, the network device can schedule the sending of uplink data or the receiving of downlink data of the terminal device within the time range to be scheduled.

In this application, the scheduling algorithm used by network equipment to schedule terminal equipment for data transmission is a scheduling path determined by performing path expansion in sequence in time order in the time scheduling unit included in the time unit to be scheduled, or in other words, Considering the joint scheduling of multiple time scheduling units within a certain period of time, it can achieve a better compromise in performance indicators such as system throughput, terminal device scheduling fairness, and packet loss rate. Therefore, the scheduling performance of the communication system can be improved.

In contrast, the existing PF algorithm models the communication system as a deterministic model, and on the basis of this model, derives the scheduling scheme through formulas.

For example, the PF algorithm selects the scheduled terminal equipment according to the following formula (1):

Among them, R _i (t) is the estimated throughput of user i at time t, which is determined by factors such as channel conditions and user buffer conditions. T _i (t) is the historical cumulative throughput of user i at time t.

是一种吞吐量和公平性兼顾的度量。也即，如果一个用户当前的估计吞吐量R_i(t)越大，说明该用户的信道条件较好，且缓存中有足够的数据需要发送，因此，该用户的度量值k也越大。同时，如果该用户的累积吞吐量T_i(t)越大，说明该用户已经发送的数据量越多。为了调度的公平性，应减少该用户的发送机会，因此，该用户的度量值越小。因此，PF算法通过选择度量值最大的用户进行调度即实现了吞吐率和公平性的折中。From this it can be seen that

It is a measure of both throughput and fairness. That is, if a user's current estimated throughput R _i (t) is larger, it means that the user's channel condition is better, and there is enough data in the cache to be sent, therefore, the user's metric value k is also larger. At the same time, if the cumulative throughput T _i (t) of the user is larger, it means that the user has sent more data. For the fairness of scheduling, the sending opportunity of this user should be reduced, therefore, the smaller the metric value of this user is. Therefore, the PF algorithm achieves a compromise between throughput and fairness by selecting the user with the largest metric value for scheduling.

However, due to the complexity of the communication system, it is almost impossible to accurately model it with closed models and formulas. Therefore, formula-based scheduling algorithms such as the PF algorithm cannot guarantee that the scheduling performance of the communication system is optimal.

Therefore, the technical solution of this application aims at the shortcomings of the scheduling scheme based on modeling and formula derivation of the communication system, including the PF algorithm, and at the same time considers the throughput, fairness and packet loss rate of the communication system and other performance indicators. In a compromise, joint scheduling by multiple time scheduling units within a certain period of time can improve the scheduling performance of the communication system.

As mentioned above, the channel information and the arrival information of the data packets within the time range to be scheduled can be obtained by the network device through prediction.

In one implementation, assuming that the channel conditions and the arrival of data packets can be obtained accurately, for example, the channel information and packet arrival information obtained by the network device are consistent with or very close to the actual situation, then the predicted data according to the scheduling algorithm provided by this application The scheduling path (that is, the first scheduling path) may be directly used for scheduling data transmission of terminal devices within the time range to be scheduled.

Specifically, the scheduling algorithm proposed in this application can be executed by the MAC layer of the network device. That is, the MAC layer includes a resource scheduling algorithm module. The resource scheduling algorithm module of the MAC layer obtains channel information, packet arrival information, and scheduling parameters used to configure the scheduling algorithm, calculates the scheduling path according to the scheduling algorithm, and finally outputs a scheduling path, which is the embodiment of this application. The first scheduling path of .

In another implementation, considering that channel information and packet arrival information cannot be obtained perfectly, at this time, the first scheduling path output by the scheduling algorithm module of the MAC layer cannot be directly used for scheduling, but needs to be adjusted according to the actual scene. The scheduling path is adjusted before being used for scheduling.

In order to distinguish it from the first scheduling path, the actual scheduling path obtained after the adjustment of the first scheduling path is called the second scheduling path in this application.

The flow of the scheduling algorithm module of the MAC layer will be described below with reference to FIG. 3 .

Wherein, the flow of the scheduling algorithm can be referred to as shown in FIG. 4 .

Referring to FIG. 3 , FIG. 3 is an example of a scheduling algorithm provided by this application.

310. Initialize the length N of the time range to be scheduled and the list size L of the scheduling algorithm, and initialize the index n used to indicate the TTI as n=1.

It should be understood that in the example in FIG. 4 , TTI is used as the time scheduling unit. Therefore, the index n of the TTI is indicated, that is, the nth time scheduling unit within the time range to be scheduled.

For the convenience of description, N is defined as the first threshold and L is defined as the second threshold below.

320. Extend the paths of the nth TTI to obtain Z paths.

Here, 1≤n≤N. Wherein, the nth TTI refers to any one of the N TTIs included in the to-be-scheduled time range.

In step 310, the value of n is initialized to 1, and then the first scheduling path can be calculated according to subsequent steps 320-360.

330. Determine whether Z exceeds a second threshold. That is, it is judged whether Z is greater than L or not.

If Z>L, go to step 340 . If Z≤L, go to step 350 .

340. Sorting and filtering the Z paths, so as to select L paths from the Z paths for reservation.

350. Determine whether n reaches the first threshold (that is, N).

If n=N, go to step 360 . If n<N, set n=n+1, and jump to step 320 .

360. Output the first scheduling path according to the system state or the preset preference.

The scheduling algorithm adopted in this application is an algorithm designed by introducing a list size L on the basis of the existing Pareto (Pareto) algorithm. Therefore, the scheduling algorithm herein may also be called a Pareto list (list, PL) algorithm.

The goal of the PL algorithm is to obtain a better compromise between the cumulative throughput, fairness and packet loss rate within the time range to be scheduled. The specific implementation of some steps of the PL algorithm shown in FIG. 3 will be described below.

(1) Path expansion involved in step 320 .

To perform path extension on a path (referred to as the lth path hereinafter) at the nth TTI, the extension needs to be performed according to the legitimate users of the lth path at the nth TTI.

Among them, the users who have data packets in the cache and whose channel conditions can support data transmission are legal users. Further, scheduling legal users is a legal decision.

The extended state of the lth path includes the following parameters of the lth path in n TTIs:

(1)

(2)

(3)

表示第l条路径第n个TTI的所有用户的累计吞吐量，

表示第l条路径第n个TTI的用户k的累计吞吐量，

表示第l条路径第n个TTI的公平性参数，K为用户的数量，

表示第l条路径第n个TTI的所有用户的累计丢包率，

表示第l条路径第n个TTI的用户k的累计丢包数，

表示第l条路径第n个TTI的用户k的累计到达数据包的数量。in,

Indicates the cumulative throughput of all users at the nth TTI of the lth path,

Indicates the cumulative throughput of user k in the nth TTI of the l-th path,

Indicates the fairness parameter of the nth TTI of the lth path, K is the number of users,

Indicates the cumulative packet loss rate of all users at the nth TTI of the lth path,

Indicates the accumulated packet loss of user k in the nth TTI of the lth path,

Indicates the cumulative number of arriving data packets of user k at the nth TTI of the lth path.

(2) Sorting and screening of paths involved in step 340 .

If the number of expanded paths (denoted as Z) exceeds L in the nth TTI, it is necessary to sort and filter the expanded Z paths to select L paths from the Z paths.

Since the status of each path includes three indicators of throughput, fairness and packet loss rate, the larger the throughput and fairness, the better, and the smaller the packet loss rate, the better, that is (1-packet loss rate) Bigger is better. It can be seen that there are conflicts among the three indicators and cannot be optimized at the same time.

In order to effectively sort and screen the scheduling paths, this application uses the idea of genetic algorithm to ensure the optimality and diversity of the paths at the same time, and sets three criteria to carry out the Z paths obtained after the expansion of the nth TTI. Sort and filter to select L paths from which to keep.

Criterion 1: Pareto boundary layer numbers are sorted from low to high. In order to ensure that the L paths reserved in the nth TTI are relatively better among the Z paths, the Pareto boundary layers can be sorted on the Z paths.

The Z paths obtained after extending the paths of the nth TTI are used as Z solutions to form a solution set. The Pareto boundary is obtained for the Z solutions, which is marked as Pareto boundary layer 1. Pareto boundaries are obtained for solutions other than Pareto boundary layer 1 in the solution set, which are marked as Pareto boundary layer 2 . By analogy, all the solutions in the solution set are marked with Pareto boundary layer. The smaller the number of Pareto boundary layers, the higher the ranking of solutions.

当且仅当对于所有的目标j，均有For ease of understanding, briefly explain the definition of Pareto's better: x ₁ is better than x ₂ , that is, the necessary and sufficient conditions for

If and only if for all targets j, there is

f ^j (x ₂ )≥f ^j (x ₁ )

and there exists a target i such that

f ⁱ (x ₂ )>f ⁱ (x ₁ )

Among them, f ^j (x ₁ ) is the value of solution x ₁ with respect to target j.

The following description will be made in conjunction with FIG. 4 . Referring to FIG. 4 , FIG. 4 is an illustration of the Pateto boundary of criterion 1 provided by the present application.

Taking two goals as an example (eg, throughput and fairness), the Pareto frontier is a set of optimal compromises between the two goals. As shown in Figure 4, the Pareto boundary layer 1 (solid line) is obtained by solving the Pareto boundary for all solutions, and the solutions on Pareto boundary layer 1 (black solid points) constitute the best compromise set for multiple targets among all solutions. Then find the Pareto boundary for all solutions except the solution in Pareto boundary layer 1, and get Pareto boundary layer 2 (dashed line), then the solution on Pareto boundary layer 2 (black hollow circle) is worse than that on Pareto boundary layer 1 solution, but better than other solutions (such as those on Pareto boundary layer 3). Sorting the solutions according to the Pareto boundary layer is to sort the solutions with respect to the multi-objective compromise.

Criterion 2: In the same Pareto boundary layer, sort from large to small according to the diversity metric and (diversity metric summation, DMS) parameters of the path.

其中，

其中，

表示该Pareto边界层内的解中按目标o排序的最大值。

表示该Pareto边界层内的解中按目标o排序的最小值。

表示按目标o排序排在路径l前后两点的差值的绝对值。按照目标o排序最大和最小的两个点

设置为正无穷。DMS参数越大，说明该解与其它解相距越远，差异性越大。If the DMS parameter of a path is defined as the normalized sum of the absolute values of the differences between the two points before and after the point after sorting each target of the path in the Pareto boundary layer, that is

in,

in,

Indicates the maximum value sorted by objective o among the solutions within this Pareto boundary layer.

Denotes the minimum value of the solutions in this Pareto boundary layer sorted by objective o.

Indicates the absolute value of the difference between the two points before and after the path l sorted by the target o. Sort the largest and smallest two points according to the objective o

Set to positive infinity. The larger the DMS parameter, the farther the solution is from other solutions and the greater the difference.

Guideline 3: When sorting paths, delete all paths whose DMS parameter is 0 in advance.

The purpose of deleting all paths whose DMS parameter is 0 in advance is to further ensure the diversity of paths. If the DMS parameter is 0, it indicates that multiple paths have the same status, that is, the throughput, fairness, and packet loss rate are the same.

In a scheduling problem, multiple paths may converge to the same state, as illustrated below.

When the user channel is constant or slowly changing, the scheduling order of two users with similar scheduling order has little influence on the result. For example, scheduling user 1 at the nth TTI and scheduling user 2 at the n+1th TTI may be the same as scheduling user 2 at the nth TTI and scheduling user1 at the n+1th TTI. If two paths are kept at the same time, the difference of the paths will be small, and finally converge to the similar area on the Pareto boundary, and it is difficult to obtain a solution that meets the requirements.

Therefore, by pre-deleting all paths whose DMS parameters are 0, it is possible to avoid retaining two or more paths that converge to the same state, thereby ensuring the diversity of the last remaining L paths.

(3) Selection of scheduling path.

After path expansion, sorting and screening are performed on the last TTI (that is, when n=N), the final scheduling path can be selected according to a preset preference.

Optionally, the preference may be a throughput threshold, a fairness threshold, a packet loss ratio threshold, or a combination of the three.

Optionally, the preference can also be selected according to the PF algorithm.

Specifically, the threshold is set according to the result of the PF algorithm, for example, the one with the highest throughput among the scheduling paths not worse than the fairness of the PF algorithm is selected, or the one with the highest throughput is allowed to lose certain fairness. For example, the loss of fairness compared to the PF algorithm does not exceed 5%.

The scheduling scheme in the scenario where channel information and data packet information can be accurately obtained is described above. In a non-ideal scenario, channel information and arrival information of data packets cannot be obtained perfectly, which is a scenario closer to reality. In this scenario, the scheduling path output by the scheduling algorithm (that is, the first scheduling path above) cannot be directly used for scheduling within the time range to be scheduled, but the first scheduling path output by the scheduling algorithm needs to be adjusted , and then use the adjusted path for scheduling.

The adjustment process of the scheduling path will be described below with reference to FIG. 5 .

Referring to FIG. 5 , FIG. 5 is a schematic diagram of a process of adjusting a scheduling path provided by the present application.

501. Initialize.

Wherein, the initialization in step 601 includes initializing the sequence s1 as the original scheduling path output by the scheduling algorithm (ie, the first scheduling path), and s2 is an empty set. And, the index n of the TTI is initialized to 1.

At the same time, the length N of the time range to be scheduled is initialized. For example, N=500TTI.

In fact, the first scheduling path includes a decision sequence consisting of M decisions in chronological order, and each decision in the M decisions is used to indicate the terminals scheduled by the network device in the one or more time scheduling units Equipment, M≤N, where both M and N are positive integers.

It should be noted that when M=N, that is, each time scheduling unit corresponds to one decision. When M<N, two or more time scheduling units may correspond to one decision.

For example, the time range to be scheduled includes 500 TTIs in total, and the time scheduling unit is set to 2 TTIs, then there are N=500/2=250 time scheduling units in total. If M=N is set, the first scheduling path may include 250 decisions. If M=N/2 is set, the first scheduling path may include 125 decisions. For example, every 2 time scheduling units (that is, every 4 TTIs) may correspond to a decision.

Here, the mapping relationship between the decision-making and time scheduling units included in the first scheduling path is only an example, and those skilled in the art can easily think of other transformations or designs on the basis of the technical solution disclosed in this application. No longer listed.

502. Search s2 from left to right. If there is a legal decision, schedule users according to the legal decision, delete the legal decision from s2, and jump to 504.

If there is no legal decision in s2, jump to 503.

503. Search s1 from left to right, and if there is a legal decision, schedule users according to the legal decision, and copy and splice the decision sequence before the legal decision to the end of s2. At the same time, delete the legal decision and the decision sequence before the legal decision in s1 and jump to 504 .

If there is no legal decision in s1, then determine the scheduling strategy for the nth TTI according to the result of the PF algorithm or the preset decision, do not update s1 and s2, and jump to 504.

Here, the scheduling policy of the nth TTI refers to how to schedule the terminal equipment in the nth TTI. For example, which terminal devices are scheduled for data transmission at the nth TTI, and how many terminal devices are scheduled.

504. Determine whether n reaches a first threshold N.

If n=N, go to step 505 .

If n<N, set n=n+1 and jump to 502 .

505. Complete the adjustment of the scheduling path, and output the second scheduling path.

In this example, the adjustment of the scheduling path for 500 TTIs is completed.

It can be understood that, in step 504 in FIG. 5 , judging whether n is equal to N actually means that the adjustment of the scheduling path is performed by the scheduling unit by time. In other words, the decision corresponding to each time scheduling unit is adjusted according to the sequence in time.

In another possible implementation, the scheduling path may also be adjusted on a decision-by-decision basis.

In this implementation, the value range of n is [1,M]. At this time, the determination of "n=N?" in step 504 can be replaced by "n=M?". When n=M, it means that the adjustment of M decisions is completed, and the second scheduling path can be output. When n<M, it means that the adjustment of M decisions has not been completed, then let n=n+1, enter the adjustment of the (n+1)th decision.

Similar to the process of adjusting the scheduling path according to the time scheduling unit described above, when adjusting the scheduling path decision-by-decision, it may also include adjusting the order of the M decisions included in the first scheduling path, and/or adjusting the order of the M decisions included in some decisions. The dispatched terminal equipment is adjusted.

An example of path adjustment is given below in conjunction with FIG. 6 . Referring to FIG. 6 , FIG. 6 is a schematic diagram of the process of adjusting the original scheduling path output by the PL algorithm provided in the present application.

其中，序列s1中的每个数字代表一个决策。例如，决策1，决策1，决策2，决策3以及决策4等。As shown in Figure 6, after initializing s1 and s2, s1={1,1,2,3,4,…},

Among them, each number in the sequence s1 represents a decision. For example, Decision 1, Decision 1, Decision 2, Decision 3, Decision 4, etc.

It should be understood that the two decisions 1 in s1 indicate that the contents of the decisions are the same. For example, Decision 1 both directs to schedule User 1 . Therefore, different numbers in s1 and s2 represent different decisions, but only as an example here. Of course, the decisions in s1 can also be numbered 1, 2, 3, 4, 5, ... according to the index order, that is, s1 = {1, 2, 3, 4, 5, ...}, at this time, each number Only indicates the index of the decision, not whether the content of the decision is the same.

In the first TTI, s2 is an empty set, therefore, jump to s1 and search from left to right whether there is a deposit legal decision. Assuming that the first decision 1 in s1 is the legal decision, that is, the legal decision 1, then the user is scheduled according to the legal decision 1 in the first TTI. For example, if legal decision 1 is used to instruct to schedule user 1, then user 1 is scheduled in the first TTI. At the same time, legal decision 1 (the first number 1 in s1) is removed from s1.

In the second TTI, s2 is an empty set, so jump to s1 and search from left to right for legal decisions. Assuming that the decision 2 in s1 is a legal decision at this time, that is, the legal decision 2, the user is scheduled according to the legal decision 2 in the second TTI. For example, if legal decision 2 is used to instruct scheduling of user 2, then user 2 is scheduled in the second TTI. At this point, legal decision 2 is removed from s1, and decision 1 before legal decision 2 is removed from s1 and decision 1 is moved to the tail of s2. Thus, after the adjustment of the scheduling path of the second TTI, s1={3,4,...}, s2={1}.

In the third TTI, search s2 from left to right to determine whether there is a legal decision in s2. Assuming that decision 1 in s2 is a legal decision at this time, that is, legal decision 1, users are scheduled according to legal decision 1 in the third TTI. For example, the legal decision 1 is used to instruct to schedule user 1, then continue to schedule user 1 in the third TTI. At the same time, decision 1 is removed from s2. Thus, after the adjustment of the scheduling path of the third TTI, s1={3,4,...},

And so on, no more details.

At the Nth TTI (that is, the last TTI), search s2 from left to right, if there is no legal decision, jump to s1, and search whether there is a legal decision in s1. Suppose there are no legal decisions in s1 either. At this time, the scheduling of the Nth TTI can be implemented according to the PF algorithm (see the description above) or a preset scheduling decision.

For example, in FIG. 6 , assuming that at the Nth TTI, according to the PF algorithm, the PF value of user 3 is the largest, then user 3 is scheduled at the Nth TTI.

For another example, at the nth TTI (n can take any value from 1 to N), if neither s2 nor s1 has a legal decision, the user is scheduled according to the preset scheduling policy. The preset scheduling decision may be: scheduling the user with the most cached data, or scheduling the user who has been scheduled the least number of times, or scheduling the user with the largest accumulated packet loss, etc. Of course, the scheduling strategy here is only an example, and those skilled in the art can also design other strategies based on the idea of the PL algorithm provided by the present application to seek better scheduling performance.

It can be seen from the example in FIG. 6 that before adjusting the first scheduling path output by the PL algorithm of the present application, the first scheduling path can be expressed as {decision 1, decision 1, decision 2, decision 3, decision 4, ...}. After path adjustment, the new scheduling path can be expressed as {decision 1, decision 2, decision 1, ..., decision 3}.

Here, the new scheduling path is the second scheduling path mentioned in the embodiment of the present application. After adjustment, the second scheduling path is more in line with the actual channel and packet arrival conditions, so that better scheduling performance can be obtained.

It can be found that the process of adjusting the original scheduling path output by the PL algorithm includes adjusting the sequence of decisions included in the original scheduling path, and/or adjusting the terminal devices scheduled by some decisions. Adjusting the scheduled terminal device may include replacing the scheduled terminal device.

It should be noted that when one TTI is used as the time scheduling unit (or time scheduling unit) and one RBG is the frequency scheduling unit (or frequency scheduling unit) in the time range to be scheduled, only a user. However, this application does not limit each TTI to only schedule one user, which depends on the specific implementation of the decision. For example, each TTI can schedule one or more users, and at the same time, the number of users scheduled by the i-th TTI and the j-th TTI can be equal or unequal, which is not limited in this application. Wherein, 1≤i≤N, 1≤j≤N, and i≠j, both i and j are integers.

As mentioned above, the technical solution of the present application is applicable to both the scheduling of uplink data transmission and downlink data transmission.

Referring to FIG. 7 , FIG. 7 is a schematic flowchart of a method for scheduling data transmission provided by the present application.

710. The network device sends a PDCCH to the terminal device, and the PDCCH carries downlink control information (downlink control information, DCI). Wherein, the DCI includes the first field and the second field. The first field is used to indicate resource allocation within m time scheduling units, and the second field is used to indicate time scheduling units.

The terminal device receives the PDCCH and acquires the DCI carried on the PDCCH through blind detection of the PDCCH. According to the first field and the second field of the DCI, the scheduling status, resource allocation status and time scheduling unit of the terminal device by the network device within the waiting time range can be determined.

720. According to the first field and the second field, the terminal device receives downlink data or sends uplink data according to the scheduling of the network device within the to-be-scheduled time range.

Optionally, both the first field and the second field may be one or more.

According to the scheduling scheme of this application, when the channel conditions and the arrival of data packets are relatively stable, and there are enough data packets in the user's buffer to support data transmission, the network equipment can schedule the terminal equipment in m scheduling time units through a PDCCH The data transmission in the following (m-1) time scheduling units can save the overhead of the PDCCH, m≤N.

Optionally, as an example, the format of the DCI may be as shown in FIG. 8 .

Referring to FIG. 8, FIG. 8 is an example of the format of the DCI. As shown in FIG. 8 , the DCI may include a field for indicating resource allocation in N time scheduling units, and an indication of the MCS of the corresponding resource. For example, the fields “F resources (F resources)” and “T resources (T resources)” shown in FIG. 9 . In addition, the DCI may also include a field for indicating the time scheduling unit, such as the field "T index (T index)" shown in Figure 7, for example, "T index 1 (T index 1)", "T index 2 (T index 2)" and so on.

Optionally, the field used to indicate the time scheduling unit (that is, the second field) may not indicate each index, but indicate a scheduling time length p, for example, indicating p=10, which represents the resource allocation of this PDCC scheduling One-time indicates resource allocation within the next 10 time scheduling units. Alternatively, the length of the to-be-scheduled time range may also be determined implicitly through the number of F resource or T resource indication fields.

The method for scheduling data transmission provided by this application has been described in detail above. It can be seen that in the technical solution of this application, by using the pre-acquired channel information and the arrival information of data packets within a certain period of time in the future (that is, the time range to be scheduled), the continuous scheduling within the time range to be scheduled is obtained through the scheduling algorithm. path, and then adjust the scheduling path according to the channel and data packet arrival in the actual scene and use it for scheduling. In this application, due to the consideration of long-term multi-resource unit joint scheduling, compared with the existing PF algorithm, it has better throughput, fairness and packet loss rate performance, which helps to improve the performance of the communication system .

In addition, by adding a field in the DCI, it is possible to indicate resource allocation conditions in multiple time scheduling units in one PDCCH, which can save the overhead of the PDCCH. At the same time, the terminal device can reduce the number of blind detections and reduce power consumption.

The simulation of the technical solution provided by this application has improved performance compared with the PF algorithm.

See Table 5, Table 5 lists the simulation conditions and simulation parameters.

table 5

When prediction assumption 1 is satisfied, the gains of the throughput, fairness and packet loss rate of the present application relative to the PF algorithm are shown in (a) and (b) of Figure 9 .

Referring to FIG. 9 , FIG. 9 is a simulation diagram of the technical solution of the present application relative to the gain of the PF algorithm. As shown in (a) of Figure 9, when the preference is set to 1, that is, when the fairness is not worse than the PF algorithm scheduling, both the throughput gain and the packet loss rate are about 15%. As shown in (b) of Figure 9, when the preference is set to 2, that is, compared with the PF algorithm, when the fairness loss is not greater than 5%, the throughput gain is about 20%, and the packet loss rate gain is about 15% %.

The simulation results show that under ideal conditions, assuming that channel prediction and data packet arrival can be perfectly obtained, the technical solution of this application has a greater improvement in system performance compared with the existing PF algorithm. Under the premise of allowing a certain loss of fairness, the throughput can be further improved.

When the prediction assumption 2 is satisfied, the gains of the throughput, fairness, and packet loss rate of the proposed scheme compared with PF scheduling are shown in (a) and (b) of Figure 10 .

Referring to FIG. 10 , FIG. 10 is a simulation diagram of the technical solution of the present application relative to the gain of the PF algorithm. As shown in (a) and (b) of Figure 10, when the preference setting is 1, the throughput gain is about 8%, and the packet loss rate gain is about 10%. With preference setting 2, the throughput gain is 15%, and the packet loss rate gain is 11%.

The simulation results show that in actual conditions, because the channel prediction and packet arrival prediction results are different from the actual channel and packet arrival conditions, the throughput gain and packet loss rate gain are both lost compared to the ideal situation, but the overall performance is still the same. Compared with PF scheduling, it has great advantages.

When prediction assumption 3 is satisfied, the gains of the throughput, fairness and packet loss rate of this application relative to the PF algorithm are shown in (a) and (b) of Figure 11 .

Referring to FIG. 11 , FIG. 11 is a simulation diagram of the technical solution of the present application relative to the gain of the PF algorithm. As shown in (a) of Figure 11, when the preference is set to 1, the throughput gain is about 12%, and the packet loss rate gain is 12%. As shown in (b) of Figure 11, when the preference is set to 2, the throughput gain is about 18%, and the packet loss rate gain is 12%.

The simulation results show that the system performance when the prediction assumption 3 is satisfied is improved compared to the system performance when the prediction assumption 2 is satisfied, because it is assumed that the channel prediction can better predict the time-varying state of the channel.

The following describes the device for scheduling data transmission provided by this application.

Referring to FIG. 12 , FIG. 12 is a schematic block diagram of a communication device provided by the present application. As shown in FIG. 12 , the communication device 1000 includes an acquiring unit 1100 , a determining unit 1200 and a scheduling unit 1300 .

The acquiring unit 1100 is configured to acquire channel information, arrival information of data packets, and scheduling parameters within the time range to be scheduled, wherein the scheduling parameters are used to configure a scheduling algorithm, and the scheduling algorithm is used to schedule all expanding the paths in each time scheduling unit included in the scheduling time range, so as to obtain the optimal compromise scheduling path of at least two performance indicators of the communication system within the to-be-scheduled time range;

The determining unit 1200 is configured to determine a first scheduling path according to the channel information, the arrival information of the data packet, the scheduling parameter, and the scheduling algorithm, where the first scheduling path is used to indicate the The decision to schedule terminal equipment for data transmission within the time range to be scheduled;

The scheduling unit 1300 is configured to schedule data transmission of the terminal device within the time range to be scheduled according to the first scheduling path.

Optionally, in an embodiment, the scheduling parameters include one or more of the following parameters:

The number of scheduled terminal devices, the number of flows, the scheduling unit of time-frequency resources, the length N of the time range to be scheduled, the list size L of the scheduling algorithm, and the packet arrival distribution model of data packets, wherein the time-frequency The resource scheduling unit includes the time scheduling unit and the frequency scheduling unit, and N and M are positive integers.

Optionally, in an embodiment, the time range to be scheduled includes N time scheduling units,

The determining unit is specifically used for:

(1) Extend the paths in the nth time scheduling unit to obtain Z paths, and judge whether Z is greater than L;

(2) When Z>L, sort and filter the Z paths, and select L paths from the Z paths;

(3) judge whether n is equal to N;

(4) When n<N, make n=n+1, and return to (1); when n=N, determine the first scheduling path according to the preset system preference or threshold, and the system preference Or the threshold is set according to at least one performance index of the communication system, where 1≤n≤N, Z, L, and N are all positive integers.

Optionally, in one embodiment, the determining unit is specifically configured to:

When Z>L, the Z paths are sorted and screened according to the following criteria, so as to select the L paths from the Z paths;

Determine the Pareto boundary according to the Z paths obtained by expanding in the nth time scheduling unit, and sort the path with the smaller number of Pareto boundary layers;

The paths in the same Pareto boundary layer are sorted from large to small according to the path difference measure and DMS parameters;

Before sorting the Z paths, all paths with a DMS parameter of 0 in the Z paths are deleted in advance.

Optionally, in one embodiment, the determining unit is specifically configured to:

(1) Extend the paths in the nth time scheduling unit to obtain Z paths, and judge whether Z is greater than L;

(2) When Z≤L, judge whether n is equal to N;

(3) When n<N, make n=n+1, and return to (1); when n=N, output the first scheduling path according to the preset system preference or threshold, and the system preference Or the threshold is set according to at least one performance index of the communication system, where 1≤n≤N, Z, L, and N are all positive integers.

Optionally, in one embodiment, the determining unit is configured to:

According to the legal decision in the nth time scheduling unit, the path in the nth time scheduling unit is extended, wherein the legal decision in the nth time scheduling unit refers to the path in the nth time scheduling unit The decision to schedule the legal terminal device in the nth time unit within the nth time scheduling unit, wherein the legal terminal device in the nth time scheduling unit means that the legal terminal device in the nth time scheduling unit satisfies the A terminal device whose buffered data volume is greater than or equal to the preset threshold and whose corresponding channel supports data transmission;

Optionally, in one embodiment, the scheduling unit is further configured to:

adjusting the first scheduling path to obtain a second scheduling path;

According to the second scheduling path, data transmission of the terminal device is scheduled within the to-be-scheduled time range.

Optionally, in an embodiment, the first scheduling path includes a decision sequence consisting of M decisions in chronological order, each of the M decisions is used to indicate that one or more of the The terminal equipment scheduled in the scheduling time unit, M≤N and M is an integer,

The scheduling unit is specifically used for:

Adjusting the order of the M decisions; and/or adjusting the terminal devices scheduled by one or more of the M decisions to obtain the second scheduling path.

Optionally, in an embodiment, the scheduling unit is specifically configured to:

(1) Initialize the first decision sequence and the second decision sequence, wherein the initialized first decision sequence is the decision sequence composed of the M decisions in chronological order, and the second decision sequence is empty set;

(2) In the nth time scheduling unit, if the second decision sequence includes the first legal decision of scheduling terminal equipment for data transmission in the nth time scheduling unit, then in the nth time scheduling unit In the time scheduling unit, schedule the terminal device to perform data transmission according to the first legal decision, delete the first legal decision from the second decision sequence, and enter (4); if there is no Including a legal decision to schedule terminal equipment for data transmission within the nth time scheduling unit, then enter (3);

(3) In the nth time scheduling unit, if the first decision sequence includes the first legal decision to schedule the terminal device for data transmission in the nth time scheduling unit, then in the nth time scheduling unit Scheduling the terminal device for data transmission according to the first legal decision within the time scheduling unit, and deleting other decisions in the first decision sequence that are before the first legal decision from the first decision sequence and moving them to At the end of the second decision sequence, enter (4); if the first decision sequence does not include the first legal decision to schedule the terminal device for data transmission in the nth time scheduling unit, according to the preset The scheduled scheduling policy schedules the terminal equipment for data transmission, and enters

(4), wherein, the preset scheduling policy is set according to at least one performance index of the communication system;

(4) judge whether n is equal to N;

(5) When n<N, make n=n+1, and return to (1); when n=N, output the second scheduling path according to the preset system preference or threshold, the system preference Or the threshold is set according to at least one performance index of the communication system, where 1≤n≤N, Z, L, and N are all positive integers.

Optionally, in one embodiment, the device further includes:

The transceiver unit 1400 is configured to send downlink control information DCI to the terminal device, the DCI carries scheduling information in a first time range, the length of the first time range is equal to m time scheduling units, m≤N and m is an integer, and the scheduling information of the first time range is used to indicate resources used by the terminal device for data transmission within the first time range.

Optionally, in an embodiment, the DCI carries scheduling information in a first time range, including:

The DCI includes a first field and a second field, the first field is used to indicate resource allocation within the first time range, and the second field is used to indicate the time scheduling unit.

Optionally, the transceiver unit 1400 may also be replaced by a sending unit or a receiving unit. For example, when the transceiving unit 1400 performs the action of sending, it may be replaced by a sending unit. When the transceiver unit 140 performs the receiving action, it may be replaced by a receiving unit.

Optionally, the communication apparatus 1000 may be an access network device (for example, a base station) or other network device that can be used to schedule terminal devices for data transmission, or a device in the network device that can implement the functions of the network device in the above method embodiments , components, etc.

For example, the transceiving unit 1400 may be a transceiver. Transceivers can be replaced by receivers or transmitters. For example, the transceiver may be replaced by the transmitter when performing the action of sending. When the transceiver performs the receiving action, it can be replaced by the receiver. The obtaining unit 1100, the determining unit 1200, and the scheduling unit 1300 may be physically integrated into a processing unit, and the processing unit may be a processing device or a processor. Alternatively, the obtaining unit 1100, the determining unit 1200, and the scheduling unit 130 are physically set separately, and each unit is respectively implemented by a processing device or a processor, which is not limited here.

Optionally, the communication apparatus 1000 may be a circuit system installed in a network device, for example, a chip or a system on chip (system on chip, SoC), etc. The acquiring unit 1100, the determining unit 1200, and the scheduling unit 1300 may each be a module or unit of the circuit system, or all functions thereof may be realized by one module or unit (for example, a processing unit). In this implementation manner, the transceiver unit 1400 may be a communication interface. For example, the transceiver unit 1400 may be an input-output interface or an input-output circuit. The input and output interfaces may include input interfaces and output interfaces. The input and output circuits may include input circuits and output circuits.

Wherein, the functions of the processing device in the above device embodiments may be realized by hardware, or may be realized by executing corresponding software by hardware.

For example, a processing device may include one or more memories and one or more processors, wherein the one or more memories are used to store computer programs, and the one or more processors read and execute the one or more The computer programs stored in multiple memories enable the communication device 1000 to perform the operations and/or processes performed by the network device in each method embodiment.

Alternatively, the processing means may comprise only a processor, and the memory for storing the computer program is located outside the processing means. The processor is connected to the memory through circuits/wires to read and execute the computer programs stored in the memory.

Optionally, the transceiver unit 1400 may be a radio frequency device. The acquiring unit 1100, the determining unit 1200 and the scheduling unit 1300 may be integrated on the baseband device.

Referring to FIG. 13 , FIG. 13 is a schematic structural diagram of a communication device 10 provided in the present application. As shown in FIG. 13 , the communication device 10 includes: one or more processors 11 , one or more memories 12 , and one or more communication interfaces 13 . Among them, the processor 11 is used to control the communication interface 13 to send and receive signals, the memory 12 is used to store computer programs, and the processor 11 is used to call and run the computer programs from the memory 12, so that the communication device 10 executes various methods of the present application. Examples include processing and/or operations performed by network devices.

For example, the processor 11 may integrate the functions of the acquiring unit 1100 , the determining unit 1200 and the scheduling unit 1300 in FIG. 12 , and the communication interface 13 may have the functions of the transceiver unit 1400 shown in FIG. 12 . For details, refer to the detailed description in FIG. 12 , which will not be repeated here.

Optionally, when the communication device 10 is a network device, the processor 11 may be a baseband device installed in the network device, and the communication interface 13 may be a radio frequency device.

Optionally, the memory and the memory in the foregoing apparatus embodiments may be physically independent units, or the memory may also be integrated with the processor.

In addition, the present application also provides a computer-readable storage medium, and computer instructions are stored in the computer-readable storage medium. When the computer instructions are run on the computer, the computer is made to execute the method for scheduling data transmission provided by the application. Actions and/or processing performed.

The present application also provides a computer program product, the computer program product includes computer program code, and when the computer program code is run on the computer, the computer is made to perform the operations performed by the network device in the method for scheduling data transmission provided in the present application and/or deal with.

The present application also provides a communication device, including a processor and an interface circuit, the interface circuit is used to receive computer codes or instructions and transmit them to the processor, and the processor is used to run the computer codes or instructions to Execute the operations and/or processes performed by the network device in the method for scheduling data transmission provided in this application.

The present application also provides a chip, and the chip includes one or more processors. The one or more processors are configured to execute the computer program stored in the memory, so as to execute the operation and/or processing performed by the network device in any one method embodiment. Wherein, the memory for storing computer programs is set independently from the chip.

Further, the chip may further include one or more communication interfaces. The one or more communication interfaces may be input/output interfaces, input/output circuits, and the like. Further, the chip may further include one or more memories.

The present application also provides a wireless communication system, including the network device in the embodiment of the present application.

The processor in this embodiment of the present application may be an integrated circuit chip capable of processing signals. In the implementation process, each step of the above-mentioned method embodiments may be completed by an integrated logic circuit of hardware in a processor or instructions in the form of software. The processor can be 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 devices, discrete gate or transistor logic devices, discrete hardware components. A general-purpose processor may be a microprocessor, or the processor may be any conventional processor, or the like. The steps of the methods disclosed in the embodiments of the present application may be directly implemented by a hardware coded processor, or executed by a combination of hardware and software modules in the coded processor. The software module can be located in a mature storage medium in the field such as random access memory, flash memory, read-only memory, programmable read-only memory or electrically erasable programmable memory, register. The storage medium is located in the memory, and the processor reads the information in the memory, and completes the steps of the above method in combination with its hardware.

The memory in the embodiments of the present application may be a volatile memory or a nonvolatile memory, or may include both volatile and nonvolatile memories. Among them, the non-volatile memory can be read-only memory (read-only memory, ROM), programmable read-only memory (programmable ROM, PROM), erasable programmable read-only memory (erasable PROM, EPROM), electrically erasable In addition to programmable read-only memory (electrically EPROM, EEPROM) or flash memory. The volatile memory can be random access memory (RAM), which acts as external cache memory. By way of illustration and not limitation, many forms of RAM are available such as static random access memory (static RAM, SRAM), dynamic random access memory (dynamic RAM, DRAM), synchronous dynamic random access memory (synchronous DRAM, SDRAM) ), double data rate synchronous dynamic random access memory (double data rate SDRAM, DDRSDRAM), enhanced synchronous dynamic random access memory (enhanced SDRAM, ESDRAM), synchronous connection dynamic random access memory (synchlink DRAM, SLDRAM) and Direct memory bus random access memory (direct rambusRAM, DRRAM). It should be noted that the memory of the systems and methods described herein is intended to include, but not be limited to, these and any other suitable types of memory.

The terms "unit", "system" and the like are used in this specification to denote a computer-related entity, hardware, firmware, a combination of hardware and software, software or software in execution. For example, a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a computing device and the computing device can be components. One or more components can reside within a process and/or thread of execution. A component can be localized on one computer and/or distributed between two or more computers. In addition, these components can execute from various computer readable media having various data structures stored thereon. A component may be based on a system having one or more data packets (e.g., data from two components interacting with another component between a local system, a distributed system, and/or a network, such as the Internet that interacts with other systems through signals). Signals are communicated through local and/or remote processes.

Those skilled in the art can appreciate that the units and algorithm steps of the examples described in conjunction with the embodiments disclosed herein can be implemented by electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are executed by hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art may use different methods to implement the described functions for each specific application, but such implementation should not be regarded as exceeding the scope of the present application.

Those skilled in the art can clearly understand that for the convenience and brevity of the description, the specific working process of the above-described system, device and unit can refer to the corresponding process in the foregoing method embodiment, which will not be repeated here.

In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods may be implemented in other ways. For example, the device embodiments described above are only illustrative. For example, the division of the units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components can be combined or May be integrated into another system, or some features may be ignored, or not implemented. In another point, the mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces, and the indirect coupling or communication connection of devices or units may be in electrical, mechanical or other forms.

The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place, or may be distributed to multiple network units. Part or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, each unit may exist separately physically, or two or more units may be integrated into one unit.

If the functions described above are realized in the form of software function units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the prior art or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including Several instructions are used to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the methods described in the various embodiments of the present application. The aforementioned storage medium includes: various media capable of storing program codes such as U disk, mobile hard disk, read-only memory, random access memory, magnetic disk or optical disk.

The above is only a specific implementation of the application, but the scope of protection of the application is not limited thereto. Anyone familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the application. Should be covered within the protection scope of this application. Therefore, the protection scope of the present application should be determined by the protection scope of the claims.

Claims (26)

1. A method of scheduling data transmission, comprising:

acquiring channel information, arrival information of a data packet and scheduling parameters within a time range to be scheduled, wherein the scheduling parameters are used for configuring a scheduling algorithm, and the scheduling algorithm is used for expanding paths in each time scheduling unit included in the time range to be scheduled according to the time sequence so as to obtain a scheduling path of optimal compromise of at least two performance indexes of the communication system within the time range to be scheduled;

determining a first scheduling path according to the channel information, the arrival information of the data packet, the scheduling parameter and the scheduling algorithm, wherein the first scheduling path is used for indicating a decision for scheduling the terminal equipment to perform data transmission in the time range to be scheduled;

and scheduling data transmission of the terminal equipment within the time range to be scheduled according to the first scheduling path.

2. The method of claim 1, wherein the scheduling parameters comprise one or more of the following parameters:

the scheduling method comprises the steps of scheduling the number of scheduled terminal devices, the number of streams, scheduling units of time-frequency resources, the length N of a time range to be scheduled, the list size L of a scheduling algorithm and a packet arrival distribution model of a data packet, wherein the scheduling units of the time-frequency resources comprise time scheduling units and frequency scheduling units, and N and L are positive integers.

3. The method of claim 2, wherein the time range to be scheduled comprises N of the time scheduling units,

the determining a first scheduling path according to the channel information, the arrival information of the data packet, the scheduling parameter, and the scheduling algorithm includes:

(1) Expanding the path in the nth time scheduling unit to obtain Z paths, and judging whether Z is greater than L;

(2) When Z is greater than L, sorting and screening the Z paths, and selecting L paths from the Z paths;

(3) Judging whether N is equal to N;

(4) When N < N, let N = N +1 and return to (1); and when N = N, outputting the first scheduling path according to a preset system preference or threshold, wherein the system preference or threshold is set according to at least one performance index of the communication system, N is more than or equal to 1 and less than or equal to N, and Z, L and N are positive integers.

4. The method according to claim 3, wherein said sorting and filtering said Z paths to select L paths from said Z paths when Z > L comprises:

when Z > L, sorting and screening the Z paths according to the following criteria to select the L paths from the Z paths:

determining a pareto boundary according to the Z paths expanded in the nth time scheduling unit, and sequencing the paths with smaller layer number of the pareto boundary to be more front;

paths in the same pareto boundary layer are sorted from large to small according to path difference measurement and DMS parameters;

and deleting all paths with DMS parameters of 0 in the Z paths in advance before sequencing the Z paths.

5. The method of claim 2, wherein the time range to be scheduled comprises N time scheduling units,

the determining a first scheduling path according to the channel information, the arrival information of the data packet, the scheduling parameter, and the scheduling algorithm includes:

(1) Expanding the paths in the nth time scheduling unit to obtain Z paths, and judging whether Z is greater than L;

(2) When Z is less than or equal to L, judging whether N is equal to N or not;

(3) When N < N, let N = N +1 and return to (1); and when N = N, outputting the first scheduling path according to a preset system preference or threshold, wherein the system preference or threshold is set according to at least one performance index of the at least two performance indexes, N is more than or equal to 1 and less than or equal to N, and Z, L and N are positive integers.

6. The method according to any one of claims 3-5, wherein the expanding the path in the nth time scheduling unit to obtain Z paths comprises:

and expanding the path in the nth time scheduling unit according to a legal decision in the nth time scheduling unit, wherein the legal decision in the nth time scheduling unit is a decision for scheduling legal terminal equipment in the nth time scheduling unit, and the legal terminal equipment in the nth time scheduling unit is terminal equipment which meets the condition that the amount of cache data in the nth time scheduling unit is greater than or equal to a preset threshold and a corresponding channel supports data transmission.

7. The method according to any of claims 1-5, wherein said scheduling data transmissions for terminal devices according to said first scheduling path comprises:

adjusting the first scheduling path to obtain a second scheduling path;

and scheduling data transmission of the terminal equipment within the time range to be scheduled according to the second scheduling path.

8. The method of claim 7, wherein the first scheduling path comprises a time-wise ordered decision sequence of M decisions, each of the M decisions indicating a terminal device scheduled by a network device within one or more of the time scheduling units, M ≦ N and M being an integer,

the adjusting the first scheduling path to obtain a second scheduling path includes:

adjusting the order of the M decisions; and/or adjusting the terminal equipment scheduled by one or more of the M decisions to obtain the second scheduling path.

9. The method of claim 8, wherein the adjusting the order of the M decisions and/or the adjusting the scheduled terminal device for one or more of the M decisions comprises:

(1) Initializing a first decision sequence and a second decision sequence, wherein the initialized first decision sequence is the decision sequence formed by the M decisions in sequence, and the second decision sequence is an empty set;

(2) In the nth time scheduling unit, if the second decision sequence comprises a first legal decision for scheduling terminal equipment in the nth time scheduling unit to carry out data transmission, scheduling the terminal equipment in the nth time scheduling unit to carry out data transmission according to the first legal decision, deleting the first legal decision from the second decision sequence, and entering (4); if the second decision sequence does not contain a legal decision for scheduling the terminal equipment in the nth time scheduling unit to carry out data transmission, entering (3);

(3) In the nth time scheduling unit, if the first decision sequence includes a first legal decision for scheduling terminal equipment in the nth time scheduling unit to perform data transmission, scheduling the terminal equipment in the nth time scheduling unit to perform data transmission according to the first legal decision, deleting other decisions in the first decision sequence before the first legal decision from the first decision sequence, moving the other decisions to the tail of the second decision sequence, and entering (4); if the first decision sequence does not contain the first legal decision for scheduling the terminal equipment to transmit data in the nth time scheduling unit, scheduling the terminal equipment to transmit data according to a preset scheduling strategy, and entering (4), wherein the preset scheduling strategy is set according to at least one performance index of the at least two performance indexes;

(4) Judging whether N is equal to N;

(5) When N < N, let N = N +1 and return to (1); and when N = N, outputting the second scheduling path according to a preset system preference or threshold, wherein the system preference or threshold is set according to at least one performance index of the at least two performance indexes, N is more than or equal to 1 and less than or equal to N, and Z, L and N are positive integers.

10. The method according to any of claims 1-5, wherein said scheduling data transmissions for terminal devices according to said first scheduling path comprises:

sending Downlink Control Information (DCI) to terminal equipment, wherein the DCI carries scheduling information of a first time range, the length of the first time range is equal to m time scheduling units, m is less than or equal to N and is an integer, and the scheduling information of the first time range is used for indicating resources used for data transmission by the terminal equipment in the first time range.

11. The method of claim 10, wherein the DCI carrying the scheduling information for the first time range comprises:

the DCI includes a first field to indicate resource allocation in the first time range and a second field to indicate the time scheduling unit.

12. An apparatus for scheduling data transmissions, comprising:

the scheduling method comprises the steps that an obtaining unit is used for obtaining channel information, arrival information of data packets and scheduling parameters in a time range to be scheduled, wherein the scheduling parameters are used for configuring a scheduling algorithm, and the scheduling algorithm is used for expanding paths in each time scheduling unit included in the scheduling time range according to the sequence of time so as to obtain optimal compromise scheduling paths of at least two performance indexes of a communication system in the time range to be scheduled;

a determining unit, configured to determine a first scheduling path according to the channel information, the arrival information of the data packet, the scheduling parameter, and the scheduling algorithm, where the first scheduling path is used to indicate a decision for scheduling a terminal device to perform data transmission within the time range to be scheduled;

and the scheduling unit is used for scheduling the data transmission of the terminal equipment within the time range to be scheduled according to the first scheduling path.

13. The apparatus of claim 12, wherein the scheduling parameters comprise one or more of:

the scheduling method comprises the steps of the number of scheduled terminal devices, the number of streams, scheduling units of time-frequency resources, the length N of a time range to be scheduled, the list size L of a scheduling algorithm and a packet arrival distribution model of a data packet, wherein the scheduling units of the time-frequency resources comprise the time scheduling units and the frequency scheduling units, and N is a positive integer.

14. The apparatus of claim 13, wherein the time range to be scheduled comprises N of the time scheduling units,

the determining unit is specifically configured to:

(1) Expanding the path in the nth time scheduling unit to obtain Z paths, and judging whether Z is greater than L;

(2) When Z is greater than L, sorting and screening the Z paths, and selecting L paths from the Z paths;

(3) Judging whether N is equal to N;

(4) When N < N, let N = N +1 and return to (1); and when N = N, outputting the first scheduling path according to a preset system preference or threshold, wherein the system preference or threshold is set according to at least one performance index of the communication system, N is more than or equal to 1 and less than or equal to N, and Z, L and N are positive integers.

15. The apparatus according to claim 14, wherein the determining unit is specifically configured to:

when Z is greater than L, sorting and screening the Z paths according to the following criteria to select the L paths from the Z paths;

determining a pareto boundary according to the Z paths expanded in the nth time scheduling unit, and sequencing the paths with smaller layer number of the pareto boundary to be more front;

paths in the same pareto boundary layer are sorted from large to small according to path difference measurement and DMS parameters;

and deleting all paths with DMS parameters of 0 in the Z paths in advance before sorting the Z paths.

16. The apparatus according to claim 12, wherein the determining unit is specifically configured to:

(1) Expanding the path in the nth time scheduling unit to obtain Z paths, and judging whether Z is greater than L;

(2) When Z is less than or equal to L, judging whether N is equal to N;

(3) When N < N, let N = N +1 and return to (1); and when N = N, outputting the first scheduling path according to a preset system preference or threshold, wherein the system preference or threshold is set according to at least one performance index of the communication system, N is more than or equal to 1 and less than or equal to N, and Z, L and N are positive integers.

17. The apparatus according to any of claims 14-16, wherein the determining unit is configured to:

and expanding the path in the nth time scheduling unit according to a legal decision in the nth time scheduling unit, wherein the legal decision in the nth time scheduling unit is a decision for scheduling legal terminal equipment in the nth time scheduling unit, and the legal terminal equipment in the nth time scheduling unit is terminal equipment which meets the condition that the amount of cache data in the nth time scheduling unit is greater than or equal to a preset threshold and a corresponding channel supports data transmission.

18. The apparatus according to any of claims 12-16, wherein the scheduling unit is further configured to:

adjusting the first scheduling path to obtain a second scheduling path;

and scheduling data transmission of the terminal equipment within the time range to be scheduled according to the second scheduling path.

19. The apparatus of claim 18, wherein the first scheduling path comprises a decision sequence consisting of M decisions in chronological order, each of the M decisions indicating terminal devices scheduled within one or more of the time scheduling units, M ≦ N and M being an integer,

the scheduling unit is specifically configured to:

adjusting the order of the M decisions; and/or adjusting the terminal equipment scheduled by one or more of the M decisions to obtain the second scheduling path.

20. The apparatus of claim 19, wherein the scheduling unit is specifically configured to:

(1) Initializing a first decision sequence and a second decision sequence, wherein the initialized first decision sequence is the decision sequence formed by the M decisions according to the time sequence, and the second decision sequence is an empty set;

(2) In the nth time scheduling unit, if the second decision sequence comprises a first legal decision for scheduling terminal equipment in the nth time scheduling unit to perform data transmission, scheduling the terminal equipment in the nth time scheduling unit to perform data transmission according to the first legal decision, deleting the first legal decision from the second decision sequence, and entering (4); if the second decision sequence does not contain a legal decision for scheduling the terminal equipment in the nth time scheduling unit to carry out data transmission, entering (3);

(3) In the nth time scheduling unit, if the first decision sequence includes a first legal decision for scheduling terminal equipment in the nth time scheduling unit to perform data transmission, scheduling the terminal equipment in the nth time scheduling unit to perform data transmission according to the first legal decision, deleting other decisions in the first decision sequence before the first legal decision from the first decision sequence, moving the other decisions to the tail of the second decision sequence, and entering (4); if the first decision sequence does not contain the first legal decision for scheduling the terminal equipment to perform data transmission in the nth time scheduling unit, scheduling the terminal equipment to perform data transmission according to a preset scheduling strategy, and entering (4), wherein the preset scheduling strategy is set according to at least one performance index of the communication system;

(4) Judging whether N is equal to N;

(5) When N < N, let N = N +1 and return to (1); and when N = N, outputting the second scheduling path according to a preset system preference or threshold, wherein the system preference or threshold is set according to at least one performance index of the communication system, N is more than or equal to 1 and less than or equal to N, and Z, L and N are positive integers.

21. The apparatus according to any one of claims 12-16, further comprising:

a receiving and sending unit, configured to send downlink control information DCI to the terminal device, where the DCI carries scheduling information in a first time range, a length of the first time range is equal to m time scheduling units, m is equal to or less than N and m is an integer, and the scheduling information in the first time range is used to indicate resources used by the terminal device for data transmission in the first time range.

22. The apparatus of claim 21, wherein the DCI carrying the scheduling information for the first time range comprises:

the DCI includes a first field to indicate resource allocation in the first time range and a second field to indicate the time scheduling unit.

23. A communications apparatus comprising at least one processor coupled with at least one memory:

the at least one processor configured to execute computer programs or instructions stored in the at least one memory to cause the terminal device to perform the method of any of claims 1-11.

24. A computer-readable storage medium storing computer instructions that, when executed, implement the method of any one of claims 1-11.

25. A communication device comprising a processor and interface circuitry;

the interface circuit is used for receiving codes or instructions and transmitting the codes or instructions to the processor;

the processor is configured to execute the code or instructions to perform the method of any of claims 1-11.

26. A wireless communication system, characterized in that it comprises means for scheduling data transmission according to any of claims 12-22.

Images