Resource Scheduling Method, Apparatus and Processor-Readable Storage Medium

Abstract

An embodiment of the present application provides a resource scheduling method, apparatus, and processor-readable storage medium. The method includes: obtaining a list of first user equipment (UE), and sorting the UEs in the first UE list based on the priorities of the resources occupied by the respective UEs from a network node scheduling; determining a second UE list including at least one UE according to the priority sorting of the respective UEs in the first UE list, where the at least one UE includes the UE with the highest priority; determining the pairing groups corresponding to the respective UEs in the second UE list; determining a third UE list according to the pairing groups corresponding to the respective UEs in the second UE list, and the UEs in the third UE list reuse the resources scheduled by the network node, and the resources scheduled by the network node are used for the network node to send data to the UEs in the third UE list. This method realizes that the UEs in the third UE list reuse the resources scheduled by the network node, thereby improving the resource scheduling efficiency and enhancing performance such as network throughput.

Description

Technical Field

[0001] This application relates to the field of wireless communication technologies. Specifically, this application relates to a resource scheduling method, apparatus, and processor-readable storage medium. Background Art

[0002] In the prior art for the multi-user multiplexing scenario in MU-MIMO (Multiple User MIMO), the scheduling algorithm adopted by the base station for resource scheduling is queuing based on a priority algorithm, such as algorithms like the proportional fairness algorithm, the polling algorithm, the maximum signal-to-noise ratio algorithm, etc. According to the priority order of the UEs (User Equipment) in the above algorithm scheme occupying the resources scheduled by the base station, a multiplexing UE for a certain resource block is selected one by one from multiple UEs, and finally the multiplexing UE for the resource block is determined, where the resource block can be a PRB (Physical Resource Block) or other types of resources; however, the above algorithm scheme results in low efficiency of resource scheduling and low performance such as network throughput. Therefore, on the basis of ensuring the priority of the UEs occupying the resources scheduled by the base station, how to improve performance such as network throughput is a problem to be solved. Summary of the Invention

[0003] In view of the disadvantages of the existing methods, this application proposes a resource scheduling method, apparatus, and processor-readable storage medium to solve the above technical defects.

[0004] In a first aspect, a resource scheduling method is provided, which is applied to a network node and includes:

[0005] Obtain a first list of user equipment UEs, where the UEs in the first UE list are sorted based on the priority of each UE occupying the resources scheduled by the network node;

[0006] Determine a second UE list including at least one UE according to the priority sorting of each UE in the first UE list, where the at least one UE includes the UE with the highest priority;

[0007] Determine the pairing groups corresponding to each UE in the second UE list;

[0008] Determine a third UE list according to the pairing groups corresponding to each UE in the second UE list, where the UEs in the third UE list multiplex the resources scheduled by the network node, and the resources scheduled by the network node are used for the network node to send data to each UE in the third UE list.

[0009] Optionally, obtaining a first list of user equipment UEs includes:

[0010] Obtain N UEs waiting for the network node to schedule, where N is a positive integer;

[0011] Determine the priority of each UE among the N UEs to occupy the resources scheduled by the network node according to the preset priority policy;

[0012] Determine a first UE list according to the priority of each UE among the N UEs to occupy the resources scheduled by the network node. The first UE list includes the N UEs, and the N UEs are sorted in descending order of priority.

[0013] Optionally, determine a second UE list including at least one UE according to the priority sorting of each UE in the first UE list, including:

[0014] Determine the number M of UEs in the second UE list according to the computing power of the preset network node and the number of UEs in the first UE list, where M is a positive integer;

[0015] Determine the second UE list according to the first M UEs sorted in descending order of priority in the first UE list. The second UE list includes M UEs.

[0016] Optionally, determine the pairing group corresponding to each UE in the second UE list, including:

[0017] Determine at least one paired UE corresponding to each UE in the second UE list according to the preset pairing policy;

[0018] Construct each UE and at least one paired UE into a pairing group corresponding to each UE. The first UE list includes at least one paired UE.

[0019] Optionally, determine at least one paired UE corresponding to each UE in the second UE list according to the preset pairing policy, including:

[0020] Sum the throughput of one UE in the second UE list with the throughput of each UE other than the one UE in the first UE list to obtain the total throughput corresponding to each UE other than the one UE;

[0021] Determine the UE corresponding to the largest total throughput among the total throughputs as the paired UE of the one UE.

[0022] Optionally, determine a third UE list according to the pairing group corresponding to each UE in the second UE list, including:

[0023] Obtain at least two pairing groups including the UE with the highest priority according to the pairing group corresponding to each UE in the second UE list;

[0024] Determine the quantitative values respectively corresponding to at least two pairing groups including the UE with the highest priority according to at least two pairing groups including the UE with the highest priority and a preset UE performance quantitative analysis strategy;

[0025] Determine the pairing group corresponding to the largest quantitative value among the quantitative values as the third UE list.

[0026] Optionally, the quantitative value is positively correlated with the throughput of the pairing group corresponding to the quantitative value, and the throughput corresponding to the largest quantitative value is the sum of the throughputs of the UEs in the third UE list.

[0027] In a second aspect, a resource scheduling device is provided, which is applied to a network node and includes a memory, a transceiver, and a processor:

[0028] The memory is used to store a computer program; the transceiver is used to send and receive data under the control of the processor; the processor is used to read the computer program in the memory and perform the following operations:

[0029] Obtain a first user equipment (UE) list, and the UEs in the first UE list are sorted based on the priorities of the resources occupied by the UEs from the network node scheduling;

[0030] According to the priority sorting of each UE in the first UE list, determine a second UE list including at least one UE, and at least one UE includes the UE with the highest priority;

[0031] Determine the pairing groups respectively corresponding to the UEs in the second UE list;

[0032] According to the pairing groups respectively corresponding to the UEs in the second UE list, determine a third UE list, and the UEs in the third UE list multiplex the resources scheduled by the network node, and the resources scheduled by the network node are used for the network node to send data to the UEs in the third UE list.

[0033] Optionally, obtaining a first user equipment (UE) list includes:

[0034] Obtain N UEs waiting for network node scheduling, where N is a positive integer;

[0035] According to a preset priority policy, determine the priorities of the resources occupied by the N UEs from the network node scheduling;

[0036] According to the priorities of the resources occupied by the N UEs from the network node scheduling, determine a first UE list, and the first UE list includes N UEs, and the N UEs are sorted from highest to lowest in priority.

[0037] Optionally, determining a second UE list according to at least one UE in the first UE list includes:

[0038] Determine the number M of UEs in the second UE list according to the computing power of the preset network node and the number of UEs in the first UE list, where M is a positive integer;

[0039] Determine the second UE list according to the top M UEs sorted in descending order of priority in the first UE list, and the second UE list includes M UEs.

[0040] Optionally, determining the pairing groups corresponding to each UE in the second UE list includes:

[0041] Determine at least one paired UE corresponding to each UE in the second UE list according to the preset pairing strategy;

[0042] Construct a pairing group corresponding to each UE from each UE and at least one paired UE, and the first UE list includes at least one paired UE.

[0043] Optionally, determining at least one paired UE corresponding to each UE in the second UE list according to the preset pairing strategy includes:

[0044] Sum the throughput of one UE in the second UE list with the throughput of each UE except the one UE in the first UE list to obtain the total throughput corresponding to each UE except the one UE;

[0045] Determine the UE corresponding to the largest total throughput among the total throughputs as the paired UE of the one UE.

[0046] Optionally, determining the third UE list according to the pairing groups corresponding to each UE in the second UE list includes:

[0047] Obtain at least two pairing groups including the UE with the highest priority according to the pairing groups corresponding to each UE in the second UE list;

[0048] Determine the quantitative values corresponding to at least two pairing groups including the UE with the highest priority according to at least two pairing groups including the UE with the highest priority and the preset UE performance quantitative analysis strategy;

[0049] Determine the pairing group corresponding to the largest quantitative value among the quantitative values as the third UE list.

[0050] Optionally, the quantitative value is positively correlated with the throughput of the pairing group corresponding to the quantitative value, and the throughput corresponding to the largest quantitative value is the sum of the throughputs of the UEs in the third UE list.

[0051] In a third aspect, the present application provides a resource scheduling device applied to a network node, including:

[0052] A first processing unit for obtaining a list of first user equipment (UE), where the UEs in the first UE list are sorted based on the priorities of the resources occupied by the UEs scheduled by a network node.

[0053] A second processing unit for determining a second UE list including at least one UE according to the priority sorting of each UE in the first UE list, where the at least one UE includes the UE with the highest priority.

[0054] A third processing unit for determining the pairing groups corresponding to the UEs in the second UE list respectively.

[0055] A fourth processing unit for determining a third UE list according to the pairing groups corresponding to the UEs in the second UE list respectively, where the UEs in the third UE list reuse the resources scheduled by the network node, and the resources scheduled by the network node are used for the network node to send data to the UEs in the third UE list.

[0056] Optionally, the first processing unit is specifically configured to obtain N UEs waiting for network node scheduling, where N is a positive integer; determine the priorities of the resources occupied by the N UEs scheduled by the network node according to a preset priority policy; and determine the first UE list according to the priorities of the resources occupied by the N UEs scheduled by the network node, where the first UE list includes N UEs, and the N UEs are sorted from highest to lowest priority.

[0057] Optionally, the second processing unit is specifically configured to determine the number M of UEs in the second UE list according to the computing power of the preset network node and the number of UEs in the first UE list, where M is a positive integer; and determine the second UE list according to the first M UEs sorted from highest to lowest priority in the first UE list, where the second UE list includes M UEs.

[0058] Optionally, the third processing unit is specifically configured to determine at least one paired UE corresponding to each UE in the second UE list according to a preset pairing policy; and construct a pairing group corresponding to each UE by combining each UE and the at least one paired UE, where the first UE list includes at least one paired UE.

[0059] Optionally, the third processing unit is specifically configured to sum the throughput of a UE in the second UE list with the throughput of each UE other than the one UE in the first UE list respectively to obtain the total throughput corresponding to each UE other than the one UE; and determine the UE corresponding to the largest total throughput among the total throughputs as the paired UE of the one UE.

[0060] Optionally, the fourth processing unit is specifically configured to obtain at least two pairing groups including the UE with the highest priority according to the pairing groups corresponding to the UEs in the second UE list; determine the quantitative values corresponding to at least two pairing groups including the UE with the highest priority according to at least two pairing groups including the UE with the highest priority and a preset UE performance quantitative analysis strategy; and determine the pairing group corresponding to the largest quantitative value among the quantitative values as the third UE list.

[0061] Optionally, the quantitative value is positively correlated with the throughput of the pairing group corresponding to the quantitative value, and the throughput corresponding to the largest quantitative value is the sum of the throughputs of the UEs in the third UE list.

[0062] In a fourth aspect, a processor-readable storage medium is provided, which is characterized in that the processor-readable storage medium stores a computer program, and the computer program is used to cause the processor to execute the method described in the first aspect.

[0063] The technical solution provided by the embodiments of the present application has at least the following beneficial effects:

[0064] The network node obtains a first user equipment (UE) list, and the UEs in the first UE list are sorted based on the priorities of the resources occupied by the UEs for the network node scheduling; according to the priority sorting of each UE in the first UE list, a second UE list including at least one UE is determined, and the at least one UE includes the UE with the highest priority; the pairing groups corresponding to the UEs in the second UE list are determined; according to the pairing groups corresponding to the UEs in the second UE list, a third UE list is determined, and the UEs in the third UE list reuse the resources scheduled by the network node, and the resources scheduled by the network node are used for the network node to send data to the UEs in the third UE list. In this way, the UEs in the third UE list reuse the resources scheduled by the network node, thereby improving the resource scheduling efficiency and enhancing the performance such as network throughput.

[0065] The additional aspects and advantages of the present application will be partially given in the following description, and these will become obvious from the following description or be understood through the practice of the present application. Description of the Drawings

[0066] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for the description of the embodiments of the present application will be briefly introduced below.

[0067] Figure 1 It is a schematic diagram of the system architecture provided by the embodiments of the present application;

[0068] Figure 2 It is a schematic flowchart of a resource scheduling method provided by the embodiments of the present application;

[0069] Figure 3Schematic structural diagram of the resource scheduling device provided by an embodiment of the present application;

[0070] Figure 4 Schematic structural diagram of the resource scheduling device provided by an embodiment of the present application. Detailed implementation manners

[0071] The embodiments of the present application will be described in detail below. Examples of the embodiments are shown in the accompanying drawings, where the same or similar reference numerals indicate the same or similar elements or elements with the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present application, and should not be construed as a limitation to the present application.

[0072] Those skilled in the art of the present technology can understand that, unless specifically stated otherwise, the singular forms "a", "an", "the" and "said" used herein may also include the plural forms. It should be further understood that the term "including" used in the specification of the present application means the presence of the described features, integers, steps, operations, elements and / or components, but does not exclude the presence or addition of one or more other features, integers, steps, operations, elements, components and / or their groups. It should be understood that when we say that an element is "connected" or "coupled" to another element, it can be directly connected or coupled to other elements, or there may also be intermediate elements. In addition, the "connection" or "coupling" used herein may include wireless connection or wireless coupling. The term "and / or" used herein includes all or any unit and all combinations of one or more related listed items.

[0073] In the embodiments of the present application, the term "and / or" describes the association relationship of associated objects and indicates that there can be three relationships. For example, A and / or B can represent: the individual existence of A, the simultaneous existence of A and B, and the individual existence of B. The character " / " generally represents an "or" relationship between the associated objects before and after. In the embodiments of the present application, the term "plurality" refers to two or more, and other quantifiers are similar thereto.

[0074] The technical solutions provided by the embodiments of this application can be applicable to multiple systems, especially 5G systems. For example, the applicable systems can be the global system of mobile communication (GSM) system, code division multiple access (CDMA) system, Wideband Code Division Multiple Access (WCDMA) general packet radio service (GPRS) system, long term evolution (LTE) system, LTE frequency division duplex (FDD) system, LTE time division duplex (TDD) system, long term evolution advanced (LTE-A) system, universal mobile telecommunication system (UMTS), worldwide interoperability for microwave access (WiMAX) system, 5G New Radio (NR) system, etc. Both terminal devices and network devices are included in these multiple systems. The system may also include a core network part, such as the Evolved Packet System (EPS), 5G System (5GS), etc.

[0075] Between the network device and the terminal device, one or more antennas can be used respectively for multi-input multi-output (MIMO) transmission. The MIMO transmission can be single user MIMO (SU-MIMO) or multiple user MIMO (MU-MIMO). According to the form and quantity of the antenna combination, the MIMO transmission can be 2D-MIMO, 3D-MIMO, FD-MIMO or massive-MIMO, or it can also be diversity transmission, precoding transmission, beamforming transmission, etc.

[0076] The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present application without creative efforts shall fall within the protection scope of the present application.

[0077] A schematic diagram of a network architecture provided by an embodiment of the present application is as Figure 1 shown. The network architecture includes: a UE and a network node. Among them, the UE is, for example, Figure 1 UE110 and UE120 in Figure 1 , and the network node is, for example,

[0078] the network node 130 in

[0079] The network node is deployed in the access network. For example, the network node 130 is deployed in the access network NG-RAN (New Generation - Radio Access Network) of the 5G system. The UE and the network node communicate with each other through a certain air interface technology. For example, they can communicate with each other through cellular technology.

[0078] The UE involved in the embodiments of the present application may be a device that provides voice and / or data connectivity to users, a handheld device with wireless connection capabilities, or other processing devices connected to a wireless modem, etc. The types of UEs include mobile phones, vehicle user terminals, tablet computers, laptop computers, personal digital assistants, mobile Internet devices, wearable devices, etc.

[0079] The network node involved in the embodiments of the present application may be a base station, which may include multiple cells that provide services to UEs. Depending on the specific application scenarios, the base station may also be referred to as an access point, or may be a device in the access network that communicates with UEs through one or more sectors over the air interface, or have other names. The network node can be used to mutually replace the received air frames and Internet Protocol (IP) packets, and act as a router between the UE and the rest of the access network, where the rest of the access network may include an Internet Protocol (IP) communication network. The network node can also coordinate the attribute management of the air interface. For example, the network node involved in the embodiments of the present application may be a network device (Base Transceiver Station, BTS) in a Global System for Mobile communications (GSM) or Code Division Multiple Access (CDMA), may also be a network device (NodeB) in a Wide-band Code Division Multiple Access (WCDMA), may also be an evolved network device (evolutional Node B, eNB or e-NodeB) in a Long Term Evolution (LTE) system, a 5G base station (gNB) in a 5G network architecture (next generation system), may also be a Home evolved Node B (HeNB), a relay node, a femto, a pico, etc., which is not limited in the embodiments of the present application. In some network architectures, the network node may include a centralized unit (CU) node and a distributed unit (DU) node, and the centralized unit and the distributed unit may also be geographically separated.

[0080] To make the objectives, technical solutions, and advantages of the present application clearer, the following will further describe the embodiments of the present application in detail with reference to the accompanying drawings.

[0081] An embodiment of the present application provides a resource scheduling method, which is applied to a network node. The schematic flowchart of the method is as Figure 2 shown, and the method includes:

[0082] Step S101, obtain a first list of user equipment UEs, and the UEs in the first UE list are sorted based on the priorities of the resources occupied by the UEs scheduled by the network node.

[0083] Optionally, obtain a list of the first user equipment (UE), including:

[0084] Obtain N UEs waiting for network node scheduling, where N is a positive integer;

[0085] According to a preset priority policy, determine the priority of each UE in the N UEs to occupy the resources scheduled by the network node;

[0086] According to the priority of each UE in the N UEs to occupy the resources scheduled by the network node, determine the first UE list, where the first UE list includes N UEs, and the N UEs are sorted in descending order of priority.

[0087] Step S102: According to the priority sorting of each UE in the first UE list, determine a second UE list including at least one UE, where the at least one UE includes the UE with the highest priority.

[0088] Optionally, according to the priority sorting of each UE in the first UE list, determine a second UE list including at least one UE, including:

[0089] According to the computing power of the preset network node and the number of UEs in the first UE list, determine the number M of UEs in the second UE list, where M is a positive integer;

[0090] According to the first M UEs sorted in descending order of priority in the first UE list, determine the second UE list, where the second UE list includes M UEs.

[0091] Step S103: Determine the pairing group corresponding to each UE in the second UE list.

[0092] Optionally, determining the pairing group corresponding to each UE in the second UE list includes:

[0093] According to a preset pairing policy, determine at least one paired UE corresponding to each UE in the second UE list;

[0094] Construct a pairing group corresponding to each UE by combining each UE and at least one paired UE, where the first UE list includes at least one paired UE.

[0095] Optionally, according to a preset pairing policy, determining at least one paired UE corresponding to each UE in the second UE list includes:

[0096] Sum the throughput of one UE in the second UE list with the throughput of each UE other than the one UE in the first UE list to obtain the total throughput corresponding to each UE other than the one UE;

[0097] Determine the paired UE of a UE as the UE corresponding to the maximum total throughput among all total throughputs.

[0098] Step S104: Determine a third UE list according to the paired groups corresponding to the UEs in the second UE list. Each UE in the third UE list multiplexes the resources scheduled by the network node, and the resources scheduled by the network node are used for the network node to send data to each UE in the third UE list.

[0099] Optionally, determining the third UE list according to the paired groups corresponding to the UEs in the second UE list includes:

[0100] Obtain at least two paired groups including the UE with the highest priority according to the paired groups corresponding to the UEs in the second UE list;

[0101] Determine the quantitative values corresponding to at least two paired groups including the UE with the highest priority according to at least two paired groups including the UE with the highest priority and a preset UE performance quantitative analysis strategy;

[0102] Determine the paired group corresponding to the maximum quantitative value among the quantitative values as the third UE list.

[0103] Optionally, the quantitative value is positively correlated with the throughput of the paired group corresponding to the quantitative value, and the throughput corresponding to the maximum quantitative value is the sum of the throughputs of the UEs in the third UE list.

[0104] In the embodiments of the present application, the network node obtains a first user equipment (UE) list, and the UEs in the first UE list are sorted based on the priorities of the resources occupied by the UEs for the network node scheduling; determine a second UE list according to at least one UE in the first UE list, and at least one UE includes the UE with the highest priority; determine the paired groups corresponding to the UEs in the second UE list respectively; determine a third UE list according to the paired groups corresponding to the UEs in the second UE list respectively, and each UE in the third UE list multiplexes the resources scheduled by the network node, and the resources scheduled by the network node are used for the network node to send data to each UE in the third UE list. In this way, each UE in the third UE list multiplexes the resources scheduled by the network node, thereby improving the resource scheduling efficiency and enhancing the performance such as network throughput.

[0105] The resource scheduling method of the above embodiments of the present application will be comprehensively and elaborately introduced through the following embodiments:

[0106] An embodiment of the present application provides a resource scheduling method, which is applied to a network node. The method includes:

[0107] Step 1: Determine a UE list queued based on a priority algorithm.

[0108] Optionally, without defining a priority algorithm, such as retransmission user priority, proportional fairness algorithm, polling algorithm, maximum signal-to-noise ratio algorithm, etc. Let the UE list queued based on the priority algorithm be UEList, and UEList be the first UE list. UEList is shown in formula (1):

[0109] UEList = {UE 1 , …, UE N} Formula (1)

[0110] Among them, the number of elements in UEList is N, and N is a positive integer.

[0111] Optionally, the steps A1 - A3 for determining the UE list queued based on the priority algorithm are as follows:

[0112] Step A1: Obtain the UEs currently waiting for scheduling, and assume there are N UEs in total.

[0113] Step A2: Based on the priority algorithm for each UE, such as retransmission user priority, proportional fairness algorithm, polling algorithm, maximum signal-to-noise ratio algorithm, etc., calculate the corresponding scheduling priority.

[0114] Step A3: Sort the scheduling priorities of each UE from largest to smallest, and add the corresponding UEs to the UEList list in sequence. Thus, the obtained UEList reflects the priority order of the UEs and serves as the basis for ensuring the UE priority.

[0115] Step 2: Determine the UE list for which the pairing group relationship needs to be calculated.

[0116] Optionally, the UE list for which the pairing group needs to be determined is set as UEList_CompGroup, and UEList_CompGroup is the second UE list. UEList_CompGroup is shown in formula (2):

[0117] UEList_CompGroup = {UE_CompGroup 1 , …, UE_CompGroup M} Formula (2)

[0118] Among them, the number of elements in UEList_CompGroup is M, and M is a positive integer. The maximum number of elements in UEList_CompGroup is N, and UEList_CompGroup includes at least the first element UE 1 in the UEList set, that is, the element UE 1 with the highest priority in the priority algorithm queue.

[0119] Optionally, steps B1 - B4 for calculating the UE list of pairing group relationships are as follows:

[0120] Step B1, add the UE with the highest priority to the UEList_CompGroup array. This UE must calculate the pairing group relationship (UEGroup m ).

[0121] Step B2, based on the computing capacity of the base station device, determine that the maximum number of pairing groups that can be calculated is M_max.

[0122] Step B3, determine that the number of pairing groups M to be calculated is the minimum value between M_max and N.

[0123] Step B4, successively add the 2nd to the (M - 1)th elements of the UEList list to the UEList_CompGroup array, thereby determining the UE list that needs to calculate the pairing group relationship.

[0124] Step 3, determine the pairing groups corresponding to each element in UEList_CompGroup.

[0125] Optionally, based on each element in UEList_CompGroup, determine the corresponding pairing group respectively. For example, for the element UE_CompGroup m in UEList_CompGroup, determine the corresponding pairing group UEGroup m , UEGroup m as shown in formula (3):

[0126] UEGroup m = {UE_CompGroup m , UE_Pair m1 …, UE_Pair mK} Formula (3)

[0127] Among them, the first element of the pairing group UEGroup m is UE_CompGroup m , and the other UEs are UEs paired layer by layer. The size of the corresponding allocated frequency domain resource block is the frequency domain resource expected to be occupied by UE 1 (the first element in UEList).

[0128] Optionally, the steps C1 - C5 of the method for determining UE_Pair m in the pairing group UEGroup mk are as follows:

[0129] Step C1, assume that the ue list that has been paired in the pairing group is as shown in formula (4):

[0130]

[0131] Optionally, when k = 1, the list of UEs for which pairing has been determined has only one element, UE_CompGroup m , UEGroup m0 As shown in formula (5):

[0132] UEGroup m0 = {UE_CompGroup m} Formula (5)

[0133] Optionally, when k = 2, the list of UEs for which pairing has been determined, UEGroup m1 As shown in formula (6):

[0134]

[0135] Step C2, find the elements in the UEList list determined in step one that are not in the UEGroup m(k-1) list, and set it as the list UE_List_SELECT m(k-1) , UE_List_SELECT m(k-1) As shown in formula (7):

[0136] UE_List_SELECT m(k-1) = {UE_SELECT m(k-1)1 , …, UE_SELECT m(k-1)P} Formula (7)

[0137] Among them, the number of elements in UE_List_SELECT m(k-1) is P, and P is as shown in formula (8):

[0138] P = N - K Formula (8)

[0139] Optionally, the queuing order determination scheme for each UE in UE_List_SELECT m(k-1) is not limited.

[0140] Step C3, traverse each element in the UE_List_SELECT list, and determine the performance quantitative analysis result that can be achieved by pairing with the elements in UEGroup m(k-1) , and set it as PreList_SELECT mk , PreList_SELECT mk As shown in formula (9):

[0141] PreList_SELECT mk={Pre_SELECT mk_1 , …, Pre_SELECT mkP} Formula (9)

[0142] Optionally, specific performance is not defined, such as throughput performance or correlation performance. Taking throughput performance as an example:

[0143] Let the elements in the UE_List_SELECT m(k-1) list be UE_SELECT p , and add this element to the UEGroup m(k-1) list, denoted as UEGroup mk_p . The expected quantitative analysis result of the performance to be calculated is throughput, that is, the sum of the throughputs that can be achieved by each element in UEGroup mk_p reusing this resource, denoted as Pre_SELECT mk_p . UEGroup mk_p is as shown in Formula (10):

[0144]

[0145] Optionally, calculate the sum of the throughputs that can be achieved by each UE in UEGroup mk_p reusing this frequency domain resource. The calculation method of the corresponding throughput is not defined here. For example, based on the signal-to-noise ratio principle, that is, the sum of the spectral efficiencies mapped by the CQI of each UE in UEGroup mk_p ; or based on the signal-to-noise ratio and correlation principle, adding the impact of the correlation between UEs on the signal-to-noise ratio on the basis of the signal-to-noise ratio, etc.

[0146] Optionally, the quantitative analysis result of the performance that can be achieved by the pairing of the element UE_SELECT p in the UE_List_SELECT list and the elements in UEGroup m(k-1) is as follows. The specific determination steps C31 - C35 are shown below:

[0147] Step C31, let the performance result that can be achieved by the element m(k-1) in UEGroup be Q1 List , Q1 List is as shown in Formula (11):

[0148]

[0149] Step C32, since adding UE_SELECT p to reuse the same frequency domain resource, the corresponding performance result is updated to Q2 List , Q2 ListAs shown in formula (12):

[0150]

[0151] Step C33, determine Q1 List The sum of each element in is set as Sum1 Q .

[0152] Step C34, determine Q2 List The sum of each element in is set as Sum2 Q .

[0153] Step C35, judge if Sum2 Q > Sum1 Q , then the quantitative performance analysis result that can be achieved by pairing elements in UE_SELECT p and UEGroup m(k-1) is Sum2 Q , record it in Pre_SELECT mk_p , add it to the list PreList_SELECT mk , and thus obtain the performance after adding this UE.

[0154] Step C4, select the UE with the optimal quantitative performance analysis result as the paired UE, that is, select the optimal value in the PreList_SELECT mk list, set it as the qth element, then the qth element in the corresponding UE_List_SELECT list, UE_SELECT q , use this element as the determined paired UE, set it as UE_Pair mk , add it to UEGroup m . The steps C41 - C45 for determining the paired UE are as follows:

[0155] Step C41, for each element in the UE_List_SELECT list, determine the quantitative performance analysis result PreList_SELECT m(k-1) that can be achieved by pairing with the elements in UEGroup mk , and sort each of these elements in descending order.

[0156] Step C42, set the UE corresponding to the first element after sorting as UE_SELECT q , and the number of transmission streams of this UE for this resource is Rank_UE_SELECT q .

[0157] Step C43, obtain the total multiplexing layer number of this frequency domain resource before adding the pairing of this UE as RankNum.

[0158] Step C44, when the sum of RankNum and Rank_UE_SELECT q , that is, the total number of layers after adding this paired UE is greater than the maximum multiplexing layer threshold, then this UE is not used as a paired UE, and go to Step C41 to continue searching for the next UE.

[0159] Step C45, when the sum of RankNum and Rank_UE_SELECT q , that is, the total number of layers after adding this paired UE is not greater than the maximum multiplexing layer threshold, then this UE is used as the determined paired UE, set as UE_Pair mk , and add it to UEGroup m .

[0160] Step C5, based on the above Steps C1 - C4, a total of M paired groups are determined. The M paired groups are shown in Formula (13):

[0161]

[0162] Among them, the elements in each paired group are shown in Formula (14):

[0163]

[0164] Step Four, determine the paired group where the UE 1 is located from the M paired groups in UEGroupList.

[0165] Optionally, determine the set of paired groups containing the UE 1 from the M paired groups in UEGroupList. The set of paired groups containing the UE 1 is set as UEGroupList ue1 . Let the number of elements in UEGroupList ue1 be R, and R is a positive integer.

[0166] Step Five, determine the paired group with the optimal performance quantitative analysis result from the R paired groups in UEGroupList ue1 . The steps D1 - D4 for determining the paired group with the optimal performance quantitative analysis result, which is the third UE list, are as follows:

[0167] Step D1, for each paired group in UEGroupList ue1 , find the corresponding position in PreList_SELECT mk . For example, for the r - th element, find the corresponding element Pre mk in PreList_SELECT r , and add it to Array

[0168] Step D2, UEGroupList ue1 The performance analysis results corresponding to each pairing group in are shown in formula (15):

[0169]

[0170] Step D3, find the largest element from the array, and the corresponding pairing group is UEGroup_out, and UEGroup_out is shown in formula (16):

[0171] UEGroup_out = {UE_out 1 , …, UE_out V} Formula (16)

[0172] Step D4, the pairing group UEGroup_out is the third UE list, and each UE in the pairing group UEGroup_out multiplexes the resources scheduled by the base station, and the resources scheduled by the base station are used for the base station to send data to each UE in UEGroup_out.

[0173] An embodiment of the present application provides a resource scheduling method, which is applied to a network node. The method includes:

[0174] Step 11, determine the UE list UEList queued based on the priority algorithm, where the number of elements is 8, and the UE list UEList is as follows:

[0175] UEList = {5, 1, 2, 0, 3, 7, 6, 4}

[0176] Step 12, calculate the UE list UEList_CompGroup of the pairing group relationship, where the number of elements is 8, and UEList_CompGroup is as follows:

[0177] UEList_CompGroup = {0, 1, 2, 3, 4, 5, 6, 7}

[0178] Step 13, calculate the pairing groups corresponding to each element in UEList_CompGroup.

[0179] For example, for the element UE_CompGroup 3 = 2 in UEList_CompGroup, determine the corresponding pairing group UEGroup 3 as follows:

[0180]

[0181] The set of each pairing group determined based on Step 13 is as follows:

[0182]

[0183] Step 14, the UE with the highest priority in the UEList queue is 5. From the pairing groups determined in Step 13, query the pairing group where UE5 is located. R = 4. The pairing groups where UE5 is located are as follows:

[0184]

[0185] Step 15, the performance quantitative analysis results corresponding to the pairing groups where UE5 is located in Step 14 are as follows:

[0186]

[0187] Among them, the pairing group corresponding to 391 is {0, 5, 7, 6}, the pairing group corresponding to 376 is {1, 2, 5, 7}, the pairing group corresponding to 424 is {4, 5, 7, 6}, and the pairing group corresponding to 381 is {5, 7, 1, 4}; the optimal value of the performance quantitative analysis result is 424, and the pairing group corresponding to 424 is {4, 5, 7, 6}. Therefore, the UEs in the pairing group {4, 5, 7, 6} reuse the resources scheduled by the network node.

[0188] An embodiment of the present application provides a resource scheduling method applied to a network node. The method includes:

[0189] Step 21, determine the UE list UEList queued based on the priority algorithm, where the number of elements is 8. The UE list UEList is as follows:

[0190] UEList = {5, 1, 2, 0, 3, 7, 6, 4}

[0191] Step 22, calculate the UE list UEList_CompGroup of the pairing group relationship, where the number of elements is 4. UEList_CompGroup is as follows:

[0192] UEList_CompGroup = {0, 1, 2, 5}

[0193] Step 23, calculate the pairing groups corresponding to each element in UEList_CompGroup.

[0194] For example, for the element UE_CompGroup in UEList_CompGroup 3 = 2, determine the corresponding pairing group UEGroup 3 as follows:

[0195] UEGroup 3 = {2, UE_Pair 31 …, UE_Pair 3K}

[0196] The set of each pairing group determined based on step 23 is as follows:

[0197]

[0198] Step 24, the UE with the highest priority in the UEList queue is 5. From the pairing groups determined in step 23, query the pairing group where UE5 is located. R = 3. The pairing groups where UE5 is located are as follows:

[0199]

[0200] Step 25, the performance quantitative analysis results corresponding to the pairing groups where UE5 is located in step 24 are as follows:

[0201]

[0202] Among them, the pairing group corresponding to 391 is {0, 5, 7, 6}, the pairing group corresponding to 376 is {1, 2, 5, 7}, and the pairing group corresponding to 381 is {5, 7, 1, 4}; the optimal value of the performance quantitative analysis result is 391, and the corresponding pairing group is the third group {0, 5, 7, 6}. Therefore, the UEs in the pairing group {0, 5, 7, 6} reuse the resources scheduled by the network node.

[0203] The technical solution provided by the embodiment of the present application has at least the following beneficial effects:

[0204] On the basis of ensuring the priority of the resources occupied by the UE scheduled by the base station, the resource scheduling efficiency is improved, and the performance such as network throughput is enhanced.

[0205] Based on the same inventive concept, the embodiment of the present application also provides a resource scheduling device, which is applied to a network node. The structural schematic diagram of the device is as Figure 3 shown. The transceiver 1200 is used to receive and send data under the control of the processor 1210.

[0206] Among them, in Figure 3Among them, the bus architecture may include any number of interconnected buses and bridges, specifically, various circuits represented by one or more processors represented by processor 1210 and memory represented by memory 1220 are linked together. The bus architecture may also link together various other circuits such as peripheral devices, voltage regulators, and power management circuits, which are well known in the art, and thus will not be further described herein. The bus interface provides an interface. The transceiver 1200 may be multiple components, that is, including a transmitter and a receiver, and provides a unit for communicating with various other devices on a transmission medium, and these transmission mediums include wireless channels, wired channels, optical fiber cables and other transmission mediums. The processor 1210 is responsible for managing the bus architecture and general processing, and the memory 1220 may store data used by the processor 1210 when executing operations.

[0207] The processor 1210 may be a central processing unit (CPU), an application specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or a complex programmable logic device (CPLD), and the processor may also adopt a multi-core architecture.

[0208] The processor 1210 is used to read the computer program in the memory and perform the following operations:

[0209] Obtain a first user equipment UE list, and each UE in the first UE list is sorted based on the priority of the resources occupied by each UE scheduled by a network node;

[0210] According to the priority sorting of each UE in the first UE list, determine a second UE list including at least one UE, and the at least one UE includes the UE with the highest priority;

[0211] Determine the pairing group corresponding to each UE in the second UE list;

[0212] According to the pairing group corresponding to each UE in the second UE list, determine a third UE list, and each UE in the third UE list multiplexes the resources scheduled by the network node, and the resources scheduled by the network node are used for the network node to send data to each UE in the third UE list.

[0213] Optionally, obtaining a first user equipment UE list includes:

[0214] Obtain N UEs waiting for network node scheduling, where N is a positive integer;

[0215] Determine the priority of each UE among the N UEs to occupy the resources scheduled by the network node according to the preset priority policy;

[0216] Determine the first UE list according to the priority of each UE among the N UEs to occupy the resources scheduled by the network node. The first UE list includes the N UEs, and the N UEs are sorted in descending order of priority.

[0217] Optionally, determine the second UE list including at least one UE according to the priority sorting of each UE in the first UE list, including:

[0218] Determine the number M of UEs in the second UE list according to the computing power of the preset network node and the number of UEs in the first UE list, where M is a positive integer;

[0219] Determine the second UE list according to the first M UEs sorted in descending order of priority in the first UE list. The second UE list includes M UEs.

[0220] Optionally, determine the pairing group corresponding to each UE in the second UE list, including:

[0221] Determine at least one paired UE corresponding to each UE in the second UE list according to the preset pairing policy;

[0222] Construct each UE and at least one paired UE into the pairing group corresponding to each UE. The first UE list includes at least one paired UE.

[0223] Optionally, determine at least one paired UE corresponding to each UE in the second UE list according to the preset pairing policy, including:

[0224] Sum the throughput of one UE in the second UE list with the throughput of each UE except one UE in the first UE list to obtain the total throughput corresponding to each UE except one UE;

[0225] Determine the UE corresponding to the largest total throughput among the total throughputs as the paired UE of one UE.

[0226] Optionally, determine the third UE list according to the pairing group corresponding to each UE in the second UE list, including:

[0227] Obtain at least two pairing groups including the UE with the highest priority according to the pairing group corresponding to each UE in the second UE list;

[0228] Determine the quantitative values corresponding to at least two pairing groups including the UE with the highest priority according to at least two pairing groups including the UE with the highest priority and the preset UE performance quantitative analysis policy;

[0229] Determine the pairing group corresponding to the largest quantitative value among the respective quantitative values as the third UE list.

[0230] Optionally, the quantitative value is positively correlated with the throughput of the pairing group corresponding to the quantitative value, and the throughput corresponding to the largest quantitative value is the sum of the throughputs of the UEs in the third UE list.

[0231] It should be noted here that the above device provided in the embodiments of the present invention can implement all the method steps implemented in the above method embodiments and can achieve the same technical effects. The same parts and beneficial effects as those in the method embodiments will not be specifically described in this embodiment.

[0232] Based on the same inventive concept as the foregoing embodiments, an embodiment of the present application further provides a resource scheduling device. The structural schematic diagram of the device is as Figure 4 shown. Based on the resource scheduling device 30, it includes a first processing unit 301, a second processing unit 302, a third processing unit 303, and a fourth processing unit 304.

[0233] The first processing unit 301 is configured to obtain a first user equipment (UE) list, and the UEs in the first UE list are sorted based on the priorities of the resources occupied by the respective UEs for network node scheduling.

[0234] The second processing unit 302 is configured to determine a second UE list including at least one UE according to the priority sorting of the respective UEs in the first UE list, and the at least one UE includes the UE with the highest priority.

[0235] The third processing unit 303 is configured to determine the pairing groups respectively corresponding to the UEs in the second UE list.

[0236] The fourth processing unit 304 is configured to determine a third UE list according to the pairing groups respectively corresponding to the UEs in the second UE list. The UEs in the third UE list multiplex the resources scheduled by the network node, and the resources scheduled by the network node are used for the network node to send data to the UEs in the third UE list.

[0237] Optionally, the first processing unit 301 is specifically configured to obtain N UEs waiting for network node scheduling, where N is a positive integer; determine the priorities of the resources occupied by the respective N UEs for network node scheduling according to a preset priority policy; and determine the first UE list according to the priorities of the resources occupied by the respective N UEs for network node scheduling. The first UE list includes N UEs, and the N UEs are sorted from highest to lowest priority.

[0238] Optionally, the second processing unit 302 is specifically configured to determine the number M of UEs in the second UE list according to the computing capabilities of preset network nodes and the number of UEs in the first UE list, where M is a positive integer; determine the second UE list according to the top M UEs sorted in descending order of priority in the first UE list, and the second UE list includes M UEs.

[0239] Optionally, the third processing unit 303 is specifically configured to determine at least one paired UE corresponding to each UE in the second UE list according to a preset pairing strategy; construct a pairing group corresponding to each UE with each UE and at least one paired UE, and the first UE list includes at least one paired UE.

[0240] Optionally, the third processing unit 303 is specifically configured to sum the throughput of a UE in the second UE list with the throughput of each UE other than the one UE in the first UE list to obtain the total throughput corresponding to each UE other than the one UE; determine the UE corresponding to the largest total throughput among the total throughputs as the paired UE of the one UE.

[0241] Optionally, the fourth processing unit 304 is specifically configured to obtain at least two pairing groups including the UE with the highest priority according to the pairing groups corresponding to the UEs in the second UE list; determine the quantitative values corresponding to at least two pairing groups including the UE with the highest priority according to at least two pairing groups including the UE with the highest priority and a preset UE performance quantitative analysis strategy; determine the pairing group corresponding to the largest quantitative value among the quantitative values as the third UE list.

[0242] Optionally, the quantitative value is positively correlated with the throughput of the pairing group corresponding to the quantitative value, and the throughput corresponding to the largest quantitative value is the sum of the throughputs of the UEs in the third UE list.

[0243] It should be noted here that the above device provided by the embodiment of the present invention can implement all the method steps implemented by the above method embodiment and can achieve the same technical effect. The same parts and beneficial effects as those in the method embodiment will not be specifically described in this embodiment.

[0244] It should be noted that the division of units in the embodiments of the present application is illustrative, only a logical function division, and there may be other division methods in actual implementation. In addition, in each embodiment of the present application, each functional unit may be integrated in a processing unit, or each unit may exist physically alone, or two or more units may be integrated in one unit. The above integrated unit may be implemented in the form of hardware or in the form of a software functional unit.

[0245] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a processor-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of this technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) or a processor to execute all or part of the steps of the methods described in various embodiments of this application. The aforementioned storage medium includes: various media that can store program codes, such as USB flash drives, mobile hard disks, read-only memories (ROM), random access memories (RAM), magnetic disks, or optical discs.

[0246] Based on the same inventive concept, an embodiment of this application also provides a processor-readable storage medium storing a computer program, which is used to implement the steps of any resource scheduling method provided by any one embodiment or any optional implementation manner in the embodiments of this application when being executed by a processor.

[0247] The processor-readable storage medium can be any available medium or data storage device accessible by the processor, including but not limited to magnetic memories (such as floppy disks, hard disks, magnetic tapes, magneto-optical discs (MO), etc.), optical memories (such as CDs, DVDs, BDs, HVDs, etc.), and semiconductor memories (such as ROM, EPROM, EEPROM, non-volatile memories (NAND FLASH), solid-state drives (SSD)).

[0248] Those skilled in the art should understand that the embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware aspects. Moreover, this application can adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk memories and optical memories, etc.) containing computer-usable program codes.

[0249] This application is described with reference to the flowcharts and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the present application. It should be understood that each flow and / or block in the flowcharts and / or block diagrams, as well as the combination of flows and / or blocks in the flowcharts and / or block diagrams, can be implemented by computer-executable instructions. These computer-executable instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing devices to generate a machine, such that the instructions executed by the processor of the computer or other programmable data processing devices produce a means for implementing the functions specified in the Figure 1 one or more flows and / or blocks Figure 1 one or more blocks.

[0250] These processor-executable instructions can also be stored in a processor-readable memory that can direct a computer or other programmable data processing device to work in a specific manner, such that the instructions stored in the processor-readable memory produce a manufactured article including an instruction means that implements the functions specified in the Figure 1 one or more flows and / or blocks Figure 1 one or more blocks.

[0251] These processor-executable instructions can also be loaded onto a computer or other programmable data processing device, such that a series of operational steps are performed on the computer or other programmable device to generate a computer-implemented process, and thus the instructions executed on the computer or other programmable device provide steps for implementing the functions specified in the Figure 1 one or more flows and / or blocks Figure 1 one or more blocks.

[0252] Obviously, those skilled in the art can make various changes and modifications to this application without departing from the spirit and scope of this application. Thus, if these modifications and variations of this application fall within the scope of the claims of this application and their equivalent technologies, this application is also intended to include these changes and modifications.

Claims

1. A resource scheduling method, applied to a network node, characterized in that, the method includes: Obtain a first list of user equipment (UE), and the UEs in the first UE list are sorted based on the priorities of the resources occupied by the respective UEs from the network node scheduling; According to the priority sorting of each UE in the first UE list, determine a second UE list including at least one UE, and the at least one UE includes the UE with the highest priority; Determine the pairing groups corresponding to each UE in the second UE list; According to the pairing groups corresponding to each UE in the second UE list, determine a third UE list, and the UEs in the third UE list reuse the resources scheduled by the network node, and the resources scheduled by the network node are used for the network node to send data to each UE in the third UE list; The determining the third UE list according to the pairing groups corresponding to each UE in the second UE list includes: According to the pairing groups corresponding to each UE in the second UE list, obtain at least two pairing groups including the UE with the highest priority; According to the at least two pairing groups including the UE with the highest priority and a preset UE performance quantitative analysis strategy, determine the quantitative values corresponding to the at least two pairing groups including the UE with the highest priority; Determine the pairing group corresponding to the maximum quantitative value among the quantitative values as the third UE list.

2. The method according to claim 1, characterized in that, the obtaining the first list of user equipment (UE) includes: Obtain N UEs waiting for the network node to schedule, where N is a positive integer; According to a preset priority policy, determine the priorities of the resources occupied by each UE among the N UEs from the network node scheduling; According to the priorities of the resources occupied by each UE among the N UEs from the network node scheduling, determine the first UE list, and the first UE list includes the N UEs, and the N UEs are sorted from highest to lowest priority.

3. The method according to claim 1, characterized in that, the determining the second UE list including at least one UE according to the priority sorting of each UE in the first UE list includes: According to the computing power of the preset network node and the number of UEs in the first UE list, determine the number M of UEs in the second UE list, where M is a positive integer; According to the first M UEs sorted from highest to lowest priority in the first UE list, determine the second UE list, and the second UE list includes the M UEs.

4. The method according to claim 1, characterized in that, the determining the pairing groups corresponding to each UE in the second UE list includes: According to a preset pairing policy, determine at least one paired UE corresponding to each UE in the second UE list; Construct the pairing group corresponding to each UE from the each UE and the at least one paired UE, and the first UE list includes the at least one paired UE.

5. The method according to claim 4, characterized in that, Determining at least one paired UE corresponding to each UE in the second UE list according to a preset pairing strategy includes: Summing the throughput of a UE in the second UE list with the throughput of each UE in the first UE list except the said UE, to obtain the total throughput corresponding to each UE in the first UE list except the said UE; Determining the UE corresponding to the maximum total throughput among the total throughputs as the paired UE of the said UE.

6. The method according to claim 1, wherein, The quantitative value is positively correlated with the throughput of the pairing group corresponding to the quantitative value, and the throughput corresponding to the maximum quantitative value is the sum of the throughputs of the UEs in the third UE list.

7. A resource scheduling apparatus, applied to a network node, wherein, it includes a memory, a transceiver, and a processor: The memory is used for storing computer programs; the transceiver is used for transmitting and receiving data under the control of the processor; the processor is used for reading the computer programs in the memory and performing the following operations: Obtaining a first user equipment (UE) list, where the UEs in the first UE list are sorted based on the priority of the resources occupied by the UEs from the network node; Determining a second UE list including at least one UE according to the priority sorting of the UEs in the first UE list, where the at least one UE includes the UE with the highest priority; Determining the pairing group corresponding to each UE in the second UE list; Determining a third UE list according to the pairing groups corresponding to each UE in the second UE list, where the UEs in the third UE list multiplex the resources scheduled by the network node, and the resources scheduled by the network node are used for the network node to send data to the UEs in the third UE list; The determining the third UE list according to the pairing groups corresponding to each UE in the second UE list includes: Obtaining at least two pairing groups including the UE with the highest priority according to the pairing groups corresponding to each UE in the second UE list; Determining the quantitative value corresponding to each of the at least two pairing groups including the UE with the highest priority according to the at least two pairing groups including the UE with the highest priority and a preset UE performance quantitative analysis strategy; Determining the pairing group corresponding to the maximum quantitative value among the quantitative values as the third UE list.

8. The apparatus according to claim 7, wherein, The obtaining the first user equipment (UE) list specifically includes: Obtaining N UEs waiting for scheduling by the network node, where N is a positive integer; Determining the priority of the resources occupied by each of the N UEs from the network node according to a preset priority strategy; Determining a first UE list according to the priority of the resources occupied by each of the N UEs from the network node, where the first UE list includes the N UEs, and the N UEs are sorted from highest to lowest priority.

9. The apparatus according to claim 7, wherein, Determining a second UE list including at least one UE according to the priority sorting of each UE in the first UE list specifically includes: Determining the number M of UEs in the second UE list according to the preset computing power of the network node and the number of UEs in the first UE list, where M is a positive integer; Determining a second UE list according to the first M UEs sorted in descending order of priority in the first UE list, where the second UE list includes the M UEs.

10. The apparatus according to claim 7, wherein, Determining the pairing groups corresponding to each UE in the second UE list specifically includes: Determining at least one paired UE corresponding to each UE in the second UE list according to a preset pairing strategy; Constructing a pairing group corresponding to each UE by using each UE and the at least one paired UE, where the first UE list includes the at least one paired UE.

11. The apparatus according to claim 10, wherein, Determining at least one paired UE corresponding to each UE in the second UE list according to a preset pairing strategy specifically includes: Summing the throughput of a UE in the second UE list with the throughput of each UE other than the one UE in the first UE list to obtain the total throughput corresponding to each UE other than the one UE; Determining the UE corresponding to the maximum total throughput among the total throughputs as the paired UE of the one UE.

12. The apparatus according to claim 7, wherein, The quantitative value is positively correlated with the throughput of the pairing group corresponding to the quantitative value, and the throughput corresponding to the maximum quantitative value is the sum of the throughputs of the UEs in the third UE list.

13. A resource scheduling apparatus applied to a network node, wherein, comprising: A first processing unit, configured to obtain a first user equipment (UE) list, where the UEs in the first UE list are sorted based on the priority of the resources occupied by the UEs scheduled by the network node; A second processing unit, configured to determine a second UE list including at least one UE according to the priority sorting of each UE in the first UE list, where the at least one UE includes the UE with the highest priority; A third processing unit, configured to determine the pairing groups corresponding to each UE in the second UE list; A fourth processing unit, configured to determine a third UE list according to the pairing groups corresponding to each UE in the second UE list, where the UEs in the third UE list multiplex the resources scheduled by the network node, and the resources scheduled by the network node are used by the network node to send data to the UEs in the third UE list; The fourth processing unit is specifically configured to: Obtain at least two pairing groups including the UE with the highest priority according to the pairing groups corresponding to each UE in the second UE list; Determine the quantitative values respectively corresponding to the at least two pairing groups including the UE with the highest priority according to the at least two pairing groups including the UE with the highest priority and a preset UE performance quantitative analysis strategy; Determine the pairing group corresponding to the maximum quantitative value among the quantitative values as the third UE list.

14. A processor-readable storage medium, characterized in that, the processor-readable storage medium stores a computer program, and the computer program is used to cause the processor to execute the method according to any one of claims 1 to 6.

Images