WO2014110794A1

WO2014110794A1 - Resource allocation method and device

Info

Publication number: WO2014110794A1
Application number: PCT/CN2013/070687
Authority: WO
Inventors: 傅友; 薛丽霞; 郑娟; 费泽松
Original assignee: 华为技术有限公司
Priority date: 2013-01-18
Filing date: 2013-01-18
Publication date: 2014-07-24
Also published as: CN104412682A

Abstract

Embodiments of the present invention provide a resource allocation method and device. The method comprises: determining whether an interference relationship exists between two random nodes among multiple nodes in a heterogeneous network; if interference exists between at least two random nodes among the multiple nodes, grouping the at least two nodes into one cluster, and obtaining at least two clusters; and allocating channel resources for the nodes in each cluster. In the embodiments of the present invention, an interference relationship between nodes in a heterogeneous network is obtained, the nodes in the heterogeneous network are grouped into clusters, and if interference exists between at least two random nodes in the multiple nodes, the at least two nodes are grouped into one cluster. Therefore, only the nodes in a corresponding cluster need to be considered during allocation of channel resources, so that the same channel resource can be reused in different clusters, and the reuse rate of the channel resource is improved.

Description

The present invention relates to communication technologies, and in particular, to a resource allocation method and apparatus. Background technique

With the development of wireless communication technology, users' demand for high-speed wireless networks and the expectation of service types are increasing. In order to meet the higher system performance indicators proposed by next-generation mobile communication, long-term evolution is introduced in traditional heterogeneous wireless networks. LTE High-frequency Indoor (LTE-HI) node, the LTE-HI node is a low-power node, which can effectively improve network coverage and enhance services by using such a low-power node with low networking cost. Quality, but this dense low-power node network also has serious problem of co-layer interference. If the same resources are multiplexed between adjacent nodes, it will cause the same-band interference problem, which leads to the performance degradation of some users and inhibits the system. Overall performance is improved.

In the prior art, the clustering method is used to suppress the same layer interference. Specifically, the node A has interference with the following nodes: Node B, Node C, and Node D, Node B, Node C, and Node D are not There are interferences. The results after clustering are: Cluster 1: Node A and Node B, Cluster 2: Node C, Cluster 3: Node D, because Node A has interference with the following nodes: Node B, Node C, and Node D, Therefore, when allocating resources for the above nodes, it is necessary to consider cluster 1, cluster 2 and cluster 3 together, that is, to consider different resources for node eight, node B, node C and node D, therefore, When the above nodes allocate resources, node A, node B, node C, and node D can only get a maximum of one quarter of resources.

The inventors found in the process of implementing the embodiments of the present invention that the reuse rate of the prior art resources is low, resulting in waste of resources. Summary of the invention

The embodiment of the invention provides a resource allocation method and device, which are used to solve the problem of low resource reuse rate.

A first aspect of the present invention provides a resource allocation method, including: Determining whether there is an interference relationship between any two nodes of the plurality of nodes included in the heterogeneous network;

If there is interference between any two of the plurality of nodes, dividing the at least two nodes into one cluster, and obtaining at least two clusters;

Channel resources are allocated to nodes in each cluster.

With reference to the first aspect, in a first possible implementation manner of the first aspect, the disassembling the at least two nodes into one cluster, and obtaining at least two clusters, include:

Establishing a first node matrix [M] _{wxjv of} N rows and N columns according to the plurality of nodes, wherein the jth column element of the i th row indicates whether there is an interference relationship between the node i and the node j, and N is a positive integer; Rows and columns corresponding to any k nodes in the first node matrix;

The value of the diagonal element of the deleted first node matrix is the first value, and the value of the element other than the diagonal element in the deleted first node matrix is the second value, if the first value is The second value is different, and the nodes included in the deleted first node matrix are divided into one cluster, where k is greater than or equal to 0 and less than or equal to N.

With reference to the first aspect, or the first possible implementation manner of the first aspect, after the at least two nodes are divided into one cluster, and after at least two clusters are obtained, the method further includes:

If all of the nodes included in the first cluster of the at least two clusters are included in the second cluster of the at least two clusters, the first cluster is deleted.

With reference to the second possible implementation manner of the first aspect, in a third possible implementation manner of the first aspect, if all the nodes included in the first cluster of the at least two clusters are included in the In the second cluster of the at least two clusters, the first cluster is deleted, including:

Establishing, according to the at least two clusters, a second node matrix of N rows and M columns, where M is a number of clusters divided by the plurality of nodes, and each column of the second node matrix represents a cluster, where The i-th row of the two-node matrix corresponds to the node i, and the j-th column element of the i-th row indicates whether there is interference between the node i and other nodes in the j-th cluster, and the matrix element corresponding to the interference relationship is 1, and there is no interference relationship corresponding to The matrix element is 0;

For any mth column in the second node matrix, if each row element in the mth column subtracts the element of the same row in the first non-zero column, the obtained column does not include an element having a value of -1. The first non-zero column is set to 0, wherein the first non-zero column is a column other than the mth column in the second node matrix, and m is greater than or equal to 1 and Less than or equal to M; The cluster represented by the column in which the elements in the second node matrix are all 0 is deleted.

With reference to the first aspect to any one of the third possible implementation manners of the first aspect, in the fourth possible implementation manner of the first aspect, the assigning the channel resource to the node in each cluster includes: The nodes in each cluster are allocated different channel resources in order from the largest to the smallest in the order of the number of nodes included in the cluster divided by the plurality of nodes.

In conjunction with the fourth possible implementation of the first aspect, in a fifth possible implementation manner of the first aspect, before the allocating channel resources to the nodes in each cluster, the method further includes:

An isolated cluster is determined in the clusters divided by the plurality of nodes, and different channel resources are equally allocated to the nodes included in the isolated cluster according to the number of nodes included in the isolated cluster.

With reference to the fourth possible implementation manner of the first aspect, or the fifth possible implementation manner, in the sixth possible implementation manner of the first aspect, the allocating channel resources to the nodes in each cluster includes:

Determining the channel resources to be allocated for each node of each cluster, the channel resources allocated for any node are different from the channel resources allocated for other nodes in the same cluster;

The channel resources allocated to each node of each cluster are adjusted according to the total number of available channel resources and the set of allocated channel resources.

With reference to the sixth possible implementation manner of the first aspect, in a seventh possible implementation manner of the first aspect, determining channel resources to be allocated to each node of each cluster, and allocating channel resources to each node The channel resources allocated by other nodes in the same cluster are different, including:

Determining a first channel resource to be allocated to each node of the third cluster, the first channel resource allocated for any node in the third cluster is different from the first channel resource allocated to other nodes in the third cluster, The third cluster is a cluster that includes the most nodes in the at least two clusters;

Determining, in descending order of the number of nodes included, sequentially assigning different second channel resources to each node in the other clusters except the third cluster, the set of the second channel resources being all or part of Reusing the set of the first channel resources;

Adjusting the channel resources allocated to each node of each cluster according to the total number of available channel resources and the set of allocated channel resources, including:

Determining a quantity of channel resources to be allocated to the plurality of nodes according to a case where the set of the first channel resources is multiplexed according to the set of the second channel resources;

According to the total number of channel resources that can be allocated, and the channel resources to be allocated for the plurality of nodes Adjusting, by the quantity of the source, the channel resources corresponding to each node of the multiple nodes;

The adjusted channel resources are allocated to corresponding nodes.

With reference to the first aspect to any one of the seventh possible implementation manners of the first aspect, in the eighth possible implementation manner of the first aspect, the determining Whether there is interference relationship between nodes, including:

If the first node of the plurality of nodes broadcasts a message, detecting an interference reference signal power of the first node received by the second node, where the second node is the first node except the first node Any node other than

If the interference reference signal power is greater than or equal to a predetermined threshold, determining that there is an interference relationship between the second node and the first node.

A second aspect of the embodiments of the present invention provides a resource allocation apparatus, including:

a judging module, configured to determine whether an interference relationship exists between any two nodes of the plurality of nodes included in the heterogeneous network;

a dividing module, configured to perform interference between at least two nodes of any one of the plurality of nodes, and then divide the at least two nodes into one cluster to obtain at least two clusters;

An allocation module, configured to allocate channel resources for nodes in each cluster.

With reference to the second aspect, in a first possible implementation manner of the second aspect, the dividing module includes:

And a establishing unit, configured to establish, according to the plurality of nodes, a first node matrix [ML _{xAr] of the} N rows and N columns, wherein the jth column element of the i th row indicates whether there is an interference relationship between the node i and the node j, where N is a positive unit; a deleting unit, configured to delete rows and columns corresponding to any k nodes in the first node matrix; and a dividing unit, where the value of the diagonal element of the first node matrix after the deletion is the first value The value of the element other than the diagonal element in the deleted first node matrix is a second value, and if the first value and the second value are different, the deleted first node matrix The included nodes are divided into "clusters," where k is greater than or equal to 0 and less than or equal to N.

In conjunction with the second aspect or the first possible implementation of the second aspect, in a second possible implementation of the first aspect, the device further includes:

a deleting module, configured to: if all nodes included in the first cluster of the at least two clusters are included in In the second of the at least two clusters, the first cluster is deleted.

With reference to the second possible implementation manner of the second aspect, in a third possible implementation manner of the foregoing aspect, the deleting module is specifically configured to establish, according to the at least two clusters, a row of N rows and M columns a two-node matrix, where M is the number of clusters divided by the plurality of nodes, each column of the second node matrix represents a cluster, and the i-th row of the second node matrix corresponds to node i, the i-th row The element of the jth column indicates whether there is interference between the node i and other nodes in the jth cluster, the matrix element corresponding to the interference relationship is 1, and the matrix element corresponding to the interference relationship is 0;

For any mth column in the second node matrix, if each row element in the mth column subtracts the element of the same row in the first non-zero column, the obtained column does not include an element having a value of -1. The first non-zero column is set to 0, wherein the first non-zero column is a column other than the mth column in the second node matrix, and m is greater than or equal to 1 and Less than or equal to M;

The cluster represented by the column in which the elements in the second node matrix are all 0 is deleted.

With reference to the second aspect to any one of the third possible implementation manners of the second aspect, in a fourth possible implementation manner of the second aspect, The number of nodes included in the divided clusters is in descending order, and nodes in each cluster are allocated different channel resources in turn.

In conjunction with the fourth possible implementation of the second aspect, in a fifth possible implementation manner of the second aspect, the allocating module is further configured to determine an isolated cluster in a cluster that is divided by the multiple nodes, According to the number of nodes included in the isolated cluster, different channels are allocated to the nodes included in the isolated cluster.

With reference to the third possible implementation manner of the second aspect, or the fourth possible implementation manner, in the sixth possible implementation manner of the second aspect,

a determining unit, configured to determine channel resources to be allocated for each node of each cluster, the channel resources allocated for any node are different from the channel resources allocated for other nodes in the same cluster;

And an adjusting unit, configured to adjust channel resources allocated to each node of each cluster according to the total number of available channel resources and the set of allocated channel resources.

With reference to the sixth possible implementation manner of the second aspect, in a seventh possible implementation manner of the second aspect, the determining unit is specifically configured to determine a first channel resource to be allocated to each node of the third cluster The first channel resource allocated to any node in the third cluster is different from the first channel resource allocated to other nodes in the third cluster, and the third cluster is a node included in the at least two clusters The cluster with the largest number;

The adjusting unit is specifically configured to determine, according to a case where the set of the first channel resources is multiplexed according to the set of the second channel resources, determine a quantity of channel resources to be allocated to the multiple nodes;

Adjusting channel resources corresponding to each node of the plurality of nodes according to the total number of available channel resources and the proportion of the number of channel resources to be allocated for the plurality of nodes in the total number of assignables;

The adjusted channel resources are allocated to corresponding nodes.

With reference to any one of the second aspect to the seventh possible implementation manner of the second aspect, in the eighth possible implementation manner of the second aspect, the determining module includes:

a detecting unit, configured to detect, if a first node of the plurality of nodes broadcasts a message, an interference reference signal power of the first node received by the second node, where the second node is a Any node other than the first node;

And an interference determining unit, configured to determine that an interference relationship exists between the second node and the first node if the interference reference signal power is greater than or equal to a set threshold value.

A third aspect of the embodiments of the present invention provides a resource allocation apparatus, including:

a memory for storing instructions;

a processor coupled to the memory, the processor being configured to execute instructions stored in the memory, wherein

The processor is configured to:

Determining whether there is an interference relationship between any two nodes of the plurality of nodes included in the heterogeneous network;

Channel resources are allocated to nodes in each cluster.

With reference to the third aspect, in a first possible implementation manner of the third aspect, the processor is further configured to establish, according to the multiple nodes, a first node matrix [M] _{wx v of} N rows and N columns, where The jth column element of the i-th row indicates whether there is an interference relationship between the node i and the node j, and N is a positive integer; Deleting the row and column corresponding to any k nodes in the first node matrix; the value of the diagonal element of the deleted first node matrix is the first value, and the diagonal of the deleted first node matrix The value of the element other than the element is a second value. If the first value and the second value are different, the node included in the deleted first node matrix is divided into a cluster, where k is greater than or Equal to 0 and less than or equal to N.

With reference to the third aspect, or the first possible implementation manner of the third aspect, in a second possible implementation manner of the third aspect, the processor, the processor is further configured to: if the at least two All nodes included in the first cluster in the cluster are included in the second cluster of the at least two clusters, and the first cluster is deleted.

With reference to the second possible implementation manner of the third aspect, in a third possible implementation manner of the third aspect, the processor is specifically configured to establish, according to the at least two clusters, a row of N rows and M columns a two-node matrix, where M is the number of clusters divided by the plurality of nodes, each column of the second node matrix represents a cluster, and the i-th row of the second node matrix corresponds to node i, the i-th row The element of the jth column indicates whether there is interference between the node i and other nodes in the jth cluster, the matrix element corresponding to the interference relationship is 1, and the matrix element corresponding to the interference relationship is 0;

In combination with the third aspect, the third possible implementation manner of the third aspect, The number of nodes included in the divided clusters is in descending order, and nodes in each cluster are allocated different channel resources in turn.

With reference to the fourth possible implementation manner of the third aspect, in a fifth possible implementation manner of the third aspect, the processor is further configured to allocate a channel resource to a node in each cluster, An isolated cluster is determined in a cluster divided by a plurality of nodes, and different channel resources are equally allocated to nodes included in the isolated cluster according to the number of nodes included in the isolated cluster.

With reference to the fourth possible implementation manner of the third aspect, or the fifth possible implementation manner, in a sixth possible implementation manner of the third aspect, the processor is specifically configured to determine The channel resources allocated by each node of the cluster, the channel resources allocated for any node are different from the channel resources allocated for other nodes in the same cluster;

With reference to the sixth possible implementation manner of the third aspect, in a seventh possible implementation manner of the third aspect, the processor is specifically configured to determine a first channel resource to be allocated to each node of the third cluster The first channel resource allocated to any node in the third cluster is different from the first channel resource allocated to other nodes in the third cluster, and the third cluster is a node included in the at least two clusters The cluster with the largest number;

The processor is further configured to determine, according to a case where the set of the first channel resources is multiplexed according to the set of the second channel resources, determine a quantity of channel resources to be allocated to the multiple nodes;

The adjusted channel resources are allocated to corresponding nodes.

With reference to any one of the third aspect to the seventh possible implementation manner of the third aspect, in the eighth possible implementation manner of the third aspect, Transmitting, by the first node, a message, detecting, by the second node, the interference reference signal power of the first node, where the second node is any one of the plurality of nodes except the first node; The interference reference signal power is greater than or equal to a predetermined threshold, and then an interference relationship exists between the second node and the first node.

In the embodiment of the present invention, the nodes in the heterogeneous network are clustered by acquiring the interference relationship between the nodes in the heterogeneous network, and if there is interference between any two nodes of the multiple nodes, At least two nodes are divided into one cluster. When performing channel resource allocation, only nodes in the cluster need to be considered, and the same channel resources can be multiplexed in different clusters, thereby improving the multiplexing rate of channel resources. DRAWINGS

The drawings used in the embodiments or the description of the prior art are briefly described. It is obvious that the drawings in the following description are some embodiments of the present invention, and are not creative to those skilled in the art. Other drawings can also be obtained from these drawings on the premise of labor.

1 is a schematic flowchart of a first embodiment of a resource allocation method according to an embodiment of the present invention; FIG. 2 is a schematic flowchart of a second embodiment of a resource allocation method according to an embodiment of the present invention; Schematic diagram of the process of the third embodiment;

FIG. 6 is a schematic structural diagram of Embodiment 1 of a resource allocation apparatus according to an embodiment of the present invention; FIG. 7 is a schematic structural diagram of Embodiment 2 of a resource allocation apparatus according to an embodiment of the present invention; FIG. 8 is a resource allocation apparatus according to an embodiment of the present invention; FIG. 9 is a schematic structural diagram of Embodiment 4 of a resource allocation apparatus according to an embodiment of the present invention; FIG. 10 is a schematic structural diagram of Embodiment 5 of a resource allocation apparatus according to an embodiment of the present invention; A schematic structural diagram of Embodiment 1 of another resource allocation device provided by the embodiment. The technical solutions in the embodiments of the present invention are clearly and completely described in the following with reference to the accompanying drawings in the embodiments of the present invention. The embodiments are a part of the embodiments of the invention, and not all of the embodiments. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments of the present invention without creative efforts are within the scope of the present invention.

FIG. 1 is a schematic flowchart of Embodiment 1 of a resource allocation method according to an embodiment of the present invention, as shown in FIG.

As shown in 1, the method includes:

S101. Determine whether there is an interference relationship between any two nodes of the plurality of nodes included in the heterogeneous network. Preferably, the interference may be determined according to the interference reference signal power of each node.

The heterogeneous network in this embodiment may be a Long Term Evolution (LTE) heterogeneous network. The foregoing node may be an LTE-HI node, and the node is a low-power node. For enhancing indoor wireless transmission performance or eliminating blind spot areas, the LTE heterogeneous network may be composed of a base station and an LTE-HI node;

In a preferred implementation process, the neighboring base stations are divided into a base station cluster, the size of the base station cluster is the number of base stations included therein, and since one base station and multiple LTE-HI nodes are deployed in each base station area, The different base station areas use different common control carriers (CCCs). Therefore, the size of the base station clusters can be considered as the number of different frequency CCCs used in the base station cluster. It should be noted that the CCC can be used. Carry specific information that interferes with the reference signal.

5102. If there is interference between at least two nodes of any one of the multiple nodes, divide the at least two nodes into one cluster, and obtain at least two clusters. For example, as long as there is interference between at least two of any of the plurality of nodes, the at least two nodes are divided into one cluster.

Any one of the clusters divided by the plurality of nodes does not include the same at least two nodes having the same interference relationship with any other cluster;

Preferably, at least two nodes having the interference relationship among the plurality of nodes are divided into one cluster according to the interference relationship between the nodes, to obtain at least two clusters; after that, if the at least two clusters If all the nodes included in any of the first clusters are included in the second cluster of the at least two clusters, the first cluster is deleted, and finally the final partitioning result is obtained, for example, node 1, node 2, and node 3. If there is an interference relationship between the two, then the three nodes can be divided into the first cluster. If there is a second cluster consisting of two nodes, node 1, node 2, and node 4, the first cluster will be delete.

In this embodiment, the clusters including the repeated interference relationship are filtered, so that any one of the last divided clusters and any other clusters do not include the same at least two nodes having an interference relationship, and further, when channel resource allocation is performed. , the multiplexing rate of channel resources can be higher.

5103. Allocate channel resources for nodes in each cluster;

In the preferred implementation process, the channel resources allocated for each node in each cluster are different, but the same channel resources are reused as much as possible between different clusters.

In this embodiment, the nodes in the heterogeneous network are clustered by acquiring interference relationships between nodes in the heterogeneous network, and if there is interference between any two nodes of the multiple nodes, at least The two nodes are divided into one cluster. For example, there is interference between node A and the following nodes: Node: 6, Node C and Node D, Node B, Node C, and Node D have no interference. The result of clustering by the method of this embodiment is: cluster 1: node A and node B, cluster 2: node A and node C, cluster 3: node A and node D exist, since nodes have been considered in clustering The interference between A and other nodes. Therefore, when allocating resources for the above nodes, only the nodes in the cluster can be considered. Therefore, when allocating resources for the above nodes, node A can obtain one-half of the resources. Therefore, by using the method of the embodiment, when the channel resource allocation is performed, the multiplexing rate of the channel resources can be higher.

2 is a schematic flowchart of a second embodiment of a resource allocation method according to an embodiment of the present invention. Further, the at least two nodes are divided into one cluster, and the process of obtaining at least two clusters is: establishing N rows according to the multiple nodes. The first node matrix of the N columns [Λ ^, where the jth column element of the i-th row indicates whether there is an interference relationship between the node i and the node j, and N is a positive integer; then, deleting any k in the first node matrix Rows and columns corresponding to the nodes; It should be noted that the value of the diagonal element of the deleted first node matrix is the first value, and the elements other than the diagonal elements in the deleted first node matrix The value of the value is the second value. If the first value is different from the second value, the node included in the deleted first node matrix is divided into a cluster, where k is greater than or equal to 0 and less than or equal to N. Preferably, when the deleted first node matrix is a diagonal matrix, the nodes included in the deleted first node matrix are divided into one cluster. Optionally, when the jth column element of the i-th row is 1, there is an interference relationship between the node i and the node j; when the j-th column element of the i-th row is 0, there is no interference relationship between the node i and the node j. . Taking the matrix E as the first node matrix as an example, the flow of obtaining at least two clusters is illustrated, and specifically, the matrix E is:

0 1 1 0 1 0

1 0 0 1 0 1

1 0 0 1 0 0

E

0 1 1 0 0 0

1 0 0 0 0 0

0 1 0 0 0 0

The matrix E is used to represent the interference relationship between the nodes, and each row of the matrix corresponds to one node, that is, the 6x6 matrix indicates that there are 6 nodes, and each column element in each row represents other nodes of the multiple nodes. Whether there is an interference relationship between the nodes corresponding to the row, where 1 indicates that there is an interference relationship. 0 indicates that there is no interference relationship. For example, the first column of the matrix E indicates that the node 1 has an interference relationship with the node 2, the node 3, and the node 5. In the specific implementation process, as shown in FIG. 2, the process includes:

5201, by using the formula 1=-(5-(3⁄4, obtaining the matrix R, where the matrix Q is an all-one matrix having the same number of rows and columns as the matrix E, in this example, a full-one matrix of 6x6, the step of The purpose is to interchange the 0 and 1 elements in the matrix E for subsequent clustering;

1 0 0 1 0 1

0 1 1 0 1 0

0 1 1 0 1 1

R

1 0 0 1 1 1

0 1 1 1 1 1

1 0 1 1 1 1

5202. Delete rows and columns corresponding to k nodes in the matrix R, and obtain an Nk-dimensional matrix, starting from k=0, sequentially, until k=N; wherein each time, k has an Nk-dimensional matrix. For example, when k=l, the first, second, third, fourth, fifth, and sixth rows and columns are deleted in turn, and six 5 χ 5-dimensional matrices can be obtained. Similarly, when k=2, 15 4x4 dimensional matrices can be obtained. Where Q ≤ k ≤ N.

5203. If the Nk-dimensional matrix is an identity matrix, that is, the first value is 1, and the second value is 0, the node included in the matrix after deleting the k-th node in the matrix R is divided into a cluster, for example, , delete 4 nodes: node 3, node 4, node 5, node 6 corresponding to the row and

1 0

Column, get the matrix as the unit matrix, that is, node 1 and node 2 can be divided into one cluster;

0 1 is, if R is not obtained in S201, then when judging the clustering, the nodes represented by the matrix in which the N-k dimensional matrix is all 1 except the diagonal elements are divided into one cluster, which is more complicated to implement.

5204. Determine whether the N-k dimensional matrix is traversed, that is, whether the N-k dimensional matrix is traversed. If no traversal is completed, execute S202. If the traversal is completed, execute S205.

5205. Determine whether k is equal to N. If k is not equal to N, add k to 1 and perform S206. If k is equal to N, execute S206.

1 1 0 0 1 0

1 0 0 1 0 1

0 1 1 0 0 0

S206, obtaining preliminary clustering result C', C

0 0 1 1 0 0

0 0 0 0 1 0

0 0 0 0 0 1 Each of the columns represents a cluster, for example, the second column indicates that node 1 and node 3 are divided into one cluster. In addition, it should be noted that since k is sequentially increased in the above clustering method, the obtained clustering result is obtained from The number of nodes in the first column to the Mth column is sequentially decreased, that is, the number of elements 1 in the i-th column must be greater than or equal to the number of elements 1 in the i+1th column.

FIG. 3 is a schematic flowchart of a third embodiment of a method for allocating resources according to an embodiment of the present invention. After the at least two nodes are divided into one cluster, after at least two clusters are obtained, if any of the at least two clusters is included in the first cluster, All the nodes are included in the second cluster of the at least two clusters, and the first cluster is deleted. Preferably, the second node matrix of the N rows and M columns is established according to the at least two clusters, wherein M is the number of clusters divided by the plurality of nodes, and each column of the second node matrix represents a cluster, and the cluster The i-th row of the second node matrix corresponds to the node i, and the j-th column element of the i-th row indicates whether there is interference between the node i and other nodes in the j-th cluster, and the matrix element corresponding to the interference relationship is 1, and there is no interference relationship corresponding The matrix element is 0; for any mth 歹 ij in the second node matrix, if each row element in the mth column subtracts the element of the same row in the first non-zero column, the obtained column does not include An element having a value of -1 sets the elements of the first non-zero column to 0, wherein the first non-zero column is a column other than the mth column in the second node matrix, and m is greater than or equal to 1 and less than or equal to M; further, the cluster represented by the column in which the elements in the second node matrix are all 0 is deleted. Preferably, in the case where the number of nodes in the first column to the Mth column is sequentially decreased in the clustering result, the row of each row element in the mth column may be subtracted from the mth column. An element of the same row in the Mm non-zero column. If the obtained column does not include an element with a value of -1, the element corresponding to the non-zero column is set to 0, and the column whose element is 0 is deleted, where Start with m=l, execute the process, then increase the m value by one, and then execute the process until m=M, and the process ends.

It can be obtained by the method embodiment shown in FIG. 2 that the preliminary clustering result obtained by the foregoing is the second node matrix, that is, the node corresponding to the Nk-dimensional unit matrix obtained by deleting the row and column corresponding to the k nodes, and is composed of The second node matrix. In the specific implementation process, as shown in FIG. 3, the process of further screening the preliminary clustering result is:

5301. Subtract an element of the same row in the first non-zero column by using any mth column of the second node matrix, where the first non-zero column is a column other than the mth column in the second node matrix;

5302. Determine whether the column obtained by the subtraction includes a row with an element of -1, if not, execute S303; if included, retain the two columns for subtraction; the purpose of the step is to determine each cluster Whether there is an inclusion relationship between the interference relationships indicated, for example, the first column of the above matrix C' is subtracted In the second column, the result is that there are -1 elements, so there is no inclusion relationship, then the two columns represent

1 1 1 1

0 1 0 1

In the other case, the preliminary clustering result matrix C; 1 1 1 0 m=l:

1 0 0 0

0 0 0 0

Substituting the 2nd, 3rd, 4th, and 5th columns in the first column, the result of the first column minus the third column is

The row with the element -1 is not included, the cluster represented by the third column is the first cluster, and the cluster represented by the first column is the second cluster, and the result of subtracting the fifth column from the first column is also obtained. In the case where m=2 is not included, the result of the second column minus the fourth column does not include the row whose element is -1.

5303. Set an element of a non-zero column corresponding to a cluster having a small number of nodes to 0, for example, the matrix C; wherein, when m=l, according to the judgment result, each row of the third column and the fifth column is placed. 0; When m=2, the elements of the 4th column are all set to 0 according to the judgment result.

5304. Determine whether each column in the second node matrix is traversed, that is, whether m is equal to M,

^■m≠M , that is, if the traversal is not completed, S301 is executed; if 111=^1, that is, the traversal is completed, S305 is executed.

5305. Delete the cluster represented by the column in which the elements in the second node matrix are all 0, and obtain the final clustering result. For example, if the matrix C' is judged, there is no column with 0 elements per row, so the final representation is The matrix of cluster results C=C', that is, a total of 6 clusters; and another matrix C;

1 1

0 1

After deleting the third, fourth, and fifth columns, the final clustering result is C, and 1 1 is divided into two.

1 0

0 0

Clusters,

Further, in another embodiment of the present invention, the foregoing allocates channel resources for nodes in each cluster. The source is specifically configured to allocate different channel resources to the nodes in each cluster in descending order of the number of nodes included in the clusters divided by the plurality of nodes; before, in addition, An isolated cluster is determined in the clusters divided by the nodes, and different channel resources are equally allocated to the nodes included in the isolated cluster according to the number of nodes included in the isolated cluster, wherein the isolated cluster is divided by the plurality of nodes. The other clusters in the cluster do not have at least two identical nodes in which the interference relationship exists; the isolated clusters are used to indicate that the nodes have only an interference relationship with the nodes in the cluster, and do not interfere with the nodes in any other cluster;

In the specific implementation process, in the clustering result finally obtained, the row and the row of the row of the clustering result matrix are obtained, and if the row 1 is in the same column, and the column 1 is in the same column, If the other element is a row of 1, then the cluster represented by this column is an isolated cluster, such as a matrix.

C where the first row, the second row, and the third row have a sum of 1, and the elements in the three rows

1 is in the first column. In the first column, except for the elements of the first row, the second row, and the third row, and the other row elements are all 0, the cluster represented by the first column is considered to be an isolated cluster. The row of 5 rows and although it is also 1, but the other column of element 1 has other elements of 1, so the second column is not an isolated cluster; for the isolated cluster represented by the first column, there are 3 nodes For the three nodes to equally allocate different channel resources, for example, the total channel bandwidth is B, then each of the three nodes is assigned to different B/3 channel resources. In one step, the columns representing the orphan clusters in the matrix representing the clustering result are deleted, and the channel resources are allocated to the nodes in the remaining non-isolated clusters.

In the specific implementation process, first, determining channel resources to be allocated for each node of each cluster, the channel resources allocated for any node are different from the channel resources allocated for other nodes in the same cluster, specifically: determining that the third cluster is to be determined The first channel resource allocated by each node is different, and the first channel resource allocated to any node in the third cluster is different from the first channel resource allocated to other nodes in the third cluster, and the third cluster is at least two The cluster includes the cluster with the largest number of nodes; in order of the number of nodes included, the order of the nodes is determined to allocate different second channel resources for each node in the other clusters except the third cluster, The set of two channel resources is fully or partially multiplexed above Adjust the channel resources allocated to each node of each cluster, specifically:

Determining the number of channel resources to be allocated for the plurality of nodes according to the foregoing multiplexing of the set of the second channel resources, determining the total number of channel resources to be allocated, and The proportion of the channel resources allocated by the node is the proportion of the total number of assignables, and the channel resources corresponding to the nodes of the plurality of nodes are adjusted; and the adjusted channel resources are allocated to the corresponding nodes.

More specifically, as shown in FIG. 4, the allocation method is:

S401. Determine a first channel resource to be allocated to each node of the third cluster. The third cluster is a cluster that includes the most nodes in the at least two clusters. In a specific implementation process, the channel to be set may be assumed first. The total number of resources that can be allocated is divided into different X shares. When the total number of channel resources that can be allocated is B, the available sets are expressed as =, B ₂ , · · · , B _x ) , where ≤ c ≤ N , The above matrix C is taken as an example. Each cluster of the matrix C includes two nodes, which are allocated from the first column, the first column includes the node 1 and the node 2, the channel resource is allocated to the node 1, and the channel resource is allocated by the node 2; The node to which the resource has been allocated is marked as an allocated node, and A and ^ are the above-mentioned first channel resources.

S402. Determine, in order from the largest to the smallest number of nodes, that the nodes in the clusters other than the third cluster are allocated different second channel resources, where the second channel resources are all collected. Or partially multiplexing the first channel resource; specifically, the matrix C is still taken as an example, the second column includes node 1 and node 3, node 1 is an allocated node, and node 1 is allocated channel resources, in order to reuse as much as possible The first channel resource needs to ensure that the channel resources allocated by the nodes in the same cluster are different, so the node 2 is allocated the B ₂ channel resource; similarly, the third column includes the node 3 and the node 4, and the node 3 has allocated the S ₂ channel. Resource, then assign node A resource to node 4; node 2 and node 4 in column 4 are all allocated nodes; in column 5, node 1 has allocated channel resources, then node 5 is allocated channel resources; column 6 In the case that node 2 has allocated channel resources, node 6 is allocated channel resources.

S403. Determine, according to the foregoing multiplexing of the second channel resource set, the number of channel resources allocated to the multiple nodes. Specifically, the step is to determine an X value in S401 to determine The number of channel resources needs to be divided into two. Therefore, in the resource allocation process using the matrix C as an example, only the sum is used, so x=2, that is, the number of different channel resources allocated for the clusters divided by the plurality of nodes is 2.

S404. Determine whether the multiple nodes are all allocated to channel resources, that is, whether they are all marked as The allocation node, if all are allocated to the channel resource, executes S405; if there is a node that does not allocate the channel resource, then S402 is performed.

S405. Adjust, according to the total number of available channel resources, and the proportion of the number of channel resources to be allocated to the plurality of nodes, the channel resources corresponding to each node of the multiple nodes; , A = ^ = S /2 , that is, the channel resource corresponding to each node of the plurality of nodes is one-half of the total number of channel resources that can be allocated, and if a cluster is allocated according to the above rule, the above The X is adjusted to 3, that is, the channel resources corresponding to the nodes of the plurality of nodes are one-third of the total number of channel resources that can be allocated.

In this embodiment, the nodes in the heterogeneous network are clustered by acquiring interference relationships between nodes in the heterogeneous network, and if there is interference between any two nodes of the multiple nodes, at least The two nodes are divided into one cluster. If all the nodes included in the divided first cluster are included in the second cluster, the first cluster is deleted. In addition, when performing channel resource allocation, only the inner cluster needs to be considered. The node can be used, and the same channel resource can be reused in different clusters, thereby improving the multiplexing rate of the channel resources. In S101, the specific process for determining whether there is an interference relationship between any two nodes of the plurality of nodes included in the heterogeneous network is:

S501. If the first node of the multiple nodes broadcasts a message, detecting the interference reference signal power of the first node received by the second node, where the interference reference signal is obtained by listening to the detailed information of the interference reference signal carried in the CCC. Power; the second node is any one of the plurality of nodes except the first node.

Specifically, taking a CCC matrix of a base station cluster of size M as an example, the CCC matrix is specifically:

Ν M, The columns in the matrix represent frequencies, that is, the M frequency bands of each column represent M different frequency CCCs used by M base station regions; the rows in the matrix represent time, that is, N _M time slots of each row represent a certain base station The base station and all the nodes in the area are used in total for the time-frequency resource block of the broadcast information, that is, the CCC broadcast period of the base station cluster is ^ time slots, where null represents a vacant time-frequency resource block, that is, a base station in some base station areas and The total number of nodes is less than N _M , thus generating a vacant time-frequency resource block; specifically, for example, 0^ ₁ indicates that the base station of the first base station area can be used for the time-frequency resource block of the broadcast information, and cc ₂ represents the first The first node of the base station area can be used for the time-frequency resource block of the broadcast information; it should be noted that the N _M time-frequency resource blocks of the same size are initially distributed in different time slot positions;

Further, when the node i broadcasts information as the first node in the i-th specific time slot, that is, the time-frequency resource block that the node can use for broadcast information, the other remaining nodes in the matrix serve as the second The node listens to obtain the power of the interference reference signal of the node i therefrom.

S502. If the interference signal power is greater than or equal to the set threshold, determine that there is an interference relationship between the second node and the first node; for example, when the node j receives the broadcast information of the node i, and obtains from the broadcast information. The power of the interference reference signal of the node i, if the power is greater than the set threshold, it is considered that there is an interference relationship between the node i and the node j, and conversely, there is no interference relationship.

In this embodiment, by acquiring the interference relationship between nodes in the heterogeneous network, the nodes in the heterogeneous network are clustered, and the clusters including the repeated interference relationship are filtered, so that any one of the last divided clusters is selected. The cluster and any other clusters do not include the same at least two nodes having an interference relationship, and when the channel resource allocation is performed, the same channel resources can be multiplexed in different clusters, thereby greatly improving the multiplexing rate of the channel resources.

FIG. 6 is a schematic structural diagram of Embodiment 1 of a resource allocation apparatus according to an embodiment of the present invention. As shown in FIG. 6, the apparatus includes: a determining module 601, a dividing module 602, and an allocating module 603, where: a determining module 601 is configured to determine Whether there is an interference relationship between any two nodes of the plurality of nodes included in the heterogeneous network;

a dividing module 602, configured to perform interference between at least two nodes of any one of the plurality of nodes, and then divide the at least two nodes into one cluster to obtain at least two clusters;

The allocation module 603 is configured to allocate channel resources to nodes in each cluster.

The foregoing modules may be used to implement the method embodiment shown in FIG. 1. The specific implementation process is not described herein again. In this embodiment, the nodes in the heterogeneous network are clustered by acquiring interference relationships between nodes in the heterogeneous network, and if there is interference between any two nodes of the multiple nodes, at least The two nodes are divided into one cluster. When performing channel resource allocation, only the nodes in the cluster need to be considered, and the same channel resources can be multiplexed in different clusters, thereby improving the multiplexing rate of the channel resources.

FIG. 7 is a schematic structural diagram of Embodiment 2 of a resource allocation apparatus according to an embodiment of the present invention, as shown in FIG.

7 shows that, based on FIG. 6, the partitioning module 602 includes: an establishing unit 701, and a deleting unit.

702 and dividing unit 703, wherein:

Establishing unit 701, the first node for establishing a matrix of N rows and N columns _[Μ] ΝχΝ, wherein the j-th column of the i-th row element indicating whether interference relationship between node i and node j based on the plurality of nodes, N is a positive integer. The deleting unit 702 is configured to delete the row and the 对应¹ J corresponding to any k nodes in the first node matrix.

a dividing unit 703, wherein a value of a diagonal element of the first node matrix after the deletion is a first value, and a value of an element other than the diagonal element in the deleted first node matrix is a second value, if The first value and the second value are different, and the nodes included in the deleted first node matrix are divided into one cluster, where k is greater than or equal to 0 and less than or equal to N.

FIG. 8 is a schematic structural diagram of Embodiment 3 of a resource allocation apparatus according to an embodiment of the present invention. As shown in FIG. 8, the apparatus further includes: a deleting module 604, specifically, the deleting module 604, If all the nodes included in the first cluster of the at least two clusters are included in the second cluster of the at least two clusters, the first cluster is deleted.

Further, the deleting module 604 is specifically configured to establish, according to the at least two clusters, a second node matrix of N rows and M columns, where M is a number of clusters divided by the multiple nodes, and the second node matrix Each column of the second node represents a cluster, the i-th row of the second node matrix corresponds to the node i, and the j-th column element of the i-th row indicates whether there is interference between the node i and other nodes in the j-th cluster, and there is a matrix corresponding to the interference relationship. The element is 1 and the matrix element corresponding to the interference relationship is 0; for any mth column in the second node matrix, if each row element in the mth column is subtracted from the same row in the first non-zero column After the element, the obtained column does not include an element having a value of -1, and the elements of the first non-zero column are all set to 0, wherein the first non-zero column is the second node matrix a column other than the mth column, m is greater than or equal to 1 and less than or equal to M; representing a column in the second node matrix whose elements are all 0 The cluster is deleted.

Further, the allocating module 603 is specifically configured to allocate different channel resources to the nodes in each cluster in order from the largest to the smallest in the order of the number of nodes included in the clusters divided by the plurality of nodes.

In addition, the allocating module 604 is further configured to determine an isolated cluster in the clusters that are divided by the multiple nodes, and allocate different channel resources to the nodes included in the isolated cluster according to the number of nodes included in the isolated cluster. .

The foregoing modules may be used to implement the method embodiments shown in FIG. 2 and FIG. 3. The specific implementation process is not described herein again.

FIG. 9 is a schematic structural diagram of Embodiment 4 of a resource allocation apparatus according to an embodiment of the present invention. As shown in FIG. 9, on the basis of FIG. 6, the allocation module 603 includes: a determining unit 901 and an adjusting unit 902.

a determining unit 901, configured to determine a channel resource to be allocated to each node of each cluster, and a channel resource allocated to any node is different from a channel resource allocated to other nodes in the same cluster. In a specific implementation process, the determining unit 901 Specifically, it is used to determine a first channel resource to be allocated to each node of the third cluster, a first channel resource allocated to any node in the third cluster, and a first channel allocated to other nodes in the third cluster. Different from the resources, the third cluster is a cluster having the largest number of nodes in the at least two clusters; and sequentially determining, in descending order of the number of nodes included, to be other than the third cluster Each node in the cluster allocates a different second channel resource, and the set of the second channel resources multiplexes the set of the first channel resources in whole or in part.

The adjusting unit 902 is configured to adjust the channel resource allocated to each node of each cluster according to the total number of available channel resources and the set of the allocated channel resources. In a specific implementation, the adjusting unit 902 is specifically configured to be used. Determining, according to a case where the set of the second channel resources is multiplexed the set of the first channel resources, determining a quantity of channel resources to be allocated to the plurality of nodes; according to a total number of available channel resources, and And adjusting, by the quantity of the channel resources allocated by the multiple nodes, the channel resources corresponding to the nodes of the multiple nodes; and allocating the adjusted channel resources to the corresponding nodes.

The foregoing modules may be used to implement the method embodiment shown in FIG. 4, and the specific implementation process is not described herein.

10 is a schematic structural diagram of Embodiment 5 of a resource allocation apparatus according to an embodiment of the present invention. As shown in FIG. 10, on the basis of FIG. 6, the determining module 601 includes: a detecting unit 110 and an interference determining list. Yuan 120, where:

The detecting unit 110 is configured to detect, if the first node of the multiple nodes broadcasts a message, the interference reference signal power of the first node received by the second node, where the second node is the Any node other than the first node;

The interference determining unit 120 is configured to determine that an interference relationship exists between the second node and the first node if the interference reference signal power is greater than or equal to a set threshold.

In this embodiment, the nodes in the heterogeneous network are clustered by acquiring interference relationships between nodes in the heterogeneous network, and if there is interference between any two nodes of the multiple nodes, at least The two nodes are divided into one cluster. If all the nodes included in the divided first cluster are included in the second cluster, the first cluster is deleted. In addition, when performing channel resource allocation, only the inner cluster needs to be considered. The node can be used, and the same channel resource can be reused in different clusters, thereby improving the multiplexing rate of the channel resources.

FIG. 11 is a schematic structural diagram of Embodiment 1 of another resource allocation apparatus according to the present invention. As shown in FIG. 11, the apparatus includes: a memory 10 and a processor 20, where:

The memory 10 is configured to store an instruction;

a processor 20, coupled to the memory 10, the processor 20 is configured to execute instructions stored in the memory 10, and the processor 20 is configured to perform the operations illustrated in Figures 1 through 5 above Resource allocation method.

In a specific execution process, the processor 20 is configured to determine whether an interference relationship exists between any two nodes of the multiple nodes included in the heterogeneous network; if there is interference between any two nodes of the multiple nodes And dividing the at least two nodes into one cluster to obtain at least two clusters; allocating channel resources to the nodes in each cluster.

Further, the processor 20 is further configured to establish, according to the plurality of nodes, a first node matrix of N rows and N columns, where the jth column element of the i-th row indicates whether there is an interference relationship between the node i and the node j, N a positive integer; deleting the row and column corresponding to any k nodes in the first node matrix; the value of the diagonal element of the deleted first node matrix is the first value, and the deleted first node matrix The value of the element other than the diagonal element is a second value, and if the first value and the second value are different, the node included in the deleted first node matrix is divided into a cluster, wherein , k is greater than or equal to 0 and less than or equal to N.

The processor 20 is further configured to: if all nodes included in the first cluster of the at least two clusters are included In the second of the at least two clusters, the first cluster is deleted. Specifically, according to the at least two clusters, a second node matrix of N rows and M columns is established, where M is a number of clusters divided by the plurality of nodes, and each column of the second node matrix represents a cluster. The i-th row of the second node matrix corresponds to the node i, and the j-th column element of the i-th row indicates whether there is interference between the node i and other nodes in the j-th cluster, and the matrix element corresponding to the interference relationship is 1, and there is no interference. The matrix element corresponding to the relationship is 0; for any mth column in the second node matrix, if each element in the mth column is subtracted from the element of the same row in the first non-zero column, the obtained column is If the element having a value of -1 is not included, the elements of the first non-zero column are all set to 0, wherein the first non-zero column is other than the mth column in the second node matrix. The column, m is greater than or equal to 1 and less than or equal to M; the cluster represented by the column in the second node matrix whose elements are all 0 is deleted.

In addition, when the resource is allocated, the processor 20 is further configured to allocate different channel resources to the nodes in each cluster in descending order of the number of nodes included in the clusters divided by the multiple nodes. .

The processor 20 is further configured to: before the channel resources are allocated to the nodes in each cluster, determine isolated clusters in the clusters divided by the multiple nodes, according to the number of nodes included in the isolated cluster, for the isolated The nodes included in the cluster allocate different channel resources on average.

Further, the processor 20 is specifically configured to determine channel resources to be allocated for each node of each cluster, and the channel resources allocated to any node are different from the channel resources allocated to other nodes in the same cluster; a first channel resource allocated by each node of the cluster, a first channel resource allocated for any node in the third cluster is different from a first channel resource allocated to other nodes in the third cluster, the third cluster a cluster having the largest number of nodes in the at least two clusters; determining, in descending order of the number of nodes included, sequentially assigning different nodes to nodes in the clusters other than the third cluster a second channel resource, the set of the second channel resources being all or partially multiplexed with the set of the first channel resources.

The processor 20 is specifically configured to adjust channel resources allocated to each node of each cluster according to the total number of allocated channel resources and the set of allocated channel resources; that is, according to the set multiplexing of the second channel resources. Determining the number of channel resources to be allocated for the plurality of nodes in the case of the set of first channel resources; according to the total number of channel resources that can be allocated, and the number of channel resources to be allocated for the plurality of nodes The proportion of the total number that can be allocated, adjusting channel resources corresponding to each node of the multiple nodes; and allocating the adjusted channel resources to corresponding nodes. When determining the interference relationship, the processor 20 is specifically configured to: if the first node of the multiple nodes broadcasts a message, detect the interference reference signal power of the first node received by the second node, where the second node is Determining any one of the plurality of nodes except the first node; if the interference reference signal power is greater than or equal to a predetermined threshold, determining that there is interference between the second node and the first node relationship.

A person skilled in the art can understand that all or part of the steps of implementing the above method embodiments may be completed by using hardware related to program instructions, and the foregoing program may be stored in a computer readable storage medium, and the program is executed when executed. The method includes the steps of the foregoing method embodiments; and the foregoing storage medium includes: a medium that can store program codes, such as a ROM, a RAM, a magnetic disk, or an optical disk.

Finally, it should be noted that the above embodiments are only for explaining the technical solutions of the present invention, and are not intended to be limiting thereof; although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art will understand that The technical solutions described in the foregoing embodiments may be modified, or some or all of the technical features may be equivalently replaced; and the modifications or substitutions do not deviate from the technical solutions of the embodiments of the present invention. range.

Claims

Claim

A resource allocation method, characterized in that it comprises:

Channel resources are allocated to nodes in each cluster.

The method according to claim 1, wherein the dividing the at least two nodes into one cluster and obtaining at least two clusters includes:

The method according to claim 1 or 2, wherein the dividing the at least two nodes into one cluster and obtaining at least two clusters further includes:

The method according to claim 3, wherein, if all nodes included in the first cluster of the at least two clusters are included in the second cluster of the at least two clusters, Deleting the first cluster includes:

For any mth column in the second node matrix, if each row element in the mth column subtracts the element of the same row in the first non-zero column, the obtained column does not include an element having a value of -1. , then the The first non-zero column is set to 0, wherein the first non-zero column is a column other than the mth column in the second node matrix, m is greater than or equal to 1 and less than or equal to M;

The method according to any one of claims 1-4, wherein the allocating channel resources to nodes in each cluster includes:

The nodes in each cluster are allocated different channel resources in order from the largest to the smallest in the order of the number of nodes included in the cluster divided by the plurality of nodes.

The method according to claim 5, wherein before the allocating channel resources to the nodes in each cluster, the method further includes:

The method according to claim 5 or 6, wherein the allocating channel resources for the nodes in each cluster includes:

8. The method according to claim 7, wherein: determining channel resources to be allocated for each node of each cluster, the channel resources allocated for any node are different from the channel resources allocated for other nodes in the same cluster, including :

Determining, according to a case where the set of the first channel resources is multiplexed by the set of the second channel resources, determining a quantity of channel resources to be allocated to the multiple nodes; Adjusting channel resources corresponding to each node of the multiple nodes according to the total number of available channel resources and the proportion of the number of channel resources to be allocated for the plurality of nodes in the total number of assignables;

The adjusted channel resources are allocated to corresponding nodes.

The method according to any one of claims 1-8, wherein the determining whether there is an interference relationship between any two of the plurality of nodes included in the heterogeneous network includes:

10. A resource allocation device, comprising:

The device according to claim 10, wherein the dividing module comprises: an establishing unit, configured to establish a first node matrix of N rows and N columns according to the plurality of nodes [ML _xAr , wherein, i The jth column element of the row indicates whether there is an interference relationship between the node i and the node j, and N is a positive integer; the deleting unit is configured to delete rows and columns corresponding to any k nodes in the first node matrix; The value of the diagonal element of the first node matrix after the deletion is the first value, and the value of the element other than the diagonal element in the deleted first node matrix is the second value, if the If a value is different from the second value, the nodes included in the deleted first node matrix are divided into “clusters”, where k is greater than or equal to 0 and less than or equal to N.

The device according to claim 10 or 11, further comprising: a deleting module, configured to: if all nodes included in the first cluster of the at least two clusters are included in the at least two clusters In the second cluster, the first cluster is deleted.

The device according to claim 12, wherein the deleting module is specifically configured to establish, according to the at least two clusters, a second node matrix of N rows and M columns, where M is the plurality of nodes a number of divided clusters, each column of the second node matrix represents a cluster, an i-th row of the second node matrix corresponds to a node i, and a j-th column element of the i-th row represents a node i and a j-th cluster Whether the other nodes have interference, the matrix element corresponding to the interference relationship is 1, and the matrix element corresponding to the interference relationship is 0;

The device according to any one of claims 10 to 13, wherein the allocation module is specifically configured to use an order of the number of nodes included in the cluster divided by the plurality of nodes from large to small. Nodes in each cluster are assigned different channel resources in turn.

The device according to claim 14, wherein the allocating module is further configured to determine an isolated cluster in the clusters divided by the plurality of nodes, according to the number of nodes included in the isolated cluster, Allocating different channel resources equally among the nodes included in the isolated cluster.

The device according to claim 14 or 15, wherein the distribution module comprises:

The device according to claim 16, wherein the determining unit is specifically configured to determine a first channel resource to be allocated to each node of the third cluster, and allocate any node in the third cluster. The first channel resource is different from the first channel resource allocated to other nodes in the third cluster, and the third cluster is a cluster that includes the most nodes in the at least two clusters;

Determining, in descending order of the number of nodes included, sequentially assigning different second channel resources to each node in the other clusters except the third cluster, the set of the second channel resources being all or part of Reusing the set of the first channel resources; The adjusting unit is specifically configured to determine, according to a case where the set of the first channel resources is multiplexed according to the set of the second channel resources, determine a quantity of channel resources to be allocated to the multiple nodes;

The adjusted channel resources are allocated to corresponding nodes.

The device according to any one of claims 10-17, wherein the determining module comprises:

19. A resource allocation device, comprising:

a memory for storing instructions;

The processor is configured to:

Channel resources are allocated to nodes in each cluster.

The device according to claim 19, wherein the processor is further configured to: establish a first node matrix of N rows and N columns according to the plurality of nodes;

Wherein, the jth column element of the i-th row indicates whether there is an interference relationship between the node i and the node j, and N is a positive integer; deleting rows and columns corresponding to any k nodes in the first node matrix; The value of the diagonal element of the first node matrix is a first value, and the value of the element other than the diagonal element in the deleted first node matrix is the second value, if the first value and the If the second value is different, the first node matrix will be deleted. The nodes included in the node are divided into one cluster, where k is greater than or equal to 0 and less than or equal to N.

The device according to claim 19 or 20, wherein the processor is further configured to: if all nodes included in the first cluster of the at least two clusters are included in the at least two clusters In the second cluster, the first cluster is deleted.

The device according to claim 21, wherein the processor is specifically configured to establish, according to the at least two clusters, a second node matrix of N rows and M columns, where M is the plurality of nodes a number of divided clusters, each column of the second node matrix represents a cluster, an i-th row of the second node matrix corresponds to a node i, and a j-th column element of the i-th row represents a node i and a j-th cluster Whether the other nodes have interference, the matrix element corresponding to the interference relationship is 1, and the matrix element corresponding to the interference relationship is 0;

The device according to any one of claims 19 to 22, wherein the processor is further configured to use the number of nodes included in the cluster divided by the plurality of nodes from large to small. , assigning different channel resources to the nodes in each cluster in turn.

The device according to claim 23, wherein the processor is further configured to: determine, in a cluster divided by the plurality of nodes, an isolated cluster before allocating channel resources to nodes in each cluster, According to the number of nodes included in the isolated cluster, different channels are allocated to the nodes included in the isolated cluster.

The device according to claim 23 or 24, wherein the processor is specifically configured to determine channel resources to be allocated for each node of each cluster, and the channel resources allocated to any node are in the same cluster. The channel resources allocated by other nodes are different;

The device according to claim 25, wherein the processor is specifically configured to determine a first channel resource to be allocated to each node of the third cluster, and allocate any node in the third cluster. The first channel resource and the first channel resource allocated for other nodes in the third cluster are not Similarly, the third cluster is a cluster that includes the most nodes in the at least two clusters;

The adjusted channel resources are allocated to corresponding nodes.

The device according to any one of claims 19 to 26, wherein the processor is specifically configured to: if the first node of the plurality of nodes broadcasts a message, detect the first received by the second node Interference reference signal power of a node, the second node being any one of the plurality of nodes except the first node;