Resource allocation method, device, equipment and storage medium for intelligent space-division cell cluster

Abstract

Embodiments of the present invention provide a resource allocation method, apparatus, device, and computer-readable storage medium for an intelligent space-division cell cluster. For each divided cell in a space-division cell cluster, users belonging to each cell combination of the divided cell are first determined; then, an estimated total resource block requirement of the space-division cell cluster is obtained based on the estimated resource block requirements of users in each cell combination of each divided cell; and then, based on the number of available resource blocks in each divided cell and the estimated total resource block requirement of the space-division cell cluster, resource blocks are allocated to users in each cell combination of the divided cells in the space-division cell cluster, thereby avoiding interference as much as possible, improving spectrum efficiency, and maximizing the throughput of the entire cell cluster.

Description

Technical Field

[0001] The present invention relates to the field of communications, and in particular to a resource allocation method, device, equipment and computer-readable storage medium for an intelligent space-division cell cluster. Background Art

[0002] With the continuous advancement of radio technology, a large number of radio services have emerged. However, the spectrum resources that radio services rely on are limited. Faced with the increasing demand for bandwidth, the spectrum resources between 300MHz and 3GHz mainly used by traditional commercial communications are in an extremely tight situation and can no longer meet the needs of future wireless communications.

[0003] Future wireless communications will utilize carrier frequencies higher than those used by fourth-generation (4G) communication systems, such as 28 GHz, 45 GHz, and 70 GHz. These high-frequency channels have disadvantages such as high free propagation loss, susceptibility to oxygen absorption, and significant rain attenuation, which severely impact the coverage performance of high-frequency communication systems. However, because the carrier frequencies corresponding to high-frequency communications have shorter wavelengths, they can accommodate more antenna elements per unit area. More antenna elements allow for beamforming to increase antenna gain, thereby ensuring high-frequency communication coverage. Furthermore, Massive MIMO technology can more efficiently utilize currently licensed spectrum (e.g., 300 MHz to 3 GHz). Because this technology achieves a certain degree of independence or orthogonality between multi-user channels, it can spatially separate multiple users within the same time-frequency domain resources, significantly improving spectral efficiency and enabling efficient spectrum utilization. Therefore, Massive MIMO has become a key technology for enhancing coverage and exploiting spatial degrees of freedom in high-frequency communications.

[0004] In related technologies, an effective Massive MIMO implementation method is to use multiple antennas to generate multiple beams in different directions, dividing the cell covered by a base station into multiple sub-cells (also called sub-cells or split cells). These sub-cells are called intelligent space-division cell clusters (hereinafter referred to as space-division cell clusters). Each sub-cell in the space-division cell cluster reuses the same time-frequency resources and is independently scheduled to achieve the purpose of space-division multiplexing. The maximum space-division multiplexing factor is equal to the number of sub-cells. In this Massive MIMO implementation scheme, due to the mutual interference between the sub-cells, and the different degrees of interference experienced by users in each sub-cell from other sub-cells, how to avoid interference as much as possible when allocating frequency domain resources to each user in each sub-cell, improve spectrum efficiency, and maximize the throughput of the entire cell cluster has become a technical problem that urgently needs to be solved in the intelligent space-division cell cluster scheme. Summary of the Invention

[0005] The embodiments of the present invention provide a method, apparatus, device and computer-readable storage medium for allocating resources of an intelligent space-division cell cluster, which solve the problem of how to allocate resources to users of each divided cell in the space-division cell cluster.

[0006] To solve the above technical problems, an embodiment of the present invention further provides a resource allocation method for an intelligent space-division cell cluster, comprising:

[0007] For each divided cell in the space-division cell cluster, determining users belonging to each cell combination of the divided cell; the cell combinations of the divided cells include: non-collision combinations and collision combinations, the collision combinations include various combinations of the divided cell and other divided cells in the space-division cell cluster, and the non-collision combinations include only the divided cell itself;

[0008] Obtaining the total estimated resource block requirements of the space-divided cell cluster according to the estimated resource block requirements of users in each cell combination belonging to each divided cell;

[0009] Resource blocks are allocated to users in each cell combination of the divided cells under the space-division cell cluster according to the number of available resource blocks of each divided cell and the estimated total number of resource blocks required by the space-division cell cluster.

[0010] To solve the above technical problems, an embodiment of the present invention further provides a resource allocation device for an intelligent space-division cell cluster, comprising:

[0011] A user determination module is configured to determine, for each divided cell in the space-divided cell cluster, users belonging to each cell combination of the divided cell; the cell combinations of the divided cells include: non-collision combinations and collision combinations, the collision combinations including various combinations of the divided cell and other divided cells in the space-divided cell cluster, and the non-collision combinations including only the divided cell itself;

[0012] an allocation control module, configured to obtain an estimated total resource block demand of the space-divided cell cluster based on the estimated number of resource block demands of users of each cell combination of each divided cell, and to allocate resource blocks to users within each cell combination of the divided cells under the space-divided cell cluster based on the number of available resource blocks of each divided cell and the estimated total resource block demand of the space-divided cell cluster.

[0013] To solve the above technical problems, an embodiment of the present invention further provides a communication device, including a processor, a memory, and a communication bus;

[0014] The communication bus is used to connect the processor and the memory;

[0015] The processor is configured to execute the computer program stored in the memory to implement the steps of the resource allocation method for the intelligent space division cell cluster as described above.

[0016] To solve the above technical problems, an embodiment of the present invention further provides a computer-readable storage medium, which stores one or more computer programs. The one or more computer programs can be executed by one or more processors to implement the steps of the resource allocation method for the intelligent space-division cell cluster as described above.

[0017] Beneficial effects

[0018] According to the resource allocation method, apparatus, device and computer-readable storage medium for an intelligent space-division cell cluster provided by an embodiment of the present invention, for each divided cell under the space-division cell cluster, users belonging to each cell combination of the divided cell are first determined; the cell combinations include non-collision combinations and collision combinations; then, based on the estimated number of resource block requirements of users in each cell combination of each divided cell, an estimated total resource block requirement of the space-division cell cluster is obtained; and then, based on the number of available resource blocks in each divided cell and the estimated total resource block requirement of the space-division cell cluster, resource blocks are allocated to users in each cell combination of the divided cells under the space-division cell cluster, thereby avoiding interference as much as possible, which is conducive to improving spectrum efficiency and maximizing the throughput of the entire cell cluster as much as possible.

[0019] Other features and corresponding beneficial effects of the present invention are described in the latter part of the specification, and it should be understood that at least some of the beneficial effects become obvious from the description in the specification of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] Figure 1 Schematic diagram of the resource allocation method for the intelligent space division cell cluster according to the first embodiment of the present invention;

[0021] Figure 2 This is a schematic diagram of a process for determining users belonging to each cell combination according to the first embodiment of the present invention;

[0022] Figure 3 This is a schematic diagram of the resource allocation process flow in the first embodiment of the present invention;

[0023] Figure 4 This is a schematic diagram of the resource allocation process flow of the second embodiment of the present invention;

[0024] Figure 5 This is a schematic structural diagram of a resource allocation device for an intelligent space-division cell cluster according to a third embodiment of the present invention;

[0025] Figure 6 This is a schematic diagram of a resource allocation method in application scenario 1 of embodiment 4 of the present invention;

[0026] Figure 7 This is a schematic diagram of a resource allocation method in application scenario 2 of embodiment 4 of the present invention;

[0027] Figure 8 This is a schematic diagram of the communication device structure of embodiment 5 of the present invention. DETAILED DESCRIPTION

[0028] In order to make the purpose, technical solutions and advantages of the present invention more clearly understood, the following is a further detailed description of the embodiments of the present invention through specific implementation methods in conjunction with the accompanying drawings. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention.

[0029] Example 1:

[0030] This embodiment provides a resource allocation method for an intelligent space-division cell cluster. For each divided cell in the space-division cell cluster, the user belonging to each cell combination of the divided cell is first determined; then, based on the estimated resource block requirements of the users in each cell combination of each divided cell, the estimated total resource block requirements of the space-division cell cluster are obtained; and then, based on the number of available resource blocks in each divided cell and the estimated total resource block requirements of the space-division cell cluster, resource blocks are allocated to the users in each cell combination of the divided cells in the space-division cell cluster, thereby avoiding interference as much as possible, improving spectrum efficiency, and maximizing the throughput of the entire cell cluster. For ease of understanding, this embodiment below provides an illustrative explanation of the divided cells and cell combinations in the space-division cell cluster with reference to an example.

[0031] In this example, it is assumed that the cells covered by the base station are divided into 4 cells to form a spatial cell cluster, namely Cell1, Cell2, Cell3, and Cell4. For the divided cell Cell1, its cell combinations include: (Cell1), (Cell1, Cell4), (Cell1, Cell2), (Cell1, Cell3), (Cell1, Cell2, Cell3), (Cell1, Cell2, Cell4), (Cell1, Cell3, Cell4), (Cell1, Cell2, Cell3, Cell4). Among the 8 cell combinations of the divided cell Cell1, (Cell1) is a non-collision combination that only includes the divided cell Cell1 itself (that is, it does not reuse resources with other divided cells), and the 7 cell combinations of the divided cell Cell1 and the other three divided cells all have collisions with other divided cells (that is, they reuse resources with other divided cells). In this embodiment, these cell combinations are referred to as collision combinations of the divided cell Cell1.

[0032] The cell combinations of the divided cells Cell2, Cell3, and Cell4 in the above-mentioned space-divided cell cluster are similarly deduced and will not be described in detail here. It should be understood that when dividing the cells covered by the base station to obtain divided cells, the specific division method used and the specific number of divided cells obtained can be flexibly set according to the specific application scenario, and this embodiment has no limitation on this.

[0033] For ease of understanding, the resource allocation method for the intelligent space division cell cluster provided by this embodiment is described below with reference to the accompanying drawings. Figure 1 Shown, including:

[0034] S101: For each divided cell in the space-divided cell cluster, determine users belonging to each cell combination of the divided cells.

[0035] In an example of this implementation, determining users belonging to each cell combination of the divided cell may include but is not limited to: determining users belonging to each cell combination of the divided cell according to the order of interference caused by each cell combination of the divided cell to the divided cell from small to large.

[0036] For example, continuing with the above example, for the divided cell Cell1, assuming that the interference caused to it by other Cell2, Cell3, and Cell4 in the spatial division cell cluster is Cell2, Cell3, and Cell4 in ascending order, then the interference caused to the divided cell by the cell combinations of the divided cell Cell1 is in the following order from small to large: (Cell1), (Cell1, Cell2), (Cell1, Cell3), (Cell1, Cell4), (Cell1, Cell2, Cell3), (Cell1, Cell2, Cell4), (Cell1, Cell3, Cell4), (Cell1, Cell2, Cell3, Cell4); then the users in the cell combinations within the divided cell Cell1 are determined according to the above combination order.

[0037] In an example of this embodiment, a method for determining users belonging to each cell combination of a divided cell is performed according to the order of interference caused by each cell combination of the divided cell to the divided cell from small to large. Figure 2 The following may include but are not limited to:

[0038] S201: sorting other divided cells in the space division cell cluster that interfere with the divided cell in ascending order of interference, and combining the divided cell with other divided cells that interfere with it in ascending order of interference to obtain collision combinations with ascending interference.

[0039] For example, for the divided cell Cell1, the other divided cells that interfere with it are sorted in order of interference from small to large as: Cell2, Cell3, Cell4; then the divided cell and the other divided cells that interfere with it are combined in order of interference from small to large to obtain collision combinations with interference from small to large: (Cell1, Cell2), (Cell1, Cell3), (Cell1, Cell4), (Cell1, Cell2, Cell3), (Cell1, Cell2, Cell4), (Cell1, Cell3, Cell4), (Cell1, Cell2, Cell3, Cell4).

[0040] S202: Obtain the impairment spectrum efficiencies in the collision combinations within the divided cells in sequence. When a certain impairment spectrum efficiency is greater than a preset impairment spectrum efficiency threshold, determine that the user belongs to the collision combination preceding the collision combination corresponding to the impairment spectrum efficiency. When the collision combination corresponding to the impairment spectrum efficiency is the first collision combination, determine that the user belongs to the non-collision combination of the divided cells. In this case, the user is a user that does not support collision combinations.

[0041] It should be understood that in this embodiment, the compromised spectrum efficiency thresholds set for different users or when no cell division is required can be the same; they can also be flexibly set to different values ​​based on specific needs. Furthermore, the specific value of the compromised spectrum efficiency threshold can also be set based on specific needs.

[0042] In this embodiment, in this example, the compromised spectrum efficiency is the difference between the spectrum efficiency of the user in the divided cell without interference and the spectrum efficiency in the collision combination corresponding to the divided cell. For example, for the compromised spectrum efficiency of the user in the collision combination (Cell1, Cell2) of the divided cell Cell1, the spectrum efficiency 0 of the user in the non-interference state can be calculated first, and then the spectrum efficiency 1 of the user in the collision combination (Cell1, Cell2) can be calculated. The two frequencies obtained are subtracted to obtain the compromised spectrum efficiency 01 of the user in the collision combination (Cell1, Cell2). The compromised spectrum efficiency 01 obtained is then compared with the compromised spectrum efficiency threshold. If it is greater than or equal to the compromised spectrum efficiency threshold, it is determined that the user belongs to the non-collision combination (Cell1) of the divided cell Cell1; if the compromised spectrum efficiency 01 is less than the compromised spectrum efficiency threshold, the user can be determined to belong to the non-collision combination (Cell1) of the divided cell Cell1; if the compromised spectrum efficiency 01 is less than the compromised spectrum efficiency threshold, the user can be determined to belong to the non-collision combination (Cell1) of the divided cell Cell1. Calculate the spectral efficiency 2 of the user in the collision combination (Cell1, Cell3) of Cell1, and subtract the spectral efficiency 1 from the spectral efficiency 2 to obtain the compromised spectral efficiency 12. If the compromised spectral efficiency 12 is greater than or equal to the compromised spectral efficiency threshold, determine that the user belongs to the collision combination (Cell1, Cell2) of divided cell Cell1. Otherwise, continue to calculate the spectral efficiency 3 of the user in (Cell1, Cell4) until the compromised spectral efficiency is greater than or equal to the compromised spectral efficiency threshold, or until the last collision combination (Cell1, Cell2, Cell3, Cell4) is calculated. Through the above process, the users belonging to each cell combination in each divided cell can be obtained.

[0043] S102: Obtain the total estimated resource block requirements of the space-divided cell cluster according to the estimated resource block requirements of users in each cell combination belonging to each divided cell.

[0044] In this embodiment, each user can obtain the estimated number of resource blocks required by each user. The specific method for calculating the estimated number of resource blocks required can be flexibly set, and the embodiment does not impose any limitation on the specific method for obtaining the estimated number of resource blocks required.

[0045] In this embodiment, the estimated total resource block requirements of all users in each cell combination within the divided cell can be obtained first, and then the total resource block requirements of each cell combination can be added to obtain the estimated total resource block requirements of all users in the divided cell, and then the estimated total resource block requirements of all users in each divided cell can be added to obtain the estimated total resource block requirements of the space-divided cell cluster.

[0046] S103: Allocate resource blocks to users in each cell combination of the divided cells under the space-division cell cluster according to the number of available resource blocks of each divided cell and the estimated total number of resource blocks required by the space-division cell cluster.

[0047] For example, when the total estimated resource block demand of the space-divided cell cluster is less than or equal to the minimum number of available resource blocks in each divided cell, resource blocks are allocated to each divided cell in sequence according to the ID of each divided cell, and resource blocks are allocated to users in each divided cell.

[0048] For another example, when the total estimated resource block requirement of the space-divided cell cluster is greater than the minimum number of available resource blocks in each divided cell, resource blocks are allocated to the divided cells under each cell combination in descending order of the number of combination layers of the cell combination;

[0049] The number of combination layers of a cell combination is the number of divided cells included in the cell combination. For a non-collision combination of divided cells, the number of combination layers is 1. For example, for the cell combinations that divide the cell Cell1: (Cell1), (Cell1, Cell2), (Cell1, Cell3), (Cell1, Cell4), (Cell1, Cell2, Cell3), (Cell1, Cell2, Cell4), (Cell1, Cell3, Cell4), (Cell1, Cell2, Cell3, Cell4), (Cell1, Cell2, Cell3, Cell4), the numbers of combination layers included are: 1, 2, 2, 2, 3, 3, 3, 4 respectively.

[0050] In this embodiment, for cell combinations with the same number of combination layers, a random sorting method may be used; optionally, in order to further improve spectrum efficiency, the following sorting rules may also be used for sorting:

[0051] The cell combinations are sorted in descending order according to the number of combination layers. For cell combinations with the same number of combination layers, they are sorted in descending order according to the average spectrum efficiency of the cell combination (the average frequency efficiency of each user in the cell combination can be used as the average spectrum efficiency). For cell combinations with the same number of combination layers and the same average spectrum efficiency, they are sorted in descending order according to the difference in the maximum total number of resource block requirements of each divided cell in the cell combination (the resource block requirements of each divided cell in the cell combination can be subtracted, and the largest difference is selected from the obtained differences; for non-collision combinations, the resource block requirements of the corresponding divided cell are directly used as the difference in the maximum total number of resource block requirements).

[0052] After the above sorting, resource blocks can be allocated to the divided cells under each cell combination in turn according to the order of the sorted cell combinations. For example, see Figure 3 As shown, an exemplary allocation process includes:

[0053] S301: When allocating resource blocks to a current cell combination, all cell combination supersets including the cell combination are obtained, where each cell combination in the cell combination superset includes all divided cells in the current cell combination.

[0054] For example, for the collision combination (Cell1, Cell2, Cell3, Cell4) that divides the cell Cell1, there is no superset of all cell combinations that includes this cell combination; for the collision combination (Cell1, Cell3, Cell4) that divides the cell Cell1, the superset of all cell combinations that includes this cell combination is (Cell1, Cell2, Cell3, Cell4); for the collision combination (Cell1, Cell3) that divides the cell Cell1, the superset of all cell combinations that includes this cell combination is (Cell1, Cell3, Cell4). 4), (Cell1, Cell2, Cell3, Cell4); for the non-collision combination (Cell1) that divides the cell Cell1, the superset of all cell combinations including this cell combination is (Cell1), (Cell1, Cell2), (Cell1, Cell3), (Cell1, Cell4), (Cell1, Cell2, Cell3), (Cell1, Cell2, Cell4), (Cell1, Cell3, Cell4), (Cell1, Cell2, Cell3, Cell4).

[0055] S302: Obtain the number of resource blocks required for each divided cell of the current cell combination, and the number of under-allocated resource blocks of each divided cell in each cell combination in the cell combination parent set, and add the number of resource blocks required for each divided cell and the number of under-allocated resource blocks to obtain the number of resource blocks to be allocated for each divided cell of the current cell combination.

[0056] In this embodiment, the number of under-allocated resource blocks of each divided cell in each cell combination in the cell combination parent set refers to the situation where, when allocating resources for the cell combination in the cell combination parent set, insufficient resource blocks are allocated to some divided cells in the cell combination. For example, assuming that the current cell combination is (Cell1, Cell3, Cell4), the number of resource blocks required for the divided cells Cell1, Cell3, and Cell4 in the cell combination is (k1, k3, k4), respectively; assuming that the parent set of all cell combinations in the cell combination is (Cell1, Cell2, Cell3, Cell4), the number of under-allocated resource blocks corresponding to the divided cells Cell1, Cell3, Cell3, and Cell4 in the cell combination parent set is (0, 0, 3, 0), respectively; then the number of resource blocks to be allocated for each divided cell in the cell combination (Cell1, Cell3, Cell4) is (k1, k3+3, k4). The same applies to other cell combinations and will not be repeated here.

[0057] S303: Taking the minimum number of resource blocks to be allocated in each divided cell of the current cell combination as the number of resource blocks allocated this time, and allocating resource blocks to the divided cells in the corresponding cell combination in sequence according to the order of the current cell combination and each cell combination in the cell combination parent set.

[0058] For example, continuing with the example in the above steps, the minimum number of resource blocks to be allocated (assuming it is k1, and assuming k1 is greater than or equal to 3 (of course, the value of k1 may also be less than 3)) is selected from (k1, k3+3, k4) as the number of resource blocks allocated this time. When allocating, first allocate 3 resource blocks to Cell3 in the cell combination parent set (Cell1, Cell2, Cell3, Cell4) in the cell combination (Cell1, Cell3, Cell4), and then allocate k1, k1-3, k1 resource blocks to each divided cell in the cell combination (Cell1, Cell3, Cell4). After the allocation is completed, the number of under-allocated resource blocks of the corresponding divided cells in (Cell1, Cell3, Cell4) and its corresponding cell combination parent set is updated accordingly.

[0059] Optionally, in this embodiment, after allocating resource blocks to the divided cells of each cell combination in descending order of the number of combination layers of the cell combination, the following method may be further included:

[0060] When determining that a certain divided cell is a resource surplus divided cell when there is surplus available resource blocks, at least one target collision combination is selected from the collision combinations of the resource surplus divided cell, the resource surplus divided cell is split from the selected target collision combination, and resource blocks are allocated to the divided cell according to the number of available resource blocks remaining in the resource surplus divided cell.

[0061] It should be understood that in this embodiment, the selection method for selecting at least one target collision combination from the collision combinations of the resource surplus partition cells can be flexibly set, for example, random selection can be made. In order to further improve frequency efficiency, the selection can also be performed in the following manners, but not limited to:

[0062] According to the remaining available resource blocks of the resource surplus partition cell, at least one collision combination is selected from the collision combinations of the resource surplus partition cell in descending order of the compromised spectrum efficiency of the collision combinations as the target collision combination.

[0063] It can be seen that the resource allocation method for the intelligent space-division cell cluster provided in this embodiment allocates resource blocks to users in each cell combination of the divided cells under the space-division cell cluster, which may avoid interference and is conducive to improving spectrum efficiency, thereby maximizing the throughput of the entire cell cluster as much as possible.

[0064] Example 2:

[0065] For ease of understanding, this embodiment will explain a resource allocation method for an intelligent space division cell cluster based on the above embodiment and in combination with a specific application scenario as an example.

[0066] Based on the above analysis, the resource allocation method provided in this embodiment classifies different users into different cell combinations. Resource allocation is performed based on the cell combination, with the number of combination layers (also known as the number of space layers) and spectral efficiency as the priority criteria. Furthermore, the number of combination layers can be dynamically adjusted based on the traffic volume of the base station cell.

[0067] In this embodiment, for the divided cells within the space-divided cell cluster, the following information can be obtained:

[0068] Each divided cell is a divided cell that is allowed to collide within the space-divided cell cluster;

[0069] The estimated required resources for each divided cell, i.e. the required number of resource blocks;

[0070] The average spectrum efficiency of each divided cell in the absence of interference;

[0071] Each divided cell loses an average spectrum efficiency under each collision combination.

[0072] Assuming that the cell covered by the base station is divided into N divided cells, an example method for obtaining the above information is as follows:

[0073] For all users in the cell cluster, the number of resources that each user needs to allocate is estimated, that is, the number of resource blocks required by each user is estimated.

[0074] Calculate the link spectral efficiency (link spectral efficiency, in bits / s / Hz or (bit / s) / Hz) for each user without interference from neighboring cells (that is, without interference from other allocated cells).

[0075] For each divided cell, sort the other divided cells in the space division cell cluster in the order of interference from small to large, and then obtain the cell combinations of each divided cell in the order of interference from small to large;

[0076] For each user, the compromised spectrum efficiency of the user in each corresponding cell combination is traversed, and the cell combination to which the user belongs is determined based on the calculated compromised spectrum efficiency;

[0077] The estimated number of resources corresponding to the users in a cell group is added together, the spectrum efficiency is averaged, and the average of the compromised spectrum efficiency is averaged to obtain the collision pattern of each divided cell. For example, when the value of N is 4, the collision pattern obtained is shown in the following Table 1. In Table 1: RB i,jis the estimated number of resources (i.e., the total number of resource blocks required) for the jth partition cell under the i-th cell combination, SE i,j is the spectrum efficiency value of the jth divided cell under the i-th cell combination, ΔSE i,j is the compromised spectrum efficiency value of the j-th divided cell under the i-th cell combination.

[0078] Table 1

[0079]

[0080]

[0081] Based on the above collision pattern, the resource allocation process is shown in Figure 4 Shown, including:

[0082] S401: Calculate the total estimated number of resources for each divided cell, and further calculate the total estimated number of resources for the space-divided cell cluster (ie, the total estimated resource block requirements for the space-divided cell cluster).

[0083] S402: If the total number of estimated resources of the space-divided cell cluster is less than or equal to the total number of available resources of each divided cell, then there is no resource collision among all divided cells, and the process goes to S408; otherwise, the process goes to S403.

[0084] S403: Sort the cell combinations in Table 1 in descending order according to the number of combination layers of the cell combinations. For the cell combinations with the same number of combination layers, sort them in descending order according to the average spectral efficiency of the cell combinations. For the cell combinations with the same number of combination layers and the same average spectral efficiency, sort them in descending order according to the difference in the total maximum resource block requirements of the divided cells in the cell combination of the cell group.

[0085] This step involves calculating the difference in the estimated number of resources for each partitioned cell in each collision combination.

[0086] Calculate the mean spectral efficiency of each collision combination

[0087] The cell combinations in Table 1 are sorted according to the number of cell combination layers, the average spectrum efficiency, and the difference in the number of estimated resources.

[0088] S404: When allocating resources to each cell combination, the number of resource blocks required by each divided cell in the cell combination is calculated, and the cell combination parent set containing the cell combination is found. If the divided cells in the cell combination have unallocated resource blocks in their cell combination parent set, the number of resources to be allocated for the cell combination is recorded as the sum of the number of resource blocks required in the cell combination and the number of unallocated resources of the divided cells in the cell combination in their cell combination parent set.

[0089] S405: The actual number of resources allocated to each cell combination is the minimum number of resources to be allocated for each cell in the cell combination. Resources are allocated to the cell combination according to the order of the cell combinations. If a cell combination has multiple cell combination parent sets, resources are allocated to the multiple cell combination parent sets in the order of their latest updates.

[0090] S406: Update the number of remaining unallocated resources of each divided cell in each cell combination and the number of unallocated resources of its cell combination superset, and update the actual number of allocated resources of the cell combination.

[0091] In each cell combination, the actual spectrum efficiency of each cell in each cell combination can be calculated by weighting the number of resources allocated to each cell in the cell combination and its parent set. The actual compromised spectrum efficiency of each cell in each cell combination can also be calculated by weighting the number of allocated resources.

[0092] S407: Adjust the number of resources to be allocated to each cell combination:

[0093] For each divided cell, calculate the total required bandwidth (that is, the total number of resource blocks required (for example, the RB i,j When the total bandwidth requirement of the divided cell is less than the total available resources in each divided cell, this embodiment prioritizes splitting the collision combinations with the highest actual spectrum efficiency loss. The estimated resources of these collision combinations are then split for frequency division scheduling. Information about the corresponding combinations is also updated.

[0094] S408: Allocate unallocated frequency domain resources to the divided cells in ascending order of the divided cell IDs.

[0095] S409: Allocate resource locations for each cell combination according to the above method and the principle of inter-cell interference coordination.

[0096] S410: Allocate resource locations for all users in the area according to the number of resources actually allocated to each collision combination given in the cell resource bitmap estimation. The resource allocation principle is from high to low spectrum efficiency.

[0097] Example 3:

[0098] This embodiment also provides a resource allocation device for an intelligent space division cell cluster, which can be set in various communication devices (for example, but not limited to base stations), see Figure 5 As shown, including:

[0099] The user determination module 501 is configured to determine, for each divided cell in the space-divided cell cluster, users belonging to each cell combination of the divided cell, based on the order of interference caused by each cell combination to the divided cell from smallest to largest. Cell combinations include non-collision combinations containing only the divided cell itself, as well as various collision combinations between the divided cell and other divided cells in the space-divided cell cluster. The process of the user determination module 501 performing the above steps is described in the above embodiments and will not be further described here. It should be understood that the above functions of the user determination module 501 may be implemented by, but not limited to, a processor or controller of the communication device in which the resource allocation apparatus is located.

[0100] The allocation control module 502 is configured to obtain an estimated total resource block requirement for the space-divided cell cluster based on the estimated resource block requirements of users belonging to each cell combination of each divided cell, and to allocate resource blocks to users within each cell combination of each divided cell within the space-divided cell cluster based on the number of available resource blocks in each divided cell and the estimated total resource block requirement of the space-divided cell cluster. The process of the allocation control module 502 executing the above steps is described in the above embodiments and will not be further described here. It should be understood that the above functions of the allocation control module 502 may also be implemented by, but not limited to, a processor or controller of the communication device in which the resource allocation apparatus is located.

[0101] Example 4:

[0102] For ease of understanding, this embodiment is further described below with reference to two specific application scenarios as examples.

[0103] Application scenario 1:

[0104] In this application scenario, the number of cells in the space division cell cluster is N = 4, and the number of available resource blocks in each cell is N RB =100 is assumed to obtain the collision pattern as shown in Table 2:

[0105] Table 2

[0106]

[0107]

[0108] For the resource allocation process in this application scenario, see Figure 6 As shown, including:

[0109] S601: Obtain the number of resources required for each divided cell:

[0110] Assuming that the total number of allocatable resources for each divided cell is 100, according to Table 2, the total estimated number of resources for the four divided cells (that is, the total estimated number of resources for the cell cluster) is: 16+16+16+16=64. The estimated number of resources for each divided cell is less than the total number of allocatable resources for each divided cell.

[0111] S602: The number of available resources for each divided cell is 100. If the total number of estimated resources of the cell cluster is less than or equal to the total number of available resources for each divided cell, then there is no resource collision for all divided cells. Unallocated frequency domain resources are allocated to the divided cells in ascending order of divided cell IDs.

[0112] S603: Allocate resource locations for each cell combination according to the above method and the principle of inter-cell interference coordination.

[0113] S604: Allocate resource locations for all users in the area according to the actual number of resources allocated to each cell combination given in the cell resource bitmap estimation. The resource allocation principle is from high to low spectrum efficiency.

[0114] Application scenario 2:

[0115] In this application scenario, the number of cells in the space division cell cluster is N = 4, and the number of available resource blocks in each cell is N RB =100 is assumed to obtain the collision pattern as shown in Table 3:

[0116] Table 3

[0117]

[0118]

[0119] For the resource allocation process in this application scenario, see Figure 7 As shown, including:

[0120] S701: Estimate the number of resources required for each divided cell:

[0121] Assuming that the total number of allocatable resources for each divided cell is 100, according to Table 3, the total estimated number of resources for the four divided cells (that is, the total estimated number of resources for the cell cluster) is: 120+80+110+90=400, where the estimated number of resources for Cell1 and Cell3 is greater than the total number of allocatable resources for each divided cell, and the estimated number of RBs for Cell2 and Cell4 is less than the total number of allocatable resources for each divided cell.

[0122] S702: Determine that the number of available resources in each divided cell is 100. If the total number of estimated resources in the cell cluster is not less than or equal to the total number of available resources in each divided cell, go to S703.

[0123] S703: Sort the cell combinations in Table 3 in descending order according to the number of combination layers of the cell combinations. For the cell combinations with the same number of combination layers, sort them in descending order according to the average spectral efficiency of the cell combinations. For the cell combinations with the same number of combination layers and the same average spectral efficiency, sort them in descending order according to the difference in the total maximum resource block requirements of each divided cell in the cell combination of the cell group.

[0124] The difference in the estimated number of resources of each divided cell in each collision combination is:

[0125] [18,10,12,16,8,10,7,15,11,7,8,12,12,23,9]

[0126] The mean spectral efficiency of each collision combination is:

[0127] [2.34,2.76,2.65,1.1,0.89,0.58,2.41,2.75,0.88,2.54,3.42,0.83,1.52,2.86,0.48]

[0128] Sort the 15 collision combinations according to the above priority order;

[0129] Update the collision pattern as shown in Table 4:

[0130] Table 4

[0131]

[0132]

[0133] S704: Allocate resource blocks, including:

[0134] For combination 1, there are no collision combinations that include itself, so the number of allocated resources is min{14,4,22,12} = 4, and the number of remaining unallocated resources (i.e., resource blocks) is {10,0,18,8}. For combination 2, there is one collision combination that includes itself—combination 1. The number of resources to be allocated is {16,18,8,0} + {10,0,18,8} = {26,18,26,8}. Since combination 2 cannot have Cell4 collision, the number of resources to be allocated is {26,18,26,0}.

[0135] The number of resources allocated to combination 2 is min{26,18,26}=18, and the allocation order is the number of unallocated resources in combination 1 and the number of unallocated resources in combination 2.

[0136] After allocation is complete, the remaining unallocated resources for combination 1 are {0, 0, 0, 8}, and the remaining unallocated resources for combination 2 are {8, 0, 8, 0}. The mean spectral efficiency and the mean compromised spectral efficiency for combination 1 remain unchanged. The mean spectral efficiency and the mean compromised spectral efficiency for combination 2 are updated based on the actual number of resources allocated to each cell in combination 2.

[0137] Loop through all collision combinations to complete resource allocation.

[0138] S705: Adjust the number of resources required to be allocated to each cell combination.

[0139] If there are resources remaining after the estimated number of resources is allocated to the cells Cell2 and Cell4, the collision combination with the greater spectrum efficiency loss is split first, taken out for frequency division scheduling, and the information of the corresponding combination is updated.

[0140] S706: Allocate resource locations for each collision combination according to the above method and the principle of inter-cell interference coordination.

[0141] S707: Allocate resource locations for all users in the area according to the number of resources actually allocated to each collision combination given in the cell resource bitmap estimation. The resource allocation principle is from high to low spectrum efficiency.

[0142] Embodiment 5:

[0143] This embodiment also provides a communication device, which may be a base station or other communication devices, see Figure 8 As shown, it includes a processor 801, a memory 802 and a communication bus 803;

[0144] The communication bus 803 is used to realize the communication connection between the processor 801 and the memory 802;

[0145] In one example, the processor 801 may be configured to execute one or more computer programs stored in the memory 802 to implement the steps of the resource allocation method for the intelligent space division cell cluster in the above embodiments.

[0146] The present embodiment also provides a computer-readable storage medium, which includes volatile or non-volatile, removable or non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, computer program modules or other data). Computer-readable storage media include, but are not limited to, RAM (Random Access Memory), ROM (Read-Only Memory), EEPROM (Electrically Erasable Programmable read only memory), flash memory or other memory technology, CD-ROM (Compact Disc Read-Only Memory), digital versatile disk (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and can be accessed by a computer.

[0147] In one example, the computer-readable storage medium in this embodiment can be used to store one or more computer programs, which can be executed by one or more processors to implement the steps of the resource allocation method for the intelligent space-division cell cluster in the above embodiments.

[0148] This embodiment also provides a computer program (or computer software), which can be distributed on a computer-readable medium and executed by a computing device to implement at least one step of the resource allocation method for the intelligent space-division cell cluster shown in the above embodiments; and in some cases, at least one step shown or described can be executed in an order different from that described in the above embodiments.

[0149] This embodiment further provides a computer program product, including a computer readable device, on which the computer program as shown above is stored. In this embodiment, the computer readable device may include the computer readable storage medium as shown above.

[0150] It can be seen that those skilled in the art should understand that all or some of the steps, systems, and functional modules / units in the methods disclosed above can be implemented as software (which can be implemented using computer program code executable by a computing device), firmware, hardware, and appropriate combinations thereof. In hardware implementations, the division between the functional modules / units mentioned in the above description does not necessarily correspond to the division of physical components; for example, a physical component can have multiple functions, or a function or step can be performed by several physical components in cooperation. Some or all physical components can be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit.

[0151] In addition, it is well known to those skilled in the art that communication media generally contain computer-readable instructions, data structures, computer program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media. Therefore, the present invention is not limited to any specific hardware and software combination.

[0152] The above content is a further detailed description of the embodiments of the present invention in conjunction with specific implementation methods, and the specific implementation of the present invention cannot be considered to be limited to these descriptions. For those skilled in the art of the present invention, without departing from the concept of the present invention, several simple deductions or substitutions can be made, which should be considered to fall within the scope of protection of the present invention.

Claims

1. A resource allocation method for an intelligent space-division cell cluster, comprising: For each divided cell under the space-divided cell cluster, determine the users belonging to each cell combination of the divided cells; The cell combinations of the divided cells include: non-collision combinations and collision combinations, the collision combinations include various combinations of the divided cells and other divided cells in the space-division cell cluster, and the non-collision combinations include only the divided cells themselves; the space-division cell cluster is a cell covered by a base station using large-scale multiple-input multiple-output technology and divided into multiple divided cells, wherein each divided cell in the space-division cell cluster reuses the same time-frequency resources and is independently scheduled; Obtaining the total estimated resource block requirements of the space-divided cell cluster according to the estimated resource block requirements of users in each cell combination belonging to each divided cell; Allocating resource blocks to users in each cell combination of the divided cells under the space-division cell cluster according to the number of available resource blocks of each divided cell and the estimated total number of resource blocks required by the space-division cell cluster; The allocating resource blocks to users in each cell combination of the divided cells under the space-division cell cluster according to the number of available resource blocks of each divided cell and the estimated total number of resource block requirements of the space-division cell cluster includes: When the total estimated resource block requirement of the space-divided cell cluster is less than or equal to the minimum number of available resource blocks in each divided cell, allocating resource blocks to each divided cell in sequence according to the ID of each divided cell, and allocating resource blocks to users in each divided cell; When the total estimated resource block requirement of the space-divided cell cluster is greater than the minimum number of available resource blocks in each divided cell, allocating resource blocks to the divided cells under each cell combination in descending order of the number of combination layers of the cell combination; The number of combination layers of the cell combination is the number of divided cells included in the cell combination. For a non-collision combination in which a divided cell does not collide with other divided cells of the space-divided cell cluster, the number of combination layers is 1.

2. The resource allocation method for an intelligent space-division cell cluster according to claim 1, wherein: The determining of users belonging to the cell combinations of the divided cells includes: According to the order of the interference caused by the cell combinations to the divided cell from small to large, users belonging to the cell combinations of the divided cell are determined.

3. The resource allocation method for the intelligent space division cell cluster according to claim 2, characterized in that: The determining of users belonging to each cell combination of the divided cell according to the order of interference caused by each cell combination of the divided cell to the divided cell from small to large includes: sorting the other divided cells in the spatial cell cluster that interfere with the divided cell in ascending order of interference, and combining the divided cell with the other divided cells that interfere with it in ascending order of interference to obtain collision combinations with descending interference; Sequentially obtaining the compromised spectrum efficiencies within the collision combinations within the divided cells; when a compromised spectrum efficiency is greater than a preset compromised spectrum efficiency threshold, determining that the user belongs to a collision combination preceding the collision combination corresponding to the compromised spectrum efficiency; and when the collision combination corresponding to the compromised spectrum efficiency is the first collision combination, determining that the user belongs to a non-collision combination in which the divided cell does not collide with other divided cells in the spatial cell cluster, and the user is a user that does not support collision combinations; The compromised spectrum efficiency is the difference between the spectrum efficiency of a user in a divided cell without interference and the spectrum efficiency in a collision combination corresponding to the divided cell.

4. The resource allocation method for an intelligent space-division cell cluster according to claim 1, wherein: Allocating resource blocks to the divided cells under each cell combination in descending order of the number of combination layers of the cell combination includes: Sort the cell combinations according to the following sorting rules; Sort the cell combinations in descending order according to the number of combination layers; for cell combinations with the same number of combination layers, sort them in descending order according to the average spectral efficiency of the cell combinations; for cell combinations with the same number of combination layers and the same average spectral efficiency, sort them in descending order according to the difference in the total maximum resource block requirements of the divided cells in the cell combination; Resource blocks are allocated to the divided cells under each cell combination in sequence according to the sorted order of the cell combinations.

5. The resource allocation method for the intelligent space division cell cluster according to claim 4, characterized in that: The allocating resource blocks to the divided cells under each cell combination in sequence according to the sorted cell combinations includes: When allocating resource blocks to the current cell combination, obtaining a superset of all cell combinations including the cell combination, wherein each cell combination in the superset includes all divided cells in the current cell combination; Obtaining the number of resource blocks required by each divided cell of the current cell combination and the number of resource blocks under-allocated by each divided cell in each cell combination in the parent set of the cell combination, and adding the number of resource blocks required by each divided cell and the number of resource blocks under-allocated to obtain the number of resource blocks to be allocated for each divided cell of the current cell combination; The minimum number of resource blocks to be allocated in each divided cell of the current cell combination is taken as the number of resource blocks allocated this time, and resource blocks are allocated to the divided cells in the corresponding cell combination in sequence according to the order of the current cell combination and each cell combination in the cell combination parent set.

6. The resource allocation method for an intelligent space-division cell cluster according to claim 1, wherein: After allocating resource blocks to the divided cells under each cell combination in descending order of the number of combination layers of the cell combination, the method further includes: When it is determined that one of the divided cells is a resource surplus divided cell when there is a surplus of available resource blocks, at least one target collision combination is selected from the collision combinations of the resource surplus divided cells, the resource surplus divided cell is split from the selected target collision combination, and resource blocks are allocated to the divided cell according to the number of available resource blocks remaining in the resource surplus divided cell.

7. The resource allocation method for the intelligent space division cell cluster according to claim 6, characterized in that: Selecting at least one target collision combination from the collision combinations of the resource surplus partitioned cells includes: According to the remaining available resource blocks of the resource surplus partitioning cell, at least one collision combination is selected from the collision combinations of the resource surplus partitioning cell in descending order of the compromised spectrum efficiency of the collision combinations as a target collision combination.

8. A resource allocation device for an intelligent space-division cell cluster, characterized in that: include: A user determination module is used to determine, for each divided cell in the space-divided cell cluster, users belonging to each cell combination of the divided cells; The cell combinations of the divided cells include: non-collision combinations and collision combinations, the collision combinations include various combinations of the divided cells and other divided cells in the space-division cell cluster, and the non-collision combinations include only the divided cells themselves; the space-division cell cluster is a cell covered by a base station using large-scale multiple-input multiple-output technology and divided into multiple divided cells, wherein each divided cell in the space-division cell cluster reuses the same time-frequency resources and is independently scheduled; an allocation control module, configured to obtain an estimated total resource block requirement of the space-divided cell cluster based on the estimated number of resource block requirements of users belonging to each cell combination of each divided cell, and to allocate resource blocks to users in each cell combination of the divided cells under the space-divided cell cluster based on the number of available resource blocks of each divided cell and the estimated total resource block requirement of the space-divided cell cluster; The allocation control module is configured to obtain the estimated total resource block requirement of the space-divided cell cluster based on the estimated resource block requirement of users belonging to each cell combination of each divided cell, and to allocate resource blocks to users in each cell combination of the divided cells under the space-divided cell cluster based on the number of available resource blocks of each divided cell and the estimated total resource block requirement of the space-divided cell cluster, including: When the total estimated resource block requirement of the space-divided cell cluster is less than or equal to the minimum number of available resource blocks in each divided cell, allocating resource blocks to each divided cell in sequence according to the ID of each divided cell, and allocating resource blocks to users in each divided cell; When the total estimated resource block requirement of the space-divided cell cluster is greater than the minimum number of available resource blocks in each divided cell, allocating resource blocks to the divided cells under each cell combination in descending order of the number of combination layers of the cell combination; The number of combination layers of the cell combination is the number of divided cells included in the cell combination. For a non-collision combination in which a divided cell does not collide with other divided cells of the space-divided cell cluster, the number of combination layers is 1.

9. A communication device comprising a processor, a memory, and a communication bus; The communication bus is used to connect the processor and the memory; The processor is configured to execute the computer program stored in the memory to implement the steps of the resource allocation method for the intelligent space-division cell cluster according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that The computer-readable storage medium stores one or more computer programs, and the one or more computer programs can be executed by one or more processors to implement the steps of the resource allocation method for the intelligent space-division cell cluster according to any one of claims 1 to 7.

Images