CN112752347B

CN112752347B - Method and apparatus for scheduling data transmission

Info

Publication number: CN112752347B
Application number: CN201911049506.0A
Authority: CN
Inventors: 于天航; 王坚; 孔垂丽; 徐晨; 李榕
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2019-10-31
Filing date: 2019-10-31
Publication date: 2023-04-07
Anticipated expiration: 2039-10-31
Also published as: CN112752347A

Abstract

The network equipment obtains channel information, arrival information of data packets and scheduling parameters in a time range to be scheduled, and expands paths in each time scheduling unit included in the time range to be scheduled according to the time sequence through a scheduling algorithm, so that a scheduling path of optimal compromise of at least two performance indexes of a communication system in the time range to be scheduled is obtained. According to the scheduling path, the data transmission of the terminal equipment is scheduled in the scheduling time range, so that better compromise of performance indexes such as throughput, fairness and packet loss rate of the communication system can be realized, and the scheduling performance of the communication system is improved.

Description

Method and apparatus for scheduling data transmission

Technical Field

The present application relates to the field of wireless communication technologies, and in particular, to a method and an apparatus for scheduling data transmission.

Background

In a cellular network, media Access Control (MAC) layer scheduling is mainly used to solve the problems of time-frequency resource allocation, modulation and Coding Scheme (MCS) selection, user pairing, precoding, and the like. A trade-off between throughput and fairness of the communication system may be achieved by scheduling.

The existing scheduling algorithm of the MAC layer often models a communication system into a determined model, and a scheduling scheme is obtained through derivation of a formula on the basis of the model. Common scheduling algorithms are Round Robin (RR) algorithm, max carrier-to-interference ratio (Max C/I) algorithm, and Proportional Fair (PF) algorithm. The PF algorithm can realize good compromise between throughput and fairness, and is widely applied.

However, due to the complexity of the communication system, it is not possible to model it accurately with closed models and formulas. Therefore, a formula-based scheduling algorithm may not achieve superior communication system performance.

Disclosure of Invention

The application provides a method and a device for scheduling data transmission, which are beneficial to improving 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, 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 in the time range to be scheduled according to the first scheduling path.

In the scheduling algorithm for scheduling the terminal device to perform data transmission, the network device determines the scheduling path by sequentially performing path expansion according to the time sequence in the time scheduling units included in the time unit to be scheduled, or in other words, takes the joint scheduling of a plurality of time scheduling units within a period of time into consideration, so that at least two performance indexes of the communication system, such as throughput, fairness of scheduling, packet loss rate and the like, can be optimally compromised. Accordingly, scheduling performance of the communication system can be improved.

With reference to the first aspect, in certain implementations of the first aspect, the scheduling parameters include one or more of the following parameters: 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 time scheduling units and frequency scheduling units.

With reference to the first aspect, in some implementation manners of the first aspect, 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 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.

The scheduling algorithm introduces the list size L on the basis of the existing Pareto (Pareto) algorithm, path expansion, possible path sequencing and screening are carried out in each time scheduling unit according to the time sequence, and compromise of better throughput, fairness and packet loss rate can be achieved.

With reference to the first aspect, in certain implementations of the first aspect, the sorting and screening the Z paths to select L paths from the Z paths when Z > L includes: 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 obtained by expanding 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.

Because the state of each path contains different performance indexes such as throughput, fairness and packet loss rate, and the performance indexes may conflict with each other, the performance indexes cannot be optimized simultaneously. For example, pursuit of maximum throughput necessarily results in poor fairness. According to the method and the device, the three criteria are set to sort and screen the Z paths obtained after the N time scheduling unit is expanded, and the superiority and difference of the paths can be guaranteed.

With reference to the first aspect, in some implementation manners of the first aspect, 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, determining the first scheduling path according to 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.

With reference to the first aspect, in some implementation manners of the first aspect, the expanding the path in the nth time scheduling unit to obtain Z paths includes: 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 the 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 the corresponding channel supports data transmission.

The existing PF algorithm and other scheduling schemes that are determined by modeling a communication system using a closed model and formula do not consider the data caching situation and the channel situation of the terminal device, but schedule according to the model of the communication system established by the idealized parameters may not meet the actual scenario. In contrast, according to the scheduling method and the scheduling device, in each time scheduling unit in the time range to be scheduled, legal terminal equipment is scheduled according to legal decisions, the cache data volume and the channel condition of the terminal equipment are fully considered, the actual scene can be more approximate, and the scheduling performance can be improved.

With reference to the first aspect, in some implementations of the first aspect, the scheduling, according to the first scheduling path, transmission of the terminal device includes: 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.

Considering that in a non-ideal scene, the situation of channel information and arrival information of data packets cannot be perfectly obtained, the method is a scene closer to the actual scene. In this scenario, the scheduling path output according to the scheduling algorithm (i.e., 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, and then the adjusted scheduling path is used for scheduling, so that the scheduling path is closer to and conforms to the actual scenario, and the scheduling performance is further improved.

With reference to the first aspect, in certain implementation manners of the first aspect, 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.

By adjusting the original scheduling path (i.e., the first scheduling path) output by the scheduling algorithm provided by the application, the obtained second scheduling path better conforms to the actual channel and packet arrival conditions, so that better scheduling performance can be obtained.

With reference to the first aspect, in certain implementations of the first aspect, the adjusting the order of the M decisions and/or adjusting scheduled terminal devices of one or more of the M decisions includes:

(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 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 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 according to the first legal decision to carry out data transmission, deleting other decisions in the first decision sequence before the first legal decision from the first decision sequence, moving the decisions to the tail part 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 policy 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.

According to the method for adjusting the scheduling path, the path expansion which does not conform to the actual scene in the original scheduling path (namely, the first scheduling path) output by the PL algorithm of the application is adjusted, so that only legal terminal equipment is scheduled in each time scheduling unit, the adjusted path can conform to or approach the actual scene better, and the scheduling performance of the communication system is improved.

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

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.

According to the scheduling scheme of the application, when the channel condition and the arrival condition of the data packet are stable and enough data packets are available in the buffer of the terminal device to support data transmission, the network device can schedule the data transmission of the terminal device in m scheduling time units through one PDCCH, 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 implementation manners of the first aspect, the DCI carrying scheduling information of a first time range includes: 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.

In a second aspect, the present application provides a communication device having the functionality to implement the method of the first aspect or any possible implementation thereof. The functions can be realized by hardware, and the functions can also be realized by executing corresponding software by 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 comprising one or more processors, one or more memories, and one or more transceivers. Wherein the one or more memories are used for storing a computer program, and the one or more processors are used for calling and executing the computer program stored in the memories, and controlling the one or more transceivers to transmit and receive signals, so as to make the network device execute the method in the first aspect or any possible implementation manner thereof.

In a fourth aspect, the present application provides a computer-readable storage medium having stored thereon computer instructions which, when executed on a computer, cause the computer to perform the method of the first aspect or any possible implementation thereof.

In a fifth aspect, the present application provides a computer program product comprising computer program code which, when run on a computer, causes the computer to perform the method of the first aspect or any possible implementation thereof.

In a sixth aspect, the present application provides a communication device comprising a processor and an interface circuit, the interface circuit being configured to receive computer code or instructions and transmit the computer code or instructions to the processor, and the processor being configured to execute the computer code or instructions to perform the method of the first aspect or any possible implementation thereof.

In a seventh aspect, the present application provides a wireless communication system including the network device according to the third aspect.

Drawings

Fig. 1 is a schematic diagram of a communication system suitable for use in embodiments of the present application.

Fig. 2 is a schematic flow chart of a method of scheduling data transmission provided herein.

Fig. 3 is an example of a scheduling algorithm provided in the present application.

FIG. 4 is an exemplary illustration of the Pateto boundary for criterion 1 provided herein.

Fig. 5 is a schematic flow chart of a method for scheduling data transmission provided in the present application.

Fig. 6 is a schematic diagram of a process for adjusting an original scheduling path output by a PL algorithm according to the present application.

Fig. 7 is a schematic flow chart of a method of scheduling data transmission provided herein.

Fig. 8 is an example of a format of DCI.

Fig. 9 is a simulation diagram of the gain of the PF algorithm according to the present embodiment.

Fig. 10 is a simulation diagram of the gain of the PF algorithm according to the present embodiment.

Fig. 11 is a simulation diagram of the gain of the PF algorithm according to the present embodiment.

Fig. 12 is a schematic block diagram of a communication device 1000 provided herein.

Fig. 13 is a schematic configuration diagram of the communication device 10 provided in the present application.

Detailed Description

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

The technical scheme of the application can be applied to a scene that a base station or other central nodes in a wireless communication system carry out Media Access Control (MAC) layer scheduling data transmission. The technical scheme of the 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: narrowband band-Internet of things (NB-IoT), global system for mobile communications (GSM), enhanced data rate GSM evolution (enhanced data rate for GSM evolution, EDGE), wideband Code Division Multiple Access (WCDMA), code Division Multiple Access (CDMA) 2000), time division-synchronous code division multiple access (TD-SCDMA)), long Term Evolution (LTE), and three application scenarios of 5G mobile communication systems, namely enhanced mobile broadband (enhanced mobile broadband, emb), high reliability low latency communication (enhanced latency and enhanced communication, llc), and so on.

Referring to fig. 1, fig. 1 is a schematic diagram of a communication system suitable for use in embodiments of the present application. As shown in fig. 1, a wireless communication system generally comprises cells, each of which includes a network device that provides communication services to a plurality of mobile stations (BSs). Optionally, the network device may include a baseband unit (BBU) and a Remote Radio Unit (RRU), among others. The BBU and RRU may be placed in different places. For example, the RRU is pulled away and placed in an area with high traffic, and the BBU is placed in a central machine room. The BBU and the RRU can also be placed in the same machine room. The BBU and RRU may also be different components under one chassis, which is not limited in this application.

The network device mentioned in this application refers to AN Access Network (AN) device, such as a base station (or AN access point), unless otherwise specified. Access network equipment refers to equipment in the access network that communicates over the air with wireless terminal equipment over one or more cells. The access network device may be an evolved Node B (NodeB or eNB or e-NodeB) in Long Term Evolution (LTE) or long term evolution-advanced (LTE-a), or may also be a fifth generation mobile communication technology (the 5 th generation mobile communication technology) ^th generation, 5G) or a next generation node B (gNB) in a New Radio (NR) system, or may also be a Centralized Unit (CU) and a Distributed Unit (DU) in a Cloud RAN (Cloud radio access network) system. Alternatively, the access network device may include a baseband unit (BBU) and a Remote Radio Unit (RRU). The BBU and RRU may be placed in different places. For example, the RRU is pulled away and placed in an area with high traffic, and the BBU is placed in a central machine room. BBU and RRU can also be placedAnd the equipment is arranged in the same machine room. The BBU and RRU can also be different components under one chassis. The embodiments of the present application are not limited.

An MS referred to in this application may include various terminal devices with wireless communication capabilities, such as handheld devices, in-vehicle devices, wearable devices, computing devices, or other processing devices connected to a wireless modem. The MS may also be referred to as a terminal (terminal), and the MS may be a subscriber unit (subscriber unit), a cellular phone (cellular phone), a smart phone (smart phone), a wireless data card, a Personal Digital Assistant (PDA) computer, a tablet computer, a wireless modem (modem), a handheld device (handset), a laptop computer (laptop computer), a Machine Type Communication (MTC) terminal, or the like.

The technical scheme provided by the application is described as follows.

Referring to fig. 2, fig. 2 is a schematic flow chart of a method for scheduling data transmission provided in the present application.

210. The method comprises the steps that a network device obtains channel information, arrival information of a data packet and scheduling parameters in a time range to be scheduled, wherein the scheduling parameters are used for configuring a scheduling algorithm, the scheduling algorithm expands paths in each time scheduling unit included in the time range to be scheduled according to a time sequence to obtain a scheduling path with optimal compromise of at least two performance indexes of a communication system in the time range to be scheduled, and the at least two performance indexes comprise one or more of throughput, scheduling fairness and packet loss rate.

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

For example, a cell covered by the network device is taken as an example, and the cell includes a plurality of terminal devices. In a future period of time, the network device is required to schedule uplink data transmission or downlink data reception of the plurality of terminal devices in the cell. The future period of time is referred to herein as the scheduled time range.

Optionally, the length of the time range to be scheduled may be configured by the network device according to the actual scheduling situation. For example, if the channel conditions are good and the terminal device has enough data to transmit, the length of the time range to be scheduled may be configured to be longer. And if the channel condition is poor and the variation is large, the length of the time range to be scheduled can be configured to be shorter.

Alternatively, the length of the time range to be scheduled may be characterized in the scheduling unit of time. For example, if a Transmission Time Interval (TTI) is defined as a scheduling unit of time, the time range to be scheduled may include N TTIs, where N ≧ 1 and N are integers.

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

The arrival information of the data packets is used for characterizing the arrival condition of the respective data packets of the terminal equipment which is possibly scheduled by the network equipment in the scheduling time range. For example, how many data packets arrive, the arrival distribution of the data packets in the time range to be scheduled, and the like.

Alternatively, the arrival distribution of the data packets may include a uniform distribution, a poisson distribution, an equal interval distribution, and the like.

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 in the time range to be scheduled and the arrival information of the data packet may be predicted by the network device according to a machine learning algorithm.

Alternatively, in another example, the channel information in the time range to be scheduled may be obtained by the network device by estimating the historical channel and extrapolating. Meanwhile, the arrival information of the data packet can also be obtained by the network device by estimating the historical arrival condition of the data packet of the terminal device.

In addition, in still another example, the channel information in the time range to be scheduled may also be estimated by the network device by estimating a historical channel, and using the estimation result of the historical channel as the channel information in a time range in the future, and the like. Meanwhile, the arrival information of the data packet can also be used as the arrival information of the data packet in a future time range by the network device for estimating the historical arrival condition of the data packet of the terminal device.

In the present application, the scheduling parameter is used to configure a scheduling algorithm. And the scheduling algorithm is used for performing path expansion on each time scheduling unit in the time range to be scheduled according to the time sequence so as to output a scheduling path from the 1 st time scheduling unit to the Nth time scheduling unit, so that at least two performance indexes of the system reach optimal compromise in the time range to be scheduled. The time range to be scheduled comprises N time scheduling units. 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 streams, the scheduling unit of the time-frequency resource, the time range to be scheduled, the list size L of the scheduling algorithm, the arrival distribution model and the average value of the data packets, and the like.

It should be understood that the "user" appearing in the present application refers to the terminal device unless otherwise specified.

The arrival distribution and the mean of the data packets refer to the arrival distribution and the mean of the 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 characterized by the time scheduling unit. For example. The length of the time range to be scheduled may be denoted as N, which means that the time range to be scheduled includes the length of N time scheduling units.

Alternatively, the time scheduling unit may be 1 or more TTIs. The frequency scheduling unit may be a Resource Block Group (RBG).

When the time scheduling unit is 1 TTI, the length of the time range to be scheduled may be denoted as N, which indicates 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 indicates that the scheduling time unit includes N2 TTIs, that is, the length of 2N TTTs.

Alternatively, N may be related to the user movement rate, or related to the user channel and the data packet arrival information acquisition capability within the time range to be scheduled.

It should be understood that N is related to the user motion rate, indicating that the user motion rate affects the channel variation speed.

As shown in table 1, table 1 shows an example of a relationship between N and a user motion rate when a time scheduling unit is 1 TTI, and a channel condition and a packet arrival of a user are predicted by a machine learning algorithm.

TABLE 1

Rate of user movement	0-10km/h	10km/h-15km/h	>15km/h
				N	500TTI	100TTI	10TTI

As shown in table 2, table 2 shows another example of the relationship between channel information and packet arrival information in the time range to be scheduled, which is estimated by the historical channel and packet arrival.

TABLE 2

Rate of user movement	0-1km/h	1km/h-5km/h	>1km/h
				N	500TTI	100TTI	10TTI

Optionally, when the scheduling parameter includes a list size L of the scheduling algorithm, the setting of L may be related to the number of users and the number of streams. Referring to table 3, table 3 shows an example of the relationship between L and the number of users.

TABLE 3

Number of 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 the computing power. For example, the more computing power, the larger L may be.

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

TABLE 4

Packet arrival distribution	Is uniformly distributed	Poisson distribution	Are distributed at equal intervals
				Identification
	1	2	3

As shown in table 4, the identifier "1" indicates that the arrival distribution of the packets conforms to the uniform distribution, the identifier "2" indicates that the arrival distribution of the packets conforms to the poisson distribution, and the identifier "3" indicates that the arrival distribution of the packets conforms to the equidistant distribution.

In addition, the technical scheme of the application is suitable for scheduling of uplink data and downlink data.

In downlink data transmission, the terminal device may report a result of channel estimation or channel prediction to the network device. Thus, the network device can acquire the channel information. For example, the terminal device reports Channel Quality Information (CQI) to the network device. And the network equipment predicts or extrapolates a future channel according to the historical CQI fed back by the terminal equipment to obtain channel information. The downstream packet arrival information is known by the network device itself.

In uplink data transmission, the network device may obtain channel information through channel estimation or channel prediction. The packet arrival information can be acquired by reporting the packet arrival information to the terminal device.

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

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

The first scheduling path is used for instructing the network device to schedule the terminal device to make a decision for data transmission in the time range to be scheduled.

For example, the first scheduling path is used to instruct the network device to decide the scheduled terminal device 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 a scheduling decision in each of the N time scheduling units included in the time range to be scheduled by the network device.

230. And the network equipment schedules the terminal equipment to transmit data according to the first scheduling path.

The data transmission may include receiving downlink data or sending uplink data.

As described above, the first scheduling path is used to instruct the network device to schedule the terminal device for a decision of data transmission in the time range to be scheduled. Therefore, according to the first scheduling path, the network device may schedule the terminal device to transmit uplink data or receive downlink data within the time range to be scheduled.

In the present application, the scheduling algorithm used by the network device to schedule the terminal device to perform data transmission may be a scheduling path determined by sequentially performing path expansion according to a time sequence in the time scheduling units included in the time unit to be scheduled, or in other words, considering joint scheduling of a plurality of time scheduling units within a period of time, so that performance indexes such as throughput of the system, fairness of the terminal device being scheduled, packet loss rate, and the like may reach better compromise. Accordingly, scheduling performance of the communication system can be improved.

In contrast, the conventional PF algorithm models the communication system into a certain model, and based on the model, the scheduling scheme is derived by a formula.

For example, the PF algorithm selects a scheduled terminal device according to the following equation (1):

wherein R is _i (t) is the estimated throughput of user i at time t, which is determined by channel conditions, buffering of the user, and the like. T is _i (t) is the historical cumulative throughput of user i at time t.

As can be seen from this, it is,

is a measure for both throughput and fairness. I.e. if a user currently estimates the throughput R _i The larger (t) is, the better the channel condition of the user is, and enough data needs to be sent in the buffer, so the metric value k of the user is also larger. At the same time, if the cumulative throughput T of the user _i The larger (t) is, the more data the user has transmitted. For fairness of scheduling, the user should be reducedAnd thus the smaller the metric value for that user. Therefore, the PF algorithm realizes the trade-off between throughput and fairness by selecting the user with the largest metric value for scheduling.

Due to the complexity of the communication system, however, it is almost impossible to accurately model them using closed models and formulas. Therefore, a formula-based scheduling algorithm such as PF algorithm cannot guarantee that the scheduling performance of the communication system is optimal.

Therefore, the technical scheme of the application aims at the defects of a scheduling scheme including a PF algorithm based on modeling and formula derivation of a communication system, considers compromise of multiple performance indexes such as throughput, fairness and packet loss rate of the communication system, performs joint scheduling on multiple time scheduling units in a certain time range, and can improve scheduling performance of the communication system.

As described above, the channel information and the arrival information of the data packet within the time range to be scheduled may be obtained by prediction by the network device.

In one implementation, assuming that the channel condition and the arrival condition of the data packet can be accurately obtained, for example, the channel information and the packet arrival information obtained by the network device are consistent with or very close to the actual condition, the scheduling path (i.e., the first scheduling path) predicted according to the scheduling algorithm provided in the present application may be directly used for scheduling data transmission of the terminal device within the time range to be scheduled.

Specifically, the scheduling algorithm proposed in the present application may 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 the channel information, the packet arrival information, and the scheduling parameter for configuring the scheduling algorithm, calculates a scheduling path according to the scheduling algorithm, and finally outputs a scheduling path, which is the first scheduling path in the embodiment of the present application.

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

In order to distinguish from the first scheduling path, an actual scheduling path obtained after the first scheduling path is adjusted is referred to as a second scheduling path in the present application.

The flow of the scheduling algorithm module of the MAC layer is described below with reference to fig. 3.

The flow of the scheduling algorithm can be seen in fig. 4.

Referring to fig. 3, fig. 3 is an example of a scheduling algorithm provided herein.

310. The length N of the time range to be scheduled and the list size L of the scheduling algorithm are initialized, and the index N for indicating the TTI is initialized to N =1.

It should be understood that the units are scheduled in the example of fig. 4 in TTIs. Therefore, an index n of the TTI, i.e., the nth time scheduling unit in the to-be-scheduled time range, is indicated.

For convenience of description, N is defined as a first threshold value and L is defined as a second threshold value.

320. And expanding the path of the nth TTI to obtain Z paths.

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

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

330. And judging whether Z exceeds a second threshold value. That is, it is determined whether Z is greater than L.

If Z > L, proceed to step 340. If Z is less than or equal to L, go to step 350.

340. And sequencing and screening the Z paths to select L paths from the Z paths for reservation.

350. It is determined whether N reaches a first threshold (i.e., N).

If N = N, proceed to step 360. If N < N, let N = N +1 and jump to step 320.

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

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

The PL algorithm aims at obtaining the compromise of better accumulated throughput, fairness and packet loss rate in the time range to be scheduled. The following describes a specific implementation of some of the steps of the PL algorithm shown in fig. 3.

(1) The path involved in step 320 is extended.

Path expansion is performed on one path (hereinafter referred to as the l-th path) in the nth TTI, and it is necessary to perform expansion according to a valid user of the l-th path in the nth TTI.

The user with data packet in the buffer and channel condition capable of supporting data transmission is legal user. And further, scheduling the legal users into legal decisions.

The state of the expanded ith path comprises the following parameters of the ith path in n TTIs:

(1)

(2)

(3)

wherein the content of the first and second substances,

represents the cumulative throughput of all users for the nth TTI of the ith path, <' >>

Represents the cumulative throughput of user k for the nth TTI of the l-th path, and/or>

A fairness parameter indicating the nth TTI of the ith path, K being the number of users, and->

Represents the cumulative packet loss ratio of all users in the nth TTI of the ith path, and->

Represents the cumulative number of lost packets for user k for the nth TTI of the ith path, and->

Indicating the number of accumulated arriving packets of user k for the nth TTI of the ith path.

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

If the number of paths (denoted as Z) extended by the nth TTI exceeds L, Z paths obtained after extension need to be sorted and filtered to select L paths from the Z paths.

Because the state of each path includes three indexes of throughput, fairness and packet loss rate, the larger the throughput and fairness are, the better the throughput and fairness are, and the smaller the packet loss rate is, that is, (1-packet loss rate) is, the larger the packet loss rate is, the better the packet loss rate is. It can be seen that there is a conflict between the three indices and that simultaneous optimization is not possible.

In order to effectively sort and screen the scheduling paths, the method and the device have the advantages that by means of the thought of a genetic algorithm, the superiority and the difference of the paths are guaranteed, three criteria are set for sorting and screening the Z paths obtained after the nth TTI is expanded, and L paths are selected from the Z paths and reserved.

Criterion 1: in order to ensure that the L paths reserved for the nth TTI are relatively better in the Z paths, the Z paths may be subjected to Pareto boundary layer sequencing.

And taking the Z paths obtained after the path of the nth TTI is expanded as Z solutions to form a solution set. And solving the Pareto boundary of the Z solutions, and marking the Pareto boundary as a Pareto boundary layer 1. And solving other solutions except the Pareto boundary layer 1 in the solution set to obtain a Pareto boundary, and marking the Pareto boundary as a Pareto boundary layer 2. And so on, marking Pareto boundary layers for all solutions in the solution set. The smaller the number of Pareto boundary layers, the more advanced the solution rank.

For ease of understanding, the more preferred definition of Pareto is briefly stated: x is a radical of a fluorine atom ₁ Ratio x ₂ More preferably, i.e. the sufficient requirement is

If and only if for all targets j there is

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

And an object i is present such that

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

Wherein f is ^j (x ₁ ) Is to solve x ₁ Regarding the value of target j.

This will be explained with reference to fig. 4. Referring to fig. 4, fig. 4 is an exemplary illustration of Pateto boundaries for criterion 1 provided herein.

Taking two objectives as examples (e.g., throughput and fairness), the Pareto boundary is a set of two objectives that are best traded off. As shown in fig. 4, the Pareto boundary layer 1 (solid line) is obtained by solving the Pareto boundary for all solutions, and the solutions (black solid points) on the Pareto boundary layer 1 form the best compromise set for multiple targets in all solutions. Then, a Pareto boundary is obtained for all solutions except the solution in the Pareto boundary layer 1, and a Pareto boundary layer 2 (dotted line) is obtained, so that the solution (black open circles) on the Pareto boundary layer 2 is inferior to the solution on the Pareto boundary layer 1, but better than other solutions (for example, the solution on the Pareto boundary layer 3). And sequencing the solutions according to a Pareto boundary layer, namely sequencing the solutions about the quality of multi-target compromise.

Criterion 2: and sorting the paths in the same Pareto boundary layer from large to small according to the Diversity Metric and (DMS) parameters of the paths.

If the DMS parameter of a certain path is defined as the path in the Pareto boundary layerAfter sorting each target of (1), the absolute value of the difference between two points before and after the point is normalized, i.e. the sum

Wherein the content of the first and second substances,

wherein it is present>

Represents the maximum value in the solution within the Pareto boundary layer, ordered by the target o.

Represents the minimum value in the solution within the Pareto boundary layer, ordered by the target o. />

Representing the absolute value of the difference between two points before and after the path l, sorted by the target o. The two points which are greatest and least are sorted according to the target o->

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

Criterion 3: when the paths are sorted, all paths with DMS parameters of 0 are deleted in advance.

The reason for deleting all paths with DMS parameter 0 in advance is to further ensure the path diversity. The DMS parameter is 0, which means that there are multiple paths with the same state, i.e. the same throughput, fairness and packet loss rate.

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

When the user channel is not changed or slowly changed, the scheduling sequence of two users with similar scheduling sequences has little influence on the result. For example, the result of scheduling user 1 for the nth TTI and scheduling user 2 for the (n + 1) th TTI may be the same as the result of scheduling user 1 for the nth TTI and scheduling user 2 for the (n + 1) th TTI. If two paths are reserved simultaneously, the difference of the paths is small, and the paths finally converge to a similar area on a Pareto boundary, so that a solution meeting the requirement is difficult to obtain.

Therefore, by deleting all paths with DMS parameter 0 in advance, it is possible to avoid reserving two or more paths converging to the same state, thereby ensuring the difference between the last L paths reserved.

(3) And selecting a scheduling path.

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

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

Optionally, the preference may also be chosen according to the PF algorithm.

Specifically, the threshold is set according to the result of the PF algorithm, for example, the highest throughput in the scheduling path that is not inferior to the fairness of the PF algorithm is selected, or the highest throughput is allowed in the case where a certain fairness is lost. For example, the fairness loss compared to the PF algorithm is not more than 5%.

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

The adjustment process of the scheduling path is explained below with reference to fig. 5.

Referring to fig. 5, fig. 5 is a schematic diagram of a process for adjusting a dispatch path provided in the present application.

501. And (5) initializing.

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

Meanwhile, initializing the length N of the time range to be scheduled. For example, N =500TTI.

In practice, the first scheduling path includes a decision sequence composed of M decisions in time order, each of the M decisions being used to indicate a terminal device scheduled by the network device in the one or more time scheduling units, M is less than or equal to N, and M and N are positive integers.

It should be noted that when M = N, 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, so that N =500/2=250 time scheduling units are 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, one decision may correspond to every 2 time scheduling units (i.e., every 4 TTIs).

Here, the mapping relationship between the decision and the time scheduling unit included in the first scheduling path is only an example, and those skilled in the art may also easily think of other transformations or designs based on the technical solutions disclosed in the present application, and will not be listed again.

502. S2 is searched from left to right, if a legal decision exists, the user is scheduled according to the legal decision, the legal decision is deleted from s2, and the process skips to 504.

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

503. Searching s1 from left to right, if a legal decision exists, scheduling the user according to the legal decision, and copying and splicing a decision sequence before the legal decision to the tail part of s 2. At the same time, the legal decision and the decision sequence preceding the legal decision are deleted in s1 and a jump is made to 504.

If no legal decision exists in s1, determining the scheduling strategy of the nth TTI according to the result of the PF algorithm or a preset decision, not updating s1 and s2, and skipping to 504.

Here, the scheduling policy for the nth TTI refers to a policy on how to schedule the terminal device in the nth TTI. For example, which terminal devices are scheduled for data transmission in the nth TTI, how many terminal devices are scheduled, and the like.

504. And judging whether N reaches a first threshold value N.

If N = N, step 505 is entered.

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

505. And finishing the adjustment of the scheduling path and outputting a second scheduling path.

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

It is to be understood that step 504 of fig. 5, determining whether N is equal to N, actually indicates that the adjustment of the scheduling path is performed by the time-wise scheduling unit. In other words, the decision corresponding to each time scheduling unit is adjusted according to the chronological order.

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

In this implementation, n ranges from [1, M ]. At this time, "N = N? "may be judged as" n = M? ". When n = M, indicating that the adjustment of M decisions is completed, a second scheduling path may be output. When n < M, it means that the adjustment of M decisions has not been completed, let n = n +1, enter the adjustment of (n + 1) th decision.

Similar to the above-described process of adjusting the scheduling paths according to the time scheduling unit, when the scheduling paths are adjusted on a decision-by-decision basis, the adjustment of the order of the M decisions included in the first scheduling path and/or the adjustment of the terminal devices scheduled by the partial decisions may also be included.

An example of path adjustment is given below in connection with fig. 6. Referring to fig. 6, fig. 6 is a schematic diagram illustrating a process of adjusting an original dispatch path output by a PL algorithm according to the present application.

As shown in FIG. 6, after initializing s1 and s2, s1= {1,2,3,4, \8230 },

Where each number in the sequence s1 represents a decision. E.g., decision 1, decision 2, decision 3, and decision 4, etc.

It should be understood that two decisions 1 in s1, represent the same content of the decision. For example, decision 1 each indicate that user 1 is scheduled. Thus, different numbers in s1 and s2 represent different decisions, although this is merely by way of example. Of course, the decisions in s1 may be numbered sequentially in index order as 1,2,3,4,5, \8230, i.e., s1= {1,2,3,4,5, \8230; }, in which case each number represents only the index of the decision and does not represent whether the contents of the decision are the same or not.

In the 1 st TTI, s2 is an empty set, so jump to s1 and search from left to right for the existence of a legal decision. Assuming that the first decision 1 in s1 is a legal decision, i.e. legal decision 1, the user is scheduled according to the legal decision 1 in the 1 st TTI. For example, if legal decision 1 is used to indicate that user 1 is scheduled, then user 1 is scheduled in the 1 st TTI. At the same time, legal decision 1 (the first digit 1 in s 1) is deleted from s 1.

In the 2 nd TTI, s2 is an empty set, so we jump to s1 and search from left to right for a legal decision. Assuming that decision 2 in s1 is a legal decision, i.e. legal decision 2, then the user is scheduled according to legal decision 2 in the 2 nd TTI. For example, legal decision 2 is used to indicate that user 2 is scheduled, then user 2 is scheduled in TTI 2. At this point, legal decision 2 is deleted from s1, and decision 1 before legal decision 2 is deleted from s1 and decision 1 is moved to the end of s 2. Thus, after the adjustment of the scheduling path for the 2 nd TTI, s1= {3,4, \8230; }, s2= {1}.

In the 3 rd TTI s2 is searched from left to right to determine if there is a legal decision in s 2. Assuming that decision 1 in s2 is a legal decision, i.e. legal decision 1, the user is scheduled according to legal decision 1 in the 3 rd TTI. For example, legal decision 1 is used to indicate that user 1 is scheduled, then user 1 continues to be scheduled in the 3 rd TTI. At the same time, decision 1 is deleted from s 2. Thus, after the scheduling path adjustment for the 3 rd TTI, s1= s ={3,4,…},

And so on, and will not be described again.

And searching s2 from left to right in the Nth TTI (namely, the last TTI), jumping to s1 when no legal decision exists, and searching whether a legal decision exists in s 1. It is assumed that there is also no legal decision in s 1. At this time, the scheduling of the nth TTI may be implemented according to a PF algorithm (see the above description) or a preset scheduling decision.

For example, in fig. 6, assuming that the PF value of user 3 is the largest according to the PF algorithm in the nth TTI, user 3 is scheduled in the nth TTI.

For another example, in the nth (N can take any value from 1 to N) TTI, if there is no legal decision in s2 and s1, the user is scheduled according to a preset scheduling policy. The predetermined scheduling decision may be: scheduling the user with the most buffered data, or scheduling the user with the least scheduled times, or scheduling the user with the largest accumulated packet loss amount, etc. Of course, the scheduling policy is only used as an example, and those skilled in the art can also design other policies to seek better scheduling performance according to the idea of PL algorithm provided in the present application.

As can be seen from the example of fig. 6, the first dispatch path can be denoted as { decision 1, decision 2, decision 3, decision 4, \8230 }, before being adjusted for the first dispatch path output by the PL algorithm of the present application. After the path adjustment, the new scheduling path can be represented as { decision 1, decision 2, decision 1, \ 8230;, decision 3}.

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

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

It should be noted that, when the time range to be scheduled uses 1 TTI as a time scheduling unit (or time scheduling unit) and 1 RBG as a scheduling unit (or frequency scheduling unit) of frequency, only one user may be scheduled in each TTI. However, the present application also does not limit that only one user is scheduled per TTI, depending on the specific implementation of the decision. For example, each TTI may schedule one or more users, and the number of users scheduled in the ith TTI and the jth TTI may be equal or unequal, which is not limited in this application. Wherein i is more than or equal to 1 and less than or equal to N, j is more than or equal to 1 and less than or equal to N, i is not equal to j, and i and j are integers.

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

Referring to fig. 7, fig. 7 is a schematic flow chart of a method for scheduling data transmission provided by the present application.

710. The network device sends a PDCCH to the terminal device, where the PDCCH carries Downlink Control Information (DCI). The DCI comprises a first field and a second field. The first field is used to indicate resource allocation within the m time scheduling units and the second field is used to indicate the time scheduling units.

And the terminal equipment receives the PDCCH and acquires the DCI carried on the PDCCH by blind detection of the PDCCH. According to the first field and the second field of the DCI, the scheduling condition, the resource allocation condition and the time scheduling unit of the network equipment to the terminal equipment in the waiting time range can be determined.

720. And the terminal equipment receives downlink data or transmits uplink data according to the scheduling of the network equipment within the time range to be scheduled according to the first field and the second field.

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

According to the scheduling scheme of the application, when the channel condition and the arrival condition of the data packet are stable and enough data packets support data transmission in a buffer of a user, the network equipment can schedule the data transmission of the terminal equipment in m scheduling time units through one PDCCH, so that the overhead of the PDCCH can be saved in the following (m-1) time scheduling units, and m is less than or equal to N.

Alternatively, 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 a format of DCI. As shown in fig. 8, a field for indicating resource allocation within N time scheduling units and an indication of MCS of the corresponding resource may be included in the DCI. Such as the fields "F resources (F resources)" and "T resources (T resources)" shown in fig. 9. In addition, a field for indicating a time scheduling unit, such as the field "T index (T index)" shown in fig. 7, for example, "T index 1 (T index 1)", "T index 2 (T index 2)", and the like may also be included in the DCI.

Alternatively, the field indicating the time scheduling unit (i.e., the second field) may not indicate each index, but indicate one scheduling time length p, e.g., indicate p =10, and the resource allocation representing this PDCC scheduling indicates the resource allocation within the future 10 time scheduling units at once. Alternatively, the length of the time range to be scheduled may also be implicitly determined by the number of F resource or T resource indication fields.

The method for scheduling data transmission provided by the present application is described in detail above. Therefore, in the technical scheme of the application, by utilizing the channel information and the arrival information of the data packet which are acquired in advance within a future period of time (namely, within the time range to be scheduled), the continuous scheduling path within the time range to be scheduled is acquired through the scheduling algorithm, and then the scheduling path is adjusted according to the channel and the arrival condition of the data packet of the actual scene and is used for scheduling. In the application, due to the consideration of the multi-resource unit joint scheduling in a long time range, compared with the existing PF algorithm, the method has better performances of throughput, fairness and packet loss rate, and is beneficial to improving the performance of a communication system.

In addition, by adding a field to DCI, resource allocation in a plurality of time scheduling units can be indicated in a single PDCCH, and the overhead of the PDCCH can be saved. Meanwhile, the terminal equipment can reduce the number of blind tests and reduce power consumption.

Compared with the PF algorithm, the technical scheme provided by the application is simulated, and the performance is improved.

Referring to table 5, table 5 lists the simulation conditions and simulation parameters.

TABLE 5

When the prediction assumption 1 is satisfied, the throughput, fairness, and packet loss rate of the present application with respect to the gain of the PF algorithm are as shown in (a) and (b) of fig. 9.

Referring to fig. 9, fig. 9 is a simulation diagram of the technical solution of the present application with respect to the gain of the PF algorithm. As shown in (a) of fig. 9, when the preference is set to 1, that is, 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 fig. 9, when the preference is set to 2, that is, when the fairness loss is not more than 5% compared to the PF algorithm, the throughput gain is about 20%, and the gain of the packet loss rate is about 15%.

Simulation results show that under ideal conditions, the system performance is greatly improved compared with the conventional PF algorithm on the assumption that channel prediction and data packet arrival conditions can be perfectly obtained. Throughput can be further improved with some loss in fairness allowed.

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

Referring to fig. 10, fig. 10 is a simulation diagram of the gain of the present invention with respect to the PF algorithm. As shown in (a) and (b) of fig. 10, when the preference setting 1 is set, the throughput gain is about 8%, and the packet loss rate gain is about 10%. When the preference setting is 2, the throughput gain is 15%, and the packet loss rate gain is 11%.

Simulation results show that in an actual situation, because the results of channel prediction and packet arrival prediction are different from the actual channel and packet arrival situations, throughput gain and packet loss rate gain are lost compared with an ideal situation, but the overall performance still has a great advantage compared with PF scheduling.

When the prediction assumption 3 is satisfied, the throughput, fairness, and packet loss rate of the present application with respect to the gain of the PF algorithm are as shown in (a) and (b) of fig. 11.

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

Simulation results show that, since the time-varying state of the channel can be better predicted by assuming channel prediction, the performance when the prediction assumption 3 is satisfied is improved compared with the system performance when the prediction assumption 2 is satisfied.

The following describes an apparatus for scheduling data transmission according to the present application.

Referring to fig. 12, fig. 12 is a schematic block diagram of a communication device provided herein. As shown in fig. 12, the communication apparatus 1000 includes an acquisition unit 1100, a determination unit 1200, and a scheduling unit 1300.

An obtaining unit 1100, configured to obtain channel information, arrival information of a data packet, and a scheduling parameter within a time range to be scheduled, where the scheduling parameter is used to configure a scheduling algorithm, and the scheduling algorithm is used to expand a path in each time scheduling unit included in the time range to be scheduled according to a time sequence, so as to obtain a scheduling path that is optimal for compromise of at least two performance indexes of a communication system within the time range to be scheduled;

a determining unit 1200, 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 instruct a decision for scheduling a terminal device to perform data transmission within the time range to be scheduled;

a scheduling unit 1300, 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 parameter includes one or more of the following parameters:

the scheduling method comprises the steps of counting the number of scheduled terminal equipment, counting 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 and M are positive integers.

Optionally, in one embodiment, the time range to be scheduled includes N 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, determining the first scheduling path according to 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.

Optionally, in an embodiment, 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 paths with DMS parameters of 0 in the Z paths in advance before sorting the Z paths.

(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;

(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.

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

expanding a 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;

optionally, in an embodiment, 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.

Optionally, in an embodiment, the first scheduling path includes a decision sequence composed of M decisions in chronological order, each of the M decisions is used to indicate a terminal device scheduled in one or more of the scheduling time units, M ≦ N and M is 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.

Optionally, in an embodiment, 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 transmit data, scheduling the terminal equipment in the nth time scheduling unit according to the first legal decision to transmit the data, 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 to perform data transmission in the nth time scheduling unit, 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 transmit data, scheduling the terminal equipment in the nth time scheduling unit according to the first legal decision to transmit data, 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 include 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 the scheduling strategy

(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.

Optionally, in an embodiment, the apparatus further comprises:

a transceiving unit 1400, configured to send downlink control information DCI to the terminal device, where the DCI carries scheduling information of a first time range, a length of the first time range is equal to m time scheduling units, m is not greater than 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 in the first time range.

Optionally, in an embodiment, the DCI carrying scheduling information of a first time range includes:

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.

Alternatively, the transceiver 1400 may be replaced by a transmitter or a receiver. For example, the transceiver 1400 may be replaced by a transmitter when performing the transmitting action. The transceiving unit 140 may be replaced by a receiving unit when performing the receiving action.

Alternatively, the communication apparatus 1000 may be an access network device (e.g., a base station) or other network devices that may be used to schedule a terminal device for data transmission, or a device, a component, or the like in the network device that may implement the functions of the network device in the foregoing method embodiments.

For example, the transceiving unit 1400 may be a transceiver. The transceiver may be replaced by a receiver or a transmitter. For example, the transceiver may be replaced by the transmitter when performing the act of transmitting. The transceiver may be replaced by a receiver when performing the act of receiving. The obtaining unit 1100, the determining unit 1200 and the scheduling unit 1300 may be physically integrated into one 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 provided separately, and each unit is implemented by a processing device or a processor, which is not limited herein.

Alternatively, the communication apparatus 1000 may be a circuit system installed in a network device, for example, a chip or a system on chip (SoC), etc. The obtaining unit 1100, the determining unit 1200 and the scheduling unit 1300 may be respectively a module or a unit of a circuit system, or may be implemented by a module or a unit (e.g., a processing unit). In this implementation, the transceiving unit 1400 may be a communication interface. For example, the transceiving unit 1400 may be an input-output interface or an input-output circuit. The input-output interface may include an input interface and an output interface. The input-output circuit may include an input circuit and an output circuit.

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

For example, the processing device may include one or more memories for storing the computer program and one or more processors that read and execute the computer program stored in the one or more memories, so that the communication device 1000 performs the operations and/or processes performed by the network device in the method embodiments.

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

Alternatively, the transceiving unit 1400 may be a radio frequency device. The acquisition unit 1100, the determination unit 1200, and the scheduling unit 1300 may be integrated on a baseband device.

Referring to fig. 13, fig. 13 is a schematic structural diagram of the 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. Wherein the processor 11 is configured to control the communication interface 13 to send and receive signals, the memory 12 is configured to store a computer program, and the processor 11 is configured to call and run the computer program from the memory 12, so that the communication apparatus 10 performs the processing and/or operations performed by the network device in the method embodiments of the present application.

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 function of the transceiving unit 1400 shown in fig. 12. For details, reference may be made to the detailed description in fig. 12, which is not described herein again.

Alternatively, 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.

Alternatively, the memory and the storage in the above-mentioned embodiments of the apparatus may be physically separate units, or the memory and the processor may be integrated together.

In addition, the present application also provides a computer-readable storage medium, in which computer instructions are stored, and when the computer instructions are executed on a computer, the computer is enabled to execute the operations and/or processes performed by the network device in the method for scheduling data transmission provided by the present application.

The present application also provides a computer program product comprising computer program code which, when run on a computer, causes the computer to perform the operations and/or processes performed by the network device in the method of scheduling data transmission provided by the present application.

The present application also provides a communication apparatus comprising a processor and an interface circuit, the interface circuit being configured to receive computer code or instructions and transmit the computer code or instructions to the processor, and the processor being configured to execute the computer code or instructions to perform the operations and/or processes performed by the network device in the method of scheduling data transmission provided by the present application.

The present application also provides a chip that includes one or more processors. The one or more processors are configured to execute the computer programs stored in the memory to perform the operations and/or processes performed by the network device in any of the method embodiments. Wherein the memory for storing the computer program is provided independently of the chip.

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

The application also provides a wireless communication system, which comprises the network equipment in the embodiment of the application.

The processor in the embodiments of the present application may be an integrated circuit chip having the capability of processing signals. In implementation, the steps of the above method embodiments may be performed by integrated logic circuits of hardware in a processor or instructions in the form of software. The processor may 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 device, discrete gate or transistor logic, or 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 method disclosed in the embodiments of the present application may be directly implemented by a hardware encoding processor, or implemented by a combination of hardware and software modules in the encoding processor. The software module may be located in ram, flash memory, rom, prom, or eprom, registers, etc. storage media as is well known in the art. The storage medium is located in a memory, and a processor reads information in the memory and completes the steps of the method in combination with hardware of the processor.

The memory in the embodiments of the present application may be either volatile memory or nonvolatile memory, or may include both volatile and nonvolatile memory. The non-volatile memory may be a read-only memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an electrically Erasable EPROM (EEPROM), or a flash memory. Volatile memory can be Random Access Memory (RAM), which acts as external cache memory. By way of example, but not limitation, many forms of RAM are available, such as Static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), synchronous Dynamic Random Access Memory (SDRAM), double data rate SDRAM, enhanced SDRAM, SLDRAM, synchronous Link DRAM (SLDRAM), and Direct Rambus RAM (DRRAM). It should be noted that the memory of the systems and methods described herein is intended to comprise, without being limited to, these and any other suitable types of memory.

As used in this specification, the terms "unit," "system," and the like are intended to refer to a computer-related entity, either hardware, firmware, a combination of hardware and software, or software in execution. For example, a component may be, but is not limited to being, a process running on 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 a component. One or more components may reside within a process and/or thread of execution. A component may be located 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. The components may communicate by way of local and/or remote processes based on a signal having one or more data packets (e.g., data from two components interacting with another component in a local system, distributed system, and/or across a network, such as the internet with other systems by way of the signal).

Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

It can be clearly understood by those skilled in the art that, for convenience and simplicity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.

In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one type of logical functional division, and other divisions may be realized in practice, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

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

The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: u disk, removable hard disk, read only memory, random access memory, magnetic disk or optical disk, etc. for storing program codes.

The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily think of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

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:

(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:

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,

(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;

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:

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:

(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:

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

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:

(3) Judging whether N is equal to N;

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

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:

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

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

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;

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:

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

(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;

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:

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.