# US 2021/0345121 A1 · A method and a node for allocating spectrum efficiently in clusters of nodes > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2021/0345121 A1 - Document ID: US20210345121A1 - Status: Published application - Kind: A1 - Application number: 17/270,634 - Filed: 2019-08-27 - Published: 2021-11-04 - Earliest claimed: 2018-08-27 - Assignees: Telefonaktiebolaget LM Ericsson (publ) - Inventors: Virgil CIMPU - Web page: https://patentgrep.com/patent/US20210345121A1 ## CPC - H04W 16/02: Resource partitioning among network components, e.g. reuse partitioning - H04W 16/10: Dynamic resource partitioning - H04W 16/14: Spectrum sharing arrangements {between different networks} - H04W 28/16: Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service] - H04W 72/0453: Resources in frequency domain, e.g. a carrier in FDMA - H04W 72/541: using the level of interference - H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72) ## Abstract There is provided a method in a controlling node to efficiently assign spectrum to nodes representing wireless base stations which are using/sharing the same block of spectrum. The nodes are organized in a graph where connections between nodes represent potential of interference. The nodes are grouped based on the ability to handle mutual interference. The method comprises: determining recursively a plurality of clusters of nodes of increasing sizes; and assigning a bandwidth to nodes in each cluster, based on the size of the cluster. By so doing, the spectrum allocation can be optimized, allowing each node access to an increased amount of spectrum. ## Claims ### Claim 1 A method in a controlling node, the method comprising: determining recursively a plurality of clusters of nodes by recursively increasing a size of the clusters, starting with clusters of size one and determining clusters with the increased size until all nodes are associated with a cluster; and assigning a bandwidth to each cluster, based on the size of the cluster. ### Claim 2 (depends on 1) The method of claim 1, wherein the plurality of clusters comprises a number of groups of nodes. ### Claim 3 (depends on 1, 2) The method of claim 1 or 2, wherein the size of a cluster of nodes indicates the number of groups of nodes, that the nodes in each cluster belong to, a group of nodes including one or more nodes connected to each other for which interference between the nodes is taken care of within the group. ### Claim 4 (depends on 3) The method of claim 3, wherein the group of nodes is a co-existence group (CxG). ### Claim 5 (depends on 1) The method of claim 1, wherein assigning the bandwidth to each node in a cluster comprises calculating a bandwidth of B/k, wherein B is a total bandwidth and k is the size of the cluster. ### Claim 6 (depends on 5) The method of claim 5, further comprising dividing the assigned bandwidth to nodes within the same group inside a cluster. ### Claim 7 A computer program product comprising a non-transitory computer readable storage medium having computer readable program code embodied in the medium, the computer readable program code comprising computer readable code to perform: determining recursively a plurality of clusters of nodes by recursively increasing a size of the clusters, starting with clusters of size one and determining clusters with the increased size until all nodes are associated with a cluster; and assigning a bandwidth to each cluster, based on the size of the cluster. ### Claim 8 A non-transitory computer readable memory configured to store executable instructions for a controlling node, the executable instructions when executed by one or more processors cause the controlling node to perform: determining recursively a plurality of clusters of nodes by recursively increasing a size of the clusters, starting with clusters of size one and determining clusters with the increased size until all nodes are associated with a cluster; and assigning a bandwidth to each cluster, based on the size of the cluster. ### Claim 9 A controlling node comprising a processing circuitry, the processing circuitry comprising memory and a processor connected thereto, the memory containing instructions that, when executed, cause the processor to: determine recursively a plurality of clusters of nodes by recursively increasing a size of the clusters, starting with clusters of size one and determining clusters with the increased size until all nodes are associated with a cluster; and assign a bandwidth to each cluster, based on the size of the cluster. ### Claim 10 (depends on 9) The controlling node of claim 9, wherein the plurality of clusters comprises a number of groups of nodes. ### Claim 11 (depends on 10) The controlling node of claim 10, wherein the size of the cluster of nodes indicates the number of groups of nodes, that the nodes in each cluster belong to, a group of nodes including one or more nodes connected to each other for which interference between the nodes is taken care of within the group. ### Claim 12 (depends on 11) The controlling node of claim 11, wherein the group of nodes is co-existence group (CxG). ### Claim 13 (depends on 9) The controlling node of claim 9, wherein the processor is configured to assign the bandwidth to each cluster by calculating a bandwidth of B/k, wherein B is a total bandwidth and k is the size of the cluster. ### Claim 14 (depends on 13) The controlling node of claim 13, wherein the processor is configured to divide the assigned bandwidth to nodes within a same group in a cluster. ### Claim 15 (depends on 9) The controlling node of claim 9, wherein the controlling node is a Spectrum Access System (SAS).