CN104918256B - A kind of transmission dispatching method and device - Google Patents

Abstract

The invention discloses a kind of transmission dispatching method and devices.The method of the present invention includes：It determines and waits for dispatch terminal and the cooperation cell set for waiting for dispatch terminal；Gather division of cells submanifold according to the cooperation cell for waiting for dispatch terminal；Wherein, by cooperation cell set have intersection wait for dispatch terminal and the cooperation cell have intersection wait for dispatch terminal cooperation cell set be divided into identical cell submanifold, include a terminal set and a set of cells in each cell submanifold, the set of cells in the submanifold of different community does not have intersection；Wait for that dispatch terminal is transmitted scheduling to described according to obtained cell submanifold is divided.Centralized dispatching complexity can be reduced using the present invention, reduce scheduling delay.

Description

Transmission scheduling method and device

Technical Field

The present invention relates to the field of wireless communications, and in particular, to a transmission scheduling method and apparatus.

Background

In order to reduce the interference of neighboring cells of users at the edge of cell coverage, the LTE (long term evolution) system introduces a CoMP (coordinated-multiple-point) transmission technology. The CoMP transmission technique is cooperation between a plurality of Transmission Points (TPs) separated in geographical locations. When an edge UE (user equipment, also called a terminal) is in an edge area where two cells overlap, a main cell and a cooperative cell simultaneously transmit downlink data to the UE or receive uplink data on the same time-frequency resource, and signals from multiple transmission points are superimposed in the air, so that a signal at a receiving end is enhanced, interference sources are reduced, and interference is weakened, thereby improving the performance of the edge user.

Generally, a centralized scheduling method is adopted to allocate resources for multi-cell joint transmission to CoMP UEs in the system. The centralized scheduling method is to use all CoMP UEs (or further including non-CoMP UEs) in the system and resources of all cells in a cell cluster as a whole, to uniformly perform priority ordering of users and resources, and complete PUSCH/PDSCH (Physical uplink Shared Channel/Physical Downlink Shared Channel) resource allocation. The cell cluster is a cell set which is planned by an operator and applies the CoMP technology.

Theoretically, the more cells participating in centralized scheduling (i.e., the larger the size of a cell cluster), the better the interference coordination effect of cooperative transmission, but the higher the complexity of the scheduling algorithm of cooperative transmission.

However, when the number of cells included in a cell cluster using the CoMP technology planned by an operator is large and the number of UEs in a system is large, the complexity of centralized scheduling is high, scheduling delay is long, and therefore the UE with a low priority is likely to have too much time to allocate resources, which results in low resource allocation execution efficiency of centralized scheduling. When these problems cannot be solved, the centralized scheduling is less realizable.

For a centralized scheduling system, a technical scheme for effectively reducing the complexity of centralized scheduling and reducing the scheduling delay is not available in the industry at present.

Disclosure of Invention

The embodiment of the invention provides a transmission scheduling method and a transmission scheduling device, which are used for reducing the complexity of centralized scheduling and reducing the scheduling delay.

The transmission scheduling method provided by the embodiment of the invention comprises the following steps:

determining a terminal to be scheduled and a cooperative cell set of the terminal to be scheduled;

dividing cell sub-clusters according to the cooperation cell set of the terminal to be scheduled; dividing a terminal to be scheduled with an intersection in a cooperative cell set and the cooperative cell set of the terminal to be scheduled with the intersection in the cooperative cell set into the same cell sub-cluster, wherein each cell sub-cluster comprises a terminal set and a cell set, and the cell sets in different cell sub-clusters are not intersected;

and performing transmission scheduling on the terminal to be scheduled according to the divided cell sub-clusters.

The transmission scheduling device provided by the embodiment of the invention comprises:

the device comprises a determining unit, a scheduling unit and a scheduling unit, wherein the determining unit is used for determining a terminal to be scheduled and a cooperation cell set of the terminal to be scheduled;

a sub-cluster dividing unit, configured to divide cell sub-clusters according to the cooperation cell set of the terminal to be scheduled; dividing a terminal to be scheduled with an intersection in a cooperative cell set and the cooperative cell set of the terminal to be scheduled with the intersection in the cooperative cell set into the same cell sub-cluster, wherein each cell sub-cluster comprises a terminal set and a cell set, and the cell sets in different cell sub-clusters are not intersected;

and the scheduling unit is used for carrying out transmission scheduling on the terminal to be scheduled according to the divided cell sub-clusters.

In the above embodiment of the present invention, since the cooperative cell set of the terminal to be scheduled is divided into the cell sub-clusters, so that the terminal to be scheduled having intersection in the cooperative cell set and the cooperative cell set of the terminal to be scheduled having intersection in the cooperative cell set are divided into the same cell sub-clusters, and the cell sets in different cell sub-clusters do not have intersection, that is, the cell sub-clusters are divided according to the cell cooperation relationship, so that a larger cell cluster is divided into smaller cell sub-clusters.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive exercise.

Fig. 1 is a schematic diagram of a transmission scheduling process according to an embodiment of the present invention;

fig. 2 is a schematic diagram of a cell sub-cluster division process according to an embodiment of the present invention;

fig. 3 is a schematic diagram of a cell sub-cluster decomposition process according to an embodiment of the present invention;

fig. 4 is a schematic structural diagram of a transmission scheduling apparatus according to an embodiment of the present invention.

Detailed Description

The embodiment of the invention provides a transmission scheduling scheme applied to a centralized scheduling system, which combines the cooperative cell aggregation condition of UE (user equipment) to divide a larger cell cluster into smaller cell sub-clusters on the premise of ensuring that the overall scheduling performance of the centralized scheduling system is not lost or is less lost, and performs transmission scheduling independently and parallelly based on each cell sub-cluster, so that compared with the prior art, the complexity of centralized scheduling can be decomposed, the resource allocation efficiency of users in centralized scheduling is improved, and the scheduling delay is reduced.

The embodiment of the invention is applied to a centralized scheduling system. The centralized scheduling system may include any other system that introduces a centralized scheduling node and performs centralized scheduling through the centralized scheduling node, besides the system using the CoMP technology. Technologies for centralizing scheduling requirements are known, and include centralized ICIC (Inter-cell interference Coordination) technology in addition to CoMP technology. The centralized ICIC technology allocates (or plans) edge resource sets to each cell governed by the node through a centralized scheduling node, and generally requires to acquire relevant information of each cell, such as user information, resource information, and the like, in the allocation process. The purpose of the centralized ICIC technique is to improve the performance of the edge user, so that when allocating resources, it needs to determine whether the UE is an edge UE, and plan which neighboring cells are interference coordination cells for the edge UE. Therefore, similar to the CoMP technology, the centralized ICIC technology determines the edge UE first, and then considers resource allocation by combining the neighboring cell list of the edge UE.

Embodiments of the present invention are implemented by a network device, i.e., a node in a centralized scheduling system for performing centralized scheduling. For example, in a centralized scheduling system employing CoMP technology, the network device may be a node for performing CoMP centralized scheduling. For another example, in a centralized scheduling system that employs a centralized ICIC technique, the network device may be a node for performing ICIC centralized scheduling.

The following describes an application of the embodiment of the present invention in a CoMP technology as an example, and a specific implementation process of the embodiment of the present invention in other centralized scheduling systems is similar to this.

Referring to fig. 1, a schematic diagram of a transmission scheduling process according to an embodiment of the present invention is provided. The flow is performed by a node for performing CoMP-centralized scheduling. As shown in fig. 1, the process may include the following steps 10 to 30:

step 10: determining UE to be scheduled and a cooperative cell set of the UE to be scheduled;

step 20: dividing cell sub-clusters according to the cooperation cell set of the UE to be scheduled; dividing UE to be scheduled with intersection in a cooperative cell set and the cooperative cell set of the UE to be scheduled with intersection in the cooperative cell set into the same cell sub-cluster, wherein each cell sub-cluster comprises a terminal set and a cell set, and the cell sets in different cell sub-clusters are not intersected;

step 30: and performing transmission scheduling on the UE to be scheduled according to the divided cell sub-clusters. That is, on a per cell sub-cluster basis, the UEs within the respective cell sub-clusters are independently scheduled for transmission in parallel.

In step 10 of the above flow, in the centralized scheduling system using the CoMP technology, the CoMP centralized scheduling node first determines the UEs suitable for CoMP transmission (hereinafter, the UEs suitable for CoMP transmission are referred to as CoMP UEs), and then determines a coordinated cell set for the CoMP UEs (in the centralized scheduling system using the CoMP technology, the coordinated cell set is referred to as a CoMP cell set).

In step 10, generally considering that the CoMP technology is applied to the cell-edge user when selecting the CoMP UE, so as to improve the performance of the cell-edge user, therefore, the basic principle of selecting the CoMP UE is as follows: and determining edge UE in the system as CoMP UE, and determining UE in a cell center in the system as non-CoMP UE.

In step 10, the basic principle when determining the CoMP cell set for the CoMP UE is to select neighboring cells with smaller channel quality difference from the UE serving cell to form the CoMP cell set. The CoMP cell set includes two types, one is a measurement set of the UE, and the other is a transmission set of the UE. The measurement set refers to a set of cells for measuring uplink/downlink channel quality by a base station; a transmission set refers to a set of cells that directly or indirectly participate in PDSCH and/or PUSCH data transmission for a UE. In general, the transmission set is a subset of or equal to the measurement set.

Preferably, for a non-CoMP UE in a centralized scheduling system using a CoMP technology, a corresponding CoMP cell set of the non-CoMP UE only includes a serving cell of the UE.

After determining that the CoMP UE in the centralized scheduling system using the CoMP technology and the CoMP cell set corresponding to each CoMP UE are completed, the partition process of the cell sub-cluster, that is, the execution process of step 20, is triggered.

As described above, the CoMP cell set may include a measurement set and a transmission set, and thus, in step 20, the method for dividing the cell sub-clusters based on the CoMP cell set may be divided into two types, one is divided according to the measurement set of the UE, and the other is divided according to the transmission set of the UE. The two partitioning methods are basically the same in implementation process, and only differ in the referred set information. Since the measurement set is generally greater than or equal to the transmission set and considering that the update frequency of the measurement set may be lower than that of the transmission set, if the division of the cell sub-clusters is performed based on the measurement set, the size of the cell sub-clusters is relatively large, the total number of the cell sub-clusters may be small, but the frequency of the cell sub-clusters is relatively low; if the division of the cell sub-clusters is performed based on the transmission set, the size of the cell sub-clusters is relatively small, the total number of the cell sub-clusters may be large, and the frequency of the cell sub-clusters is relatively high. The specific aggregation form adopted for the cell sub-cluster division depends on the number of cooperative cells in the system, the number of UEs in the system, and the acceptable complexity of the system. For example, when the number of cooperative cells in the system is large, a cell cluster division method based on a measurement set can be adopted to reduce the total number of cell clusters and reduce the requirements on software and hardware of the system; for another example, when the acceptable complexity requirement of the system is high, a cell sub-cluster division method based on a measurement set may be adopted to reduce the scale of the cell sub-cluster, thereby reducing the complexity of centralized scheduling of the system.

In step 20, the following basic principles may be adopted when performing cell sub-cluster division: terminals to be scheduled with intersection in the CoMP cell set and the CoMP cell set of the terminals are divided into the same cell sub-clusters, each cell sub-cluster comprises a terminal set and a cell set, and the cell sets in different cell sub-clusters have no intersection. The meaning of the terminal to be scheduled with an intersection in the CoMP cell set is as follows: at least one of the cells contained in the CoMP cell set of the two UE to be scheduled is the same; the meaning of "the sets of cells in different cell sub-clusters do not intersect" means: the cells included in the cell sets in any two cell sub-clusters are different from each other.

Based on the above cell sub-cluster division principle, various specific implementation manners can be adopted for cell sub-cluster division. Fig. 2 shows a preferred method of cell sub-cluster division.

As shown in fig. 2, the preferred method for dividing cell sub-clusters may include the following steps:

step 21: and sequencing according to the number of the cells and the cell IDs in the CoMP cell set of the CoMP UE to be scheduled, and then turning to the step 22.

One preferred sorting method is: and sequencing the CoMP UE according to the sequencing priority from high to low. The larger the CoMP cell set (i.e., the larger the number of cells in the CoMP set), the higher the ranking priority of the CoMP UE. For two or more CoMP UEs with the same size in the CoMP cell set, sequencing the cells in the CoMP cell set of the CoMP UEs according to the sequence of the ID values of the cells from small to large, and then comparing the cell IDs from small to large; the method comprises the steps of firstly comparing first cell IDs in each CoMP cell set, enabling the priority of CoMP UE with smaller cell ID values to be high, comparing second cell IDs in the sets for the CoMP cell sets with the same first cell IDs if the first cell IDs in two or more CoMP cell sets are the same at the time, enabling the priority of the CoMP UE with smaller cell ID values to be high, enabling the priority of the CoMP cell sets with the same second cell IDs to be same in the two or more CoMP cell sets if the second cell IDs in the two or more CoMP cell sets are the same at the time, comparing third cell IDs in the sets for the CoMP cell sets with the same second cell IDs, and so on until the sorting priority of each CoMP UE is determined. Of course, when the cells in the CoMP cell set with the same size are sorted according to the ID values of the cells, the cells can also be sorted in descending order, accordingly, when the cell IDs are compared, the comparison is started from the last cell ID, and if there are still the same cell IDs, the previous cell ID is compared, and so on.

Step 22: for the ith CoMP UE in the sorted CoMP UEs, if the cell sub-cluster is not obtained by division currently, the step 23 is executed; if the cell sub-cluster is obtained by dividing currently, go to step 24. The initial value of parameter i is set to 1.

Step 23: creating a cell sub-cluster, adding the ith CoMP UE into the terminal set of the newly created cell sub-cluster, adding the cells in the CoMP cell set of the ith CoMP UE into the cell set of the newly created cell sub-cluster, and then turning to step 28.

Step 24: respectively comparing the CoMP cell set of the ith CoMP UE with the cell sets in each divided cell sub-cluster, and executing one of the steps 25-27 according to the comparison result:

step 25: if the CoMP cell set of the ith CoMP UE intersects with the cell set of a certain cell sub-cluster and only intersects with the cell set of the cell sub-cluster (denoted as result 1 in the figure), the ith CoMP UE is added to the terminal set of the cell sub-cluster, a cell which is not overlapped with the cell set of the cell sub-cluster in the CoMP cell set of the ith CoMP UE is added to the cell set of the cell sub-cluster, and then the procedure goes to step 28.

Step 26: if there is an intersection between the CoMP cell set of the ith CoMP UE and the cell sets of the divided cell sub-clusters (denoted as result 2 in the figure), merging the cell sub-clusters, adding the ith CoMP UE to the terminal set of the merged cell sub-cluster, adding the cells, which are not overlapped with the cell set of the merged cell sub-cluster, in the cooperation cell set of the ith CoMP UE, to the merged cell set, and then going to step 28.

Step 27: if the CoMP cell set of the ith CoMP UE does not intersect with the cell set of any divided cell sub-cluster (marked as result 3 in the figure), a cell sub-cluster is created, the ith CoMP UE is added to the terminal set of the currently newly created cell sub-cluster, the cells in the CoMP cell set of the ith CoMP UE are added to the cell set of the currently newly created cell sub-cluster, and then the procedure goes to step 28.

Step 28: and judging whether the ith CoMP UE is the last UE in the sorted CoMP UE set, if so, ending the process, and otherwise, turning to the step 29.

Step 29: the value of the parameter i is incremented, i.e. set to i +1, and then step 22 is performed to process the next UE.

The sorting method adopted in step 21 of the flow shown in fig. 2 may also be: and sequencing the CoMP UE according to the sequencing priority from high to low. Wherein, the smaller the CoMP cell set (i.e. the smaller the number of cells in the CoMP set), the higher the ranking priority of the CoMP ue; and for two CoMP UEs with the same set size, sorting according to the IDs of the cells in the CoMP cell set, wherein if the minimum value of the cell ID in the CoMP cell set of one CoMP UE is smaller than the minimum value of the cell ID in the CoMP cell set of the other CoMP UE, the sorting priority of the latter is higher than that of the former.

In another preferred embodiment of cell sub-cluster division, step 21 may also be omitted, that is, the CoMP UE set determined in step 10 does not need to be sorted, or randomly sorted, and the processing manner of the subsequent flow in fig. 2 remains unchanged.

In order to more clearly illustrate the above-mentioned dividing procedure of the cell sub-cluster, a specific example is described below.

Suppose that there are 9 cells and 7 UEs in the system, and the information of each UE and its CoMP cell set is:

UE1{c1，c2，c3}、UE2{c1，c3，c4}、UE3{c5，c6}、UE4{c7，c8}、UE5{c6，c7}、UE6{c8}、UE7{c9}

where ci denotes cell i.

The information of the cell sub-cluster is represented by C ({ UE }, { C }, n), the number of sub-clusters is represented by CN, { UE } represents the UE set in the cell sub-cluster, and { C } represents the cell set in the cell sub-cluster, n represents the current several cell sub-clusters, and n =1 to CN. Initially, C ({ UE }, { C }, n) is null, CN = 0.

After the sorting in step 21, the UE set U after the sorting of each UE is represented as follows:

U=UE1{c1，c2，c3}、UE2{c1，c3，c4}、UE3{c5，c6}、UE5{c6，c7}、UE4{c7，c8}、UE6{c8}、UE7{c9}

through the steps 22-29, the following cell sub-clusters are obtained through division:

C({UE1，UE2}，{c1，c2，c3，c4}，1)

C({UE3，UE4，UE5，UE6}，{c5，c6，c7，c8}，2)

C({UE7}，{c9}，3)

that is, 9 cells and 7 UEs are divided into 3 sub-clusters, CN = 3.

In step 20, after the cell sub-cluster division is performed according to the CoMP cell set of the CoMP UE, preferably, a function of cell sub-cluster adjustment may be further introduced. The basic principle for adjusting the cell sub-cluster is as follows: if the divided cell sub-clusters do not achieve the purpose of decomposing a larger cell cluster into smaller cell clusters, decomposing the larger cell sub-cluster again to reduce the scale of the small cell sub-cluster and further reduce the complexity and time delay of centralized scheduling; and if the number of the divided cell sub-clusters is too large, combining the smaller cell sub-clusters. The above processing operations of cell sub-cluster decomposition and combination can be used separately or in combination.

Based on the above considerations, accordingly, between step 20 and step 30, the following respective steps may be performed according to one or more of the following:

case 1: if the number of cells in a cell set of a certain cell sub-cluster in the divided cell sub-clusters is greater than a set first threshold, decomposing the cell sub-cluster;

case 2: if the number of cells in a cell set of some cell sub-clusters in the divided cell sub-clusters is smaller than a set second threshold value, merging the cell sub-clusters;

case 3: and if the number of the divided cell sub-clusters is larger than a set third threshold, selecting two or more cell sub-clusters from the divided cell sub-clusters according to the sequence from small to large of the number of the cells in the cell set, and combining the selected cell sub-clusters.

Preferably, the value of the first threshold is set from the following aspects:

on the one hand, the number of cells within the system is unknown, depending on the scenario of CoMP application(ii) a On the other hand, the number of the cell sub-clusters obtained by decomposition determines the number of scheduling processes which are required to be introduced and executed in parallel, the value is not suitable when the value is too large or too small, if the value is too large, the granularity of the cell sub-cluster decomposition is too small, and as long as the CoMP cell set of the CoMP UE is changed, the cell re-clustering can be frequently triggered; if too small, the intended purpose of resolving the internal complexity of centralized scheduling and reducing scheduling latency may not be achieved. Therefore, in order to make a compromise between the two aspects described above, embodiments of the present invention are preferably made of O&The M (operation and maintenance) system configures the size of the expected cell sub-cluster size. Assuming that the maximum value of the number of cells in the cell set of the expected cell sub-cluster is set as M (i.e. the first threshold is set as M), the value of M may be determined according to the CoMP application scenario, preferably, M is at least not greater thanN is the number of cells in the system. Accordingly, the expected number of cell sub-clusters may beThe left side and the right side are provided with, wherein,indicating rounding up. The maximum value of the cell sub-cluster number also depends on the number of parallel MAC (Media Access Control ) scheduling sub-processes supportable by software and hardware of the system, and the cell sub-cluster number only needs to be less than or equal to the maximum number of sub-processes supportable by the software and hardware of the system.

Preferably, the value of the second threshold is set according to the number of UEs or the number of cells in the system. For example, the larger the number of UEs or the larger the number of cells, the larger the value of the second threshold.

Preferably, the value of the third threshold is set according to the number of UEs or the number of cells in the system. For example, the larger the number of UEs or the larger the number of cells, the larger the value of the third threshold. The size of the third threshold is also limited by the number of parallel MAC scheduling sub-processes that can be supported by the system hardware and software.

For the decomposition of the cell sub-cluster, since the CoMP cell sets of the CoMP UEs are intersected in the cell sub-cluster that needs further decomposition, the cell sub-cluster cannot be further divided according to the principle that the cell sets are not intersected. In this case, it is conceivable to disconnect the cell sub-cluster from a certain cell or cells according to other principles. The embodiment of the invention preferably provides the following two methods (method one and method two) to realize the decomposition of the cell sub-cluster.

The method comprises the following steps: for each cell sub-cluster to be decomposed, the following steps are performed:

selecting K nonadjacent cells (K is a positive integer) from the cell set of the cell sub-cluster, and dividing the cell set of the cell sub-cluster into K +1 subsets by using the nonadjacent K cells as disconnection points; and then splitting the cell sub-cluster into corresponding K +1 cell sub-clusters according to the K +1 subsets.

Preferably, when K non-adjacent cells are selected as the disconnection point, it should be ensured that the number of cells in each subset is smaller than the first threshold in K +1 subsets obtained by dividing with the disconnection point.

Preferably, when K cells that are not adjacent are selected as disconnection points, the number of cells in the K +1 subsets obtained by division can be guaranteed as average as possible. Taking selecting a cell as a breakpoint as an example, a cell with a middle position in the cell set may be selected as a disconnection point, for example, the cells in the cell set of the to-be-decomposed cell sub-cluster are sorted according to the order from small to large of the cell IDs, and the nth/2 th cell in the sorted cell set is used as a disconnection point (N is the number of cells in the cell set of the to-be-decomposed cell sub-cluster).

The second method comprises the following steps: for each cell sub-cluster to be decomposed, the following steps are performed:

and backing back the CoMP cell set of one or more CoMP UEs in the cell sub-cluster, thereby destroying the intersection relation of the CoMP cell set among the UEs of the current cell sub-cluster by reducing the CoMP cell set of the CoMP UEs participating in the cell sub-cluster division, and then dividing the cell sub-cluster according to the CoMP cell set of each UE after the backing-back processing so as to realize the decomposition operation of the cell sub-cluster. The operation of returning the CoMP cell set and dividing the cell sub-clusters according to the returned CoMP cell set can be executed for multiple times until the scale of the finally divided cell sub-clusters meets the specified requirements.

The returning of the CoMP cell set of the CoMP UE refers to: the cell cooperation relationship is released for one or more cells within the CoMP cell set of the CoMP UE, i.e., one or more cells are deleted from the CoMP cell set of the CoMP UE.

It is considered that whichever UE the CoMP cell set fallback occurs affects the performance of the UE, thereby affecting the overall system performance. To minimize this loss, the following preferred method can be preferably implemented when selecting a UE performing CoMP cell set fallback:

in a preferred implementation, the terminals to be selected are sorted in the order of channel quality from high to low, one or more terminals are selected in the order of sorting from front to back, and preferably the terminal with the highest channel quality is selected. The channel quality may be characterized by RSRP (Reference Signal Receiving Power) or other parameters.

The preferred method takes the priority problem of the UE into full consideration. In general, a higher RSRP value indicates that the UE is closer to the cell center, and a lower RSRP value indicates that the UE is closer to the cell edge. The CoMP transmission performance of the UE is affected by performing CoMP cell set fallback processing on the UE, and the degree of the impact on the central UE is much smaller than that on the edge UE, so that the loss of the UE can be reduced to the greatest extent by the above method, and the overall performance of the system is considered.

In another preferred implementation manner, the terminals to be selected are sorted according to the order from the low scheduling priority to the high scheduling priority, one or more terminals are selected according to the sorting order from the front to the back, and preferably, the terminal with the lowest scheduling priority is selected. For example, scheduling priorities of UEs may be sorted based on a proportional fairness principle, and CoMP cell set backoff may be preferentially performed on a UE with the lowest scheduling priority.

In another preferred implementation manner, the terminals to be selected are sorted in the order of the buffer data amount from small to small, one or more terminals are selected in the order of sorting from front to back, and preferably, the terminal with the smallest buffer data amount is selected.

Preferably, considering that the CoMP cell set of a single UE may include more than 2 cells, when performing CoMP cell set fallback on a single UE, the serving cell of the UE does not participate in the fallback all the time, that is, after the UE performs CoMP cell set fallback, the fallback CoMP cell set at least includes the serving cell, so that the performance of the UE can be guaranteed to the maximum. Based on this principle, a preferred implementation manner for performing CoMP cell set backoff may be: for the cooperative neighbor cells except the serving cell, only one neighbor cell is reduced each time, and which neighbor cell is reduced can be considered based on factors such as cell ID and channel quality of each cell. For example, each time a cell with the largest cell ID value is deleted, or each time a cell with the worst channel quality is deleted; or deleting all the adjacent cells except the serving cell, and only including the serving cell in the CoMP cell set after the fallback. Of the two preferred implementations described above, the latter is more aggressive than the former, and embodiments of the present invention preferably use the former.

Comparing the first method and the second method for realizing the cell sub-cluster decomposition, it can be seen that the first method can achieve the expected effect to the maximum extent, but the overall performance of the system cannot be guaranteed because the influence on the UE is not considered; the second method considers the transmission performance index of the UE, and compared with the first method, the first method increases a certain amount of calculation or complexity, but is more flexible, and can reduce the influence on the performance of the UE and the system as much as possible. The embodiment of the invention preferably adopts the second method to realize the decomposition of the cell sub-cluster.

Fig. 3 shows a preferred flow of cell sub-cluster decomposition by using the second method, and as shown in the figure, the flow is described by taking a cell sub-cluster to be decomposed currently as a cell sub-cluster 1, and the flow may include the following steps 31 to 37:

step 31, selecting at least one UE from the terminal set of the cell sub-cluster 1, and then proceeding to step 32. The selection method of the UE is the same as that described above, and is not repeated here.

Step 32, updating the CoMP cell set of the currently selected UE to release the cooperation relationship of at least one cooperation cell in the CoMP cell set, and then proceeding to step 33.

And step 33, dividing the cell sub-cluster according to the current CoMP cell set of the terminal in the cell sub-cluster 1, and then switching to step 34. The method for dividing the cell sub-cluster can be the same as that described above, and is not repeated here.

Step 34, judging whether the cell sub-clusters obtained by current division have cell sub-clusters meeting the following conditions: the number of cells in the cell set of the cell sub-cluster is greater than a set threshold (e.g., the first threshold); if yes, go to step 35, otherwise, end the process.

Step 35, judging whether the current cooperation cell set of the terminal selected in the circulation process also comprises cooperation cells, if so, turning to step 36; otherwise, go to step 37.

And step 36, updating the current cooperation cell set of the terminal selected in the circulation process to release the cooperation relationship of at least one cooperation cell in the cooperation cell set, and then turning to step 33.

Step 37, selecting at least one UE from the unselected terminals in the terminal set of the cell sub-cluster 1, and then proceeding to step 32.

In order to more clearly illustrate the above decomposition process of the cell sub-cluster, a specific example is described below.

Suppose that there are 9 cells and 7 UEs in the system, and the information of each UE and its CoMP set is:

UE1{c1，c2，c3}、UE2{c1，c3，c4}、UE3{c4，c5，c6}、UE4{c7，c8}、UE5{c6，c7}、UE6{c8}、UE7{c9}

where ci denotes cell i. Assuming that the expected sub-cluster size of the O & M configuration is M =4, the expected number of sub-clusters after cell clustering is 3.

According to the sub-cluster division principle, the cells and the UE in the system are divided into the following 2 cell sub-clusters:

C({UE1，UE2，UE3，UE4，UE5，UE6}，{c1，c2，c3，c4，c5，c6，c7，c8}，1)

C({UE7}，{c9}，2)

it can be seen that, although the cells and UEs in the system are divided into 2 cell sub-clusters through cell sub-cluster division, the number of cells and the number of UEs in cell sub-cluster 1 (i.e. the cell sub-cluster with CN = 1) are both as much as the number of cells and the number of UEs in the system before division, and the purpose of decomposing a larger cell cluster into smaller cell clusters is not achieved. To avoid this, it is necessary to consider further decomposition of the cell sub-cluster 1 into a plurality of sub-clusters. The decomposition steps of the cell sub-cluster are as follows:

firstly, the UEs 1-6 in the cell sub-cluster 1 are sorted: the ranking criteria is that the UEs with lower RSRP (representing closer to the cell edge) have higher priority and the UEs with higher RSRP (representing closer to the cell center) have lower priority, according to the RSRP (which may also be used as channel quality information) of the UEs and their serving cells. Assume that the ordered UE ordered queue is:

UE1{c1，c2，c3}、UE2{c1，c3，c4}、UE4{c7，c8}、UE6{c8}、UE3{c4，c5，c6}、UE5{c6，c7}

then, according to the ordered UE queues after sequencing, selecting UE to execute CoMP cell set rollback according to the priority, and executing sub-cluster decomposition by the rolled-back CoMP cell set:

first, consider a UE5 to roll back a CoMP cell set, assuming that a serving cell of the UE5 is c6 and a cooperating neighbor cell is c7, the CoMP cell set of the UE5 is rolled back to UE5{ c6}, and the corresponding UE ordered queues are:

UE1{c1，c2，c3}、UE2{c1，c3，c4}、UE4{c7，c8}、UE6{c8}、UE3{c4，c5，c6}、UE5{c6}

by the cell sub-cluster division, the following cell sub-clusters can be obtained by division:

C({UE1，UE2，UE3，UE5}，{c1，c2，c3，c4，c5，c6}，1)

C({UE4，UE6}，{c7，c8}，2)

C({UE7}，{c9}，3)

since the newly generated cell sub-cluster 1 further includes 6 cells, and the complexity is still higher compared with the total number of cells in the system, it may further consider performing CoMP cell set fallback on the UE3, since there are two cooperative neighboring cells (assumed to be c5 and c6) in addition to the serving cell (assumed to be c4) in the CoMP cell set of the UE3, in order to ensure that the performance loss of the UE is small, when the CoMP cell set of the UE3 is backed, it is preferred to consider backing back one cooperative neighboring cell with relatively poor channel quality, and assuming that c6 is backed first, the corresponding UE ordered queue is:

UE1{c1，c2，c3}、UE2{c1，c3，c4}、UE4{c7，c8}、UE6{c8}、UE3{c4，c5}、UE5{c6}

the following cell sub-clusters can be obtained by dividing the cell sub-clusters:

C({UE1，UE2，UE3}，{c1，c2，c3，c4，c5}，1)

C({UE5}，{c6}，1)

C({UE4，UE6}，{c7，c8}，2)

C({UE7}，{c9}，3)

at this time, the number of the cell sub-clusters and the size of the cell sub-clusters basically meet the expected requirements, and therefore, further cell sub-cluster decomposition is not needed.

As mentioned above, the division of cell sub-clusters may generate a situation that a cell sub-cluster with a large sub-cluster is generated, or may generate a situation that too many cell sub-clusters are generated in the system and the scale of some cell sub-clusters is too small, and the most extreme phenomenon is that there are many cell sub-clusters including only one or two cells. At this time, it is necessary to consider merging cell sub-clusters, that is, merging smaller-scale cell sub-clusters into relatively larger-scale cell sub-clusters, so as to reduce the number of cell sub-clusters of the entire system, and balance the number of cells and the number of UEs included in each cell sub-cluster.

Since cell sub-cluster combining is relatively simple, the operation is described below in only one embodiment.

Suppose that there are 9 cells and 7 UEs in the system, and the information of each UE and its CoMP cell set is:

UE1{c1，c2}、UE2{c1，c3}、UE3{c4}、UE4{c5}、UE5{c6}、UE6{c7}、UE7{c8，c9}

after the cell sub-cluster division, the system can be decomposed into the following cell sub-clusters:

C({UE1，UE2}，{c1，c2，c3}，1)

C({UE3}，{c4}，2)

C({UE4}，{c5}，3)

C({UE5}，{c6}，4)

C({UE6}，{c7}，5)

C({UE7}，{c8，c9}，6)

it can be seen that the above process decomposes the system into 6 sub-clusters, which are much larger than the expected number of sub-clusters, where there are some sub-clusters containing only 1 cell, and some smaller size sub-clusters can be considered to be merged. The principle of cell cluster merging is as follows: the combined cell sub-clusters are appropriate in size, and the number of the UE is balanced. After the cell sub-clusters are merged, the number of the finally divided cell sub-clusters of the system can be determined to be 3, and the information of each sub-cluster is as follows:

C({UE1，UE2}，{c1，c2，c3}，1)

C({UE3，UE4，UE5}，{c4，c5，c6}，2)

C({UE6，UE7}，{c7，c8，c9}，3)

at this time, it can be seen that the number of cell sub-clusters finally determined by the system is 3, each cell sub-cluster comprises 3 cells, and 2-3 UEs meet the expected purpose.

It should be noted that, the foregoing embodiments are relatively simple, the number of cells in the system is not large, and especially the number of UEs is not large, and in an actual system, the number of UEs is much larger, at this time, the cell sub-cluster division method provided by the embodiments of the present invention is adopted to divide the UEs and the cells in the system into different cell sub-clusters, and each cell sub-cluster is independently scheduled, so that by resolving the complexity of centralized scheduling, the execution efficiency of the whole centralized scheduling system can be greatly improved, and the overall scheduling delay of the system is reduced. The smaller the number of users served in a single cell sub-cluster, the smaller the centralized scheduling delay.

In summary, the scheme provided by the embodiment of the present invention fully considers the CoMP cell set condition of the UE, and determines the cell sub-cluster to which the UE belongs according to whether the CoMP cell sets of each UE have an intersection or not when the centralized scheduling system is large and the number of service users is large. Under the condition that the result of cell sub-cluster division basically meets the expected requirement, the cell sub-cluster adjustment function is not needed, and the performance of the clustered UE can be ensured to have no loss at this moment, so that the purposes of decomposing the internal computation complexity of centralized scheduling and reducing the scheduling delay of the system can be achieved on the premise of not causing any loss to the system performance. The method can further decompose the cell sub-cluster with larger scale under the condition that the division result of the cell sub-cluster is different from the expected requirement, because a part of UE backs a CoMP cell set at the moment, the performance of the part of UE is lost, but the embodiment of the invention fully considers the problem and sorts the UE according to the priority, so that the UE for executing the CoMP cell set back is the UE closest to the center of the cell as much as possible, and in the set back of the same UE, the priority back of a cell with the best channel quality is also considered, thereby reducing the loss degree of the UE and the system performance to the maximum extent. For cell sub-cluster combining, no loss is caused to the UE and system performance.

Based on the same technical concept, the embodiment of the invention also provides a transmission scheduling device, which can be applied to the embodiment.

Fig. 4 is a schematic structural diagram of a transmission scheduling apparatus according to an embodiment of the present invention.

A determining unit 41, configured to determine a terminal to be scheduled and a cooperative cell set of the terminal to be scheduled;

a sub-cluster dividing unit 42, configured to divide a cell sub-cluster according to the cooperative cell set of the terminal to be scheduled; dividing a terminal to be scheduled with an intersection in a cooperative cell set and the cooperative cell set of the terminal to be scheduled with the intersection in the cooperative cell set into the same cell sub-cluster, wherein each cell sub-cluster comprises a terminal set and a cell set, and the cell sets in different cell sub-clusters are not intersected;

and the scheduling unit 43 is configured to perform transmission scheduling on the terminal to be scheduled according to the divided cell sub-clusters.

Further, the sub-cluster dividing unit 42 further performs the following steps after the cell sub-cluster is obtained by dividing:

if the cell sub-clusters meeting the first condition exist, decomposing the cell sub-clusters meeting the first condition, wherein the first condition is that the number of cells in a cell set of the cell sub-clusters is greater than a set first threshold value; or if at least two cell sub-clusters meeting a second condition exist, merging the cell sub-clusters meeting the second condition, wherein the second condition is that the number of cells in a cell set of the cell sub-clusters is smaller than a set second threshold; or, if the number of the divided cell sub-clusters is greater than the set third threshold, selecting at least two cell sub-clusters from the divided cell sub-clusters according to the order from small to large of the number of the cells in the cell set, and merging the at least two cell sub-clusters.

Specifically, the sub-cluster dividing unit 42 performs cell sub-cluster decomposition by performing the following procedure: selecting K nonadjacent cells from a cell set of a cell sub-cluster meeting a first condition, wherein K is a positive integer, the nonadjacent K cells divide the cell set of the cell sub-cluster meeting the first condition into K +1 subsets, and the number of the cells in each subset of the K +1 subsets is smaller than a first threshold value; and splitting the cell sub-cluster meeting the first condition into corresponding K +1 cell sub-clusters according to the K +1 subsets.

Specifically, the sub-cluster dividing unit 42 may also perform cell sub-cluster decomposition by performing the following processes:

step a, selecting at least one terminal from a terminal set of a cell sub-cluster meeting a first condition, and then switching to step b;

step b, updating the cooperation cell set of the currently selected terminal to release the cooperation relationship of at least one cooperation cell in the cooperation cell set, and then turning to step c;

step c, dividing the cell sub-cluster according to the current cooperation cell set of the terminal in the cell sub-cluster meeting the first condition, and then switching to step d; dividing a terminal to be scheduled with an intersection in a cooperative cell set and the cooperative cell set of the terminal to be scheduled with the intersection in the cooperative cell set into the same cell sub-cluster, wherein each cell sub-cluster comprises a terminal set and a cell set, and the cell sets in different cell sub-clusters are not intersected;

d, judging whether the cell sub-clusters meeting the first condition exist in the currently divided cell sub-clusters, if so, turning to the step e, otherwise, ending the decomposition process of the cell sub-clusters;

step e, judging whether the current cooperation cell set of the terminal selected in the circulation process also comprises cooperation cells, if so, turning to step f; otherwise, turning to the step g;

step f, updating the current cooperation cell set of the terminal selected in the circulation process to remove the cooperation relation of at least one cooperation cell in the cooperation cell set, and then turning to the step c;

and g, selecting at least one terminal from the unselected terminals in the terminal set of the cell sub-cluster meeting the first condition, and then turning to the step b.

The sub-cluster dividing unit 42 may select at least one terminal from the terminals to be selected according to the order of the channel quality from high to low; or selecting at least one terminal from the terminals to be selected according to the sequence of the scheduling priority from low to high; or selecting at least one terminal from the terminals to be selected according to the sequence of the buffer data size from small to large.

Specifically, the sub-cluster dividing unit 42 releases the cooperation relationship of the cooperative cells in the cooperative cell set by: one or all cooperating cells are deleted from the set of cooperating cells.

Specifically, the sub-cluster dividing unit 42 performs cell sub-cluster division by performing the following procedure:

sequentially traversing each terminal in the terminals to be scheduled, and executing the following steps on the currently traversed terminal:

if the cell sub-clusters are not obtained through division, the cell sub-clusters are created, the currently traversed terminals are added into a terminal set of the currently created cell sub-clusters, and a cooperation cell set of the currently traversed terminals is added into a cell set of the currently created cell sub-clusters;

if the cell sub-clusters are obtained by dividing currently, respectively comparing the currently traversed cooperative cell set of the terminal with the cell sets in each of the divided cell sub-clusters, and executing one of the following steps according to the comparison result:

if the intersection exists between the currently traversed terminal cooperation cell set and one and only cell sub-cluster cell set, adding the currently traversed terminal to the only cell sub-cluster terminal set, and adding the non-overlapping cell in the currently traversed terminal cooperation cell set and the only cell sub-cluster cell set to the only cell sub-cluster cell set;

if the intersection exists between the currently traversed terminal cooperation cell set and the divided cell sets of the cell sub-clusters, combining the cell sub-clusters, adding the currently traversed terminal into the combined terminal set of the cell sub-clusters, and adding the non-overlapping cell in the currently traversed terminal cooperation cell set and the combined cell set into the combined cell set;

and if the currently traversed terminal cooperation cell set is not intersected with the divided cell set of any cell sub-cluster, creating the cell sub-cluster, adding the currently traversed terminal to the currently created terminal set of the cell sub-cluster, and adding the currently traversed terminal cooperation cell set to the currently created cell set of the cell sub-cluster.

The set of cooperating cells involved in the apparatus is one of the following sets: the method comprises the steps of a CoMP measurement set of a terminal, a CoMP transmission set of the terminal and an interference coordination cell set of the terminal.

It can be seen from the above description that, by using the method and apparatus provided in the embodiments of the present invention, the overall performance of the system can be considered to the greatest extent, and the performance of a single UE can be considered to be not lost or to be lost to a small extent.

The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, implement the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the invention.

It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.

Claims (14)

1. A method for scheduling transmissions, comprising:

determining a terminal to be scheduled and a cooperative cell set of the terminal to be scheduled;

dividing cell sub-clusters according to the cooperation cell set of the terminal to be scheduled; dividing a terminal to be scheduled with an intersection in a cooperative cell set and the cooperative cell set of the terminal to be scheduled with the intersection in the cooperative cell set into the same cell sub-cluster, wherein each cell sub-cluster comprises a terminal set and a cell set, and the cell sets in different cell sub-clusters are not intersected;

performing transmission scheduling on the terminal to be scheduled according to the divided cell sub-clusters;

after the cell sub-cluster is obtained through division, the method further comprises the following steps:

if the cell sub-clusters meeting the first condition exist, decomposing the cell sub-clusters meeting the first condition, wherein the first condition is that the number of cells in a cell set of the cell sub-clusters is greater than a set first threshold value; or,

if at least two cell sub-clusters meeting a second condition exist, merging the cell sub-clusters meeting the second condition, wherein the second condition is that the number of cells in a cell set of the cell sub-clusters is smaller than a set second threshold value; or,

and if the number of the divided cell sub-clusters is larger than a set third threshold, selecting at least two cell sub-clusters from the divided cell sub-clusters according to the sequence from small to large of the number of the cells in the cell set, and combining the at least two cell sub-clusters.

2. The method of claim 1, wherein decomposing the cell sub-clusters that satisfy the first condition comprises:

selecting K nonadjacent cells from a cell set of a cell sub-cluster meeting a first condition, wherein K is a positive integer, the nonadjacent K cells divide the cell set of the cell sub-cluster meeting the first condition into K +1 subsets, and the number of the cells in each subset of the K +1 subsets is smaller than a first threshold value;

and splitting the cell sub-cluster meeting the first condition into corresponding K +1 cell sub-clusters according to the K +1 subsets.

3. The method of claim 1, wherein decomposing the cell sub-clusters that satisfy the first condition comprises:

step a, selecting at least one terminal from a terminal set of a cell sub-cluster meeting a first condition, and then switching to step b;

step b, updating the cooperation cell set of the currently selected terminal to release the cooperation relationship of at least one cooperation cell in the cooperation cell set, and then turning to step c;

step c, dividing the cell sub-cluster according to the current cooperation cell set of the terminal in the cell sub-cluster meeting the first condition, and then switching to step d; dividing a terminal to be scheduled with an intersection in a cooperative cell set and the cooperative cell set of the terminal to be scheduled with the intersection in the cooperative cell set into the same cell sub-cluster, wherein each cell sub-cluster comprises a terminal set and a cell set, and the cell sets in different cell sub-clusters are not intersected;

d, judging whether the cell sub-clusters meeting the first condition exist in the currently divided cell sub-clusters, if so, turning to the step e, otherwise, ending the decomposition process of the cell sub-clusters;

step e, judging whether the current cooperation cell set of the terminal selected in the circulation process also comprises cooperation cells, if so, turning to step f; otherwise, turning to the step g;

step f, updating the current cooperation cell set of the terminal selected in the circulation process to remove the cooperation relation of at least one cooperation cell in the cooperation cell set, and then turning to the step c;

and g, selecting at least one terminal from the unselected terminals in the terminal set of the cell sub-cluster meeting the first condition, and then turning to the step b.

4. The method of claim 3, wherein the selecting at least one terminal comprises:

selecting at least one terminal from the terminals to be selected according to the sequence of the channel quality from high to low; or,

selecting at least one terminal from the terminals to be selected according to the sequence of the scheduling priority from low to high; or,

and selecting at least one terminal from the terminals to be selected according to the sequence of the buffer data size from small to large.

5. The method of claim 3, wherein the releasing the cooperation relationship of at least one cooperation cell in the set of cooperation cells comprises: one or all cooperating cells are deleted from the set of cooperating cells.

6. The method of any one of claims 1-5, wherein the partitioning the cell sub-clusters comprises:

sequentially traversing each terminal in the terminals to be scheduled, and executing the following steps on the currently traversed terminal:

if the cell sub-clusters are not obtained through division, the cell sub-clusters are created, the currently traversed terminals are added into a terminal set of the currently created cell sub-clusters, and a cooperation cell set of the currently traversed terminals is added into a cell set of the currently created cell sub-clusters;

if the cell sub-clusters are obtained by dividing currently, respectively comparing the currently traversed cooperative cell set of the terminal with the cell sets in each of the divided cell sub-clusters, and executing one of the following steps according to the comparison result:

if the intersection exists between the currently traversed terminal cooperation cell set and one and only cell sub-cluster cell set, adding the currently traversed terminal to the only cell sub-cluster terminal set, and adding the non-overlapping cell in the currently traversed terminal cooperation cell set and the only cell sub-cluster cell set to the only cell sub-cluster cell set;

if the intersection exists between the currently traversed terminal cooperation cell set and the divided cell sets of the cell sub-clusters, combining the cell sub-clusters, adding the currently traversed terminal into the combined terminal set of the cell sub-clusters, and adding the non-overlapping cell in the currently traversed terminal cooperation cell set and the combined cell set into the combined cell set;

and if the currently traversed terminal cooperation cell set is not intersected with the divided cell set of any cell sub-cluster, creating the cell sub-cluster, adding the currently traversed terminal to the currently created terminal set of the cell sub-cluster, and adding the currently traversed terminal cooperation cell set to the currently created cell set of the cell sub-cluster.

7. The method of any one of claims 1-5, wherein the set of cooperating cells is one of the following sets:

a CoMP measurement set of the terminal;

a CoMP transmission set of the terminal;

a set of interference coordination cells for a terminal.

8. A transmission scheduling apparatus, comprising:

the device comprises a determining unit, a scheduling unit and a scheduling unit, wherein the determining unit is used for determining a terminal to be scheduled and a cooperation cell set of the terminal to be scheduled;

a sub-cluster dividing unit, configured to divide cell sub-clusters according to the cooperation cell set of the terminal to be scheduled; dividing a terminal to be scheduled with an intersection in a cooperative cell set and the cooperative cell set of the terminal to be scheduled with the intersection in the cooperative cell set into the same cell sub-cluster, wherein each cell sub-cluster comprises a terminal set and a cell set, and the cell sets in different cell sub-clusters are not intersected; if the cell sub-clusters meeting the first condition exist, decomposing the cell sub-clusters meeting the first condition, wherein the first condition is that the number of cells in a cell set of the cell sub-clusters is greater than a set first threshold value; or if at least two cell sub-clusters meeting a second condition exist, merging the cell sub-clusters meeting the second condition, wherein the second condition is that the number of cells in a cell set of the cell sub-clusters is smaller than a set second threshold; or if the number of the divided cell sub-clusters is greater than a set third threshold, selecting at least two cell sub-clusters from the divided cell sub-clusters according to the sequence from small to large of the number of the cells in the cell set, and merging the at least two cell sub-clusters;

and the scheduling unit is used for carrying out transmission scheduling on the terminal to be scheduled according to the divided cell sub-clusters.

9. The apparatus of claim 8, wherein the sub-cluster dividing unit is specifically configured to:

selecting K nonadjacent cells from a cell set of a cell sub-cluster meeting a first condition, wherein K is a positive integer, the nonadjacent K cells divide the cell set of the cell sub-cluster meeting the first condition into K +1 subsets, and the number of the cells in each subset of the K +1 subsets is smaller than a first threshold value;

and splitting the cell sub-cluster meeting the first condition into corresponding K +1 cell sub-clusters according to the K +1 subsets.

10. The apparatus of claim 8, wherein the sub-cluster dividing unit is specifically configured to perform the following steps:

step a, selecting at least one terminal from a terminal set of a cell sub-cluster meeting a first condition, and then switching to step b;

step b, updating the cooperation cell set of the currently selected terminal to release the cooperation relationship of at least one cooperation cell in the cooperation cell set, and then turning to step c;

step c, dividing the cell sub-cluster according to the current cooperation cell set of the terminal in the cell sub-cluster meeting the first condition, and then switching to step d; dividing a terminal to be scheduled with an intersection in a cooperative cell set and the cooperative cell set of the terminal to be scheduled with the intersection in the cooperative cell set into the same cell sub-cluster, wherein each cell sub-cluster comprises a terminal set and a cell set, and the cell sets in different cell sub-clusters are not intersected;

d, judging whether the cell sub-clusters meeting the first condition exist in the currently divided cell sub-clusters, if so, turning to the step e, otherwise, ending the decomposition process of the cell sub-clusters;

step e, judging whether the current cooperation cell set of the terminal selected in the circulation process also comprises cooperation cells, if so, turning to step f; otherwise, turning to the step g;

step f, updating the current cooperation cell set of the terminal selected in the circulation process to remove the cooperation relation of at least one cooperation cell in the cooperation cell set, and then turning to the step c;

and g, selecting at least one terminal from the unselected terminals in the terminal set of the cell sub-cluster meeting the first condition, and then turning to the step b.

11. The apparatus of claim 10, wherein the sub-cluster dividing unit is specifically configured to:

selecting at least one terminal from the terminals to be selected according to the sequence of the channel quality from high to low; or,

selecting at least one terminal from the terminals to be selected according to the sequence of the scheduling priority from low to high; or

And selecting at least one terminal from the terminals to be selected according to the sequence of the buffer data size from small to large.

12. The apparatus of claim 10, wherein the sub-cluster dividing unit is specifically configured to: one or all cooperating cells are deleted from the set of cooperating cells.

13. The apparatus according to any of claims 8-12, wherein the sub-cluster dividing unit is specifically configured to:

sequentially traversing each terminal in the terminals to be scheduled, and executing the following steps on the currently traversed terminal:

if the cell sub-clusters are not obtained through division, the cell sub-clusters are created, the currently traversed terminals are added into a terminal set of the currently created cell sub-clusters, and a cooperation cell set of the currently traversed terminals is added into a cell set of the currently created cell sub-clusters;

if the cell sub-clusters are obtained by dividing currently, respectively comparing the currently traversed cooperative cell set of the terminal with the cell sets in each of the divided cell sub-clusters, and executing one of the following steps according to the comparison result:

if the intersection exists between the currently traversed terminal cooperation cell set and one and only cell sub-cluster cell set, adding the currently traversed terminal to the only cell sub-cluster terminal set, and adding the non-overlapping cell in the currently traversed terminal cooperation cell set and the only cell sub-cluster cell set to the only cell sub-cluster cell set;

if the intersection exists between the currently traversed terminal cooperation cell set and the divided cell sets of the cell sub-clusters, combining the cell sub-clusters, adding the currently traversed terminal into the combined terminal set of the cell sub-clusters, and adding the non-overlapping cell in the currently traversed terminal cooperation cell set and the combined cell set into the combined cell set;

and if the currently traversed terminal cooperation cell set is not intersected with the divided cell set of any cell sub-cluster, creating the cell sub-cluster, adding the currently traversed terminal to the currently created terminal set of the cell sub-cluster, and adding the currently traversed terminal cooperation cell set to the currently created cell set of the cell sub-cluster.

14. The apparatus of any one of claims 8-12, wherein the set of cooperating cells is one of the following set:

a CoMP measurement set of the terminal;

a CoMP transmission set of the terminal;

a set of interference coordination cells for a terminal.