System and method for designing a distributed MIMO network

By determining the cell allocation and resource allocation of antennas, the problem that the existing technology cannot optimize the distributed antenna MIMO network is solved, efficient coverage of distributed antenna deployment is achieved, and the performance of the MIMO network is optimized.

CN112119654BActive Publication Date: 2024-12-03TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN201980032949.0
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Priority Date
2018-05-18
Filing Date
2019-04-24
Publication Date
2024-12-03
Estimated Expiration
2039-04-24

AI Technical Summary

Technical Problem

The prior art cannot design a multi-input multi-output (MIMO) network of distributed antennas or optimize the radio resource allocation of antennas, resulting in the inability to effectively cover the area where distributed antennas are deployed.

Method used

By obtaining the antenna deployment and its location, determining the cell allocation and resource allocation of the antenna, optimizing radio resource allocation using signal-to-noise ratio (SNR) or signal-to-interference noise ratio (SINR), maximizing the overall area coverage of the MIMO network, and using the K-mean algorithm Variables regroup antennas to improve coverage efficiency.

Benefits of technology

A lightweight and effective resource allocation method for distributed antenna deployment is realized, the performance of MIMO network is optimized, and the utilization rate and coverage of antenna resources are improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN112119654B_ABST
    Figure CN112119654B_ABST
Patent Text Reader

Abstract

Systems and methods for determining radio resource allocations to antennas are provided. In some embodiments, a method includes: obtaining an antenna deployment including antennas and corresponding positions of the antennas; determining a cell allocation for the antennas so that each antenna is allocated to one of one or more cells; and determining a resource allocation for the antennas based on the cell allocation so that each antenna is allocated to one of the one or more radio resources. In this way, some embodiments disclosed herein provide a lightweight and efficient method for designing a distributed antenna deployment. In some embodiments, the resulting network is optimized with respect to the overall area in which a high rank is achieved.
Need to check novelty before this filing date? Find Prior Art

Description

[0001] Related Applications

[0002] This application claims the benefit of Provisional Patent Application No. 62 / 673,430, filed May 18, 2018, the entire disclosure of which is incorporated herein by reference. Technical Field

[0003] The present disclosure relates to designing wireless communications, and in particular, to designing multiple-input and multiple-output (MIMO) networks. Background Art

[0004] Planning products can be used to design network deployments. Some planning products automate some planning processes, significantly reducing planning time. Some planning products enable users to import a floor plan and use the floor plan to create a plan for the location of network products and associated wiring. Users can modify several floor properties (including wall materials and structures) to produce more accurate planning results. Users can also modify node locations to suit their own circumstances. Output from the tool sometimes includes coverage reports, lists of materials that help with ordering, and solution reports that list the hardware and wiring required on each floor of the building.

[0005] Solutions currently exist for designing Multiple Input and Multiple Output (MIMO) networks where antennas are placed in very close proximity (on the order of a few centimeters apart).

[0006] Existing solutions cannot design MIMO networks where antennas are distributed (ie, placed far away from each other) or cannot optimize the allocation of radio resources to antennas. Therefore, other ways of determining the allocation of radio resources to antennas are needed. Summary of the invention

[0007] Systems and methods for determining radio resource allocations for antennas are provided. In some embodiments, a method includes: obtaining an antenna deployment including antennas and corresponding positions of the antennas; determining cell allocations for the antennas such that each antenna is allocated to one of one or more cells; and determining resource allocations for the antennas based on the cell allocations such that each antenna is allocated to one of the one or more radio resources.

[0008] The proposed solution uses an antenna deployment that guarantees a specific signal-to-noise ratio (SNR) or signal-to-interference-and-noise ratio (SINR) up to X% for a given area. Radio resources are allocated to individual antennas to maximize the overall area in which NxN multiple-input and multiple-output (MIMO) can be achieved. Some embodiments disclosed herein describe a MIMO network design in which antennas are distributed in a given area and the allocation of radio resources to antennas is optimized to increase the overall area in which high rank is achieved.

[0009] Various embodiments are proposed herein that address one or more of the issues disclosed herein.In some embodiments, the method comprises the step of calculating a performance metric of the antenna deployment based on the cell allocation and the resource allocation for the plurality of antennas in the antenna deployment.

[0010] In some embodiments, obtaining the antenna deployment includes: receiving the antenna deployment. In some embodiments, obtaining the antenna deployment includes: determining the antenna deployment by the computing node.

[0011] In some embodiments, determining the cell assignment for the plurality of antennas comprises: determining a source antenna; and assigning an antenna closest to the source antenna to a cell corresponding to the source antenna. In some embodiments, the determining step and the assigning step are repeated until each antenna in the plurality of antennas is assigned to one of the one or more cells.

[0012] In some embodiments, determining the source node includes: when none of the multiple antennas are allocated to a cell, determining the farthest antenna as the source antenna; and when at least one of the multiple antennas is allocated to a cell, determining the antenna closest to all the allocated antennas among the multiple antennas as the source antenna.

[0013] In some embodiments, the proximity of the first antenna to the second antenna is based on the physical location of the first antenna and the second antenna. In some embodiments, the proximity of the first antenna to the second antenna is based on a propagation characteristic of at least one of the first antenna and the second antenna.

[0014] In some embodiments, assigning the antenna closest to the source antenna to the cell corresponding to the source antenna further comprises basing the cell assignment on a maximum number of antennas for a given cell.

[0015] In some embodiments, determining the cell allocation for the plurality of antennas further comprises regrouping the plurality of antennas using a variation of a K-means algorithm based on proximity of the plurality of antennas.

[0016] In some embodiments, determining the resource allocation for the plurality of antennas comprises: for one of the one or more cells, determining a best antenna in the one cell; allocating the best antenna to one of the one or more radio resources corresponding to the first data stream; and for each unallocated antenna in the plurality of antennas, allocating one of the other unallocated antennas in the plurality of antennas to a radio resource in the one or more radio resources that optimizes the rank in the coverage area. In some embodiments, the determining step and the allocating step are repeated until each of the one or more cells has been processed.

[0017] In some embodiments, determining the best antenna in the one cell includes: determining the best antenna in the one cell based on propagation characteristics of the multiple antennas.

[0018] In this way, some embodiments disclosed herein provide a lightweight and efficient method for designing distributed antenna deployments.In some embodiments, the resulting network is optimized in terms of the overall area in which a high rank is achieved. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] The accompanying drawings, which are incorporated in and form a part of this specification, illustrate several aspects of the disclosure, and together with the description, serve to explain the principles of the disclosure.

[0020] Figure 1 shows sample plan views according to some embodiments of the present disclosure;

[0021] Figure 2 shows an example plan view that has been divided into discrete locations according to some embodiments of the present disclosure;

[0022] Figure 3 shows an example in which path gains are calculated for points in a plan view according to some embodiments of the present disclosure;

[0023] Figure 4 Some embodiments of the present disclosure are shown Figure 1 A more detailed visualization of the floor plan of where three antennas are present at a particular location;

[0024] Figure 5 A method for determining radio resource allocation to antennas according to some embodiments of the present disclosure is shown;

[0025] Figure 6 shows the integration of some current embodiments with existing deployment tools according to some embodiments of the present disclosure;

[0026] Figure 7illustrates a method of operation according to some embodiments;

[0027] Figure 8 The operating methods according to some embodiments of the present disclosure are shown;

[0028] Fig. 9 is a schematic block diagram of a computing node according to some embodiments of the present disclosure;

[0029] Fig.10 is a schematic block diagram illustrating an embodiment of virtualization of a computing node according to some embodiments of the present disclosure; and

[0030] Fig.11 is a schematic block diagram of a computing node according to some other embodiments of the present disclosure. DETAILED DESCRIPTION

[0031] The embodiments set forth below represent information that enables those skilled in the art to implement the embodiments, and illustrate the best mode of implementing the embodiments. When reading the following description according to the accompanying drawings, those skilled in the art will understand the concepts of the present disclosure, and will recognize the application of these concepts not particularly mentioned herein. It should be understood that these concepts and applications fall within the scope of the present disclosure.

[0032] Some embodiments contemplated herein will now be described more fully with reference to the accompanying drawings. However, other embodiments are included within the scope of the subject matter disclosed herein, and the disclosed subject matter should not be construed as being limited to the embodiments set forth herein; rather, these embodiments are provided by way of example to convey the scope of the subject matter to those skilled in the art.

[0033] As discussed in more detail below, many of the embodiments discussed herein relate to planning and implementing indoor network deployments. However, these embodiments are not limited thereto and may be applicable in many situations. In some embodiments, using Figure 1 The plan view shown. The plan view may include exterior walls, interior walls and various other structures. Additionally, the materials of these structures may be defined and / or the radio propagation characteristics may be known or derived.

[0034] Figure 2 An example plan view is shown that has been divided into discrete locations. In this example, many individual points within the plan view are assigned x, y coordinates. For example, the example plan view shows a regular grid of bins, each bin representing an area near a sampling coordinate. If an antenna is placed in this plan view, various radio characteristics can be calculated for these x, y coordinates. Figure 3 An example is shown in which path gains are calculated for points in a plan view.

[0035] Figure 4 Shows Figure 1A more detailed visualization of the floor plan of . In this figure, there are three antennas at specific locations, and different shading is used to show the signal values.

[0036] Solutions currently exist for designing multiple-input and multiple-output (MIMO) networks where antennas are placed in close proximity (on the order of a few centimeters apart). However, existing solutions are not capable of designing MIMO networks where antennas are distributed (i.e., placed far apart from each other) or of optimizing the allocation of radio resources to the antennas.

[0037] A system and method for determining radio resource allocation to antennas are provided. In some embodiments, a method includes: obtaining an antenna deployment including antennas and corresponding positions of the antennas; determining a cell allocation for the antennas so that each antenna is allocated to one of one or more cells; and determining a resource allocation for the antennas based on the cell allocation so that each antenna is allocated to one of the one or more radio resources. This can provide a lightweight and efficient method for designing a distributed antenna deployment. The resulting network can be optimized in terms of the overall area in which a high rank is achieved.

[0038] Figure 5 A method for determining radio resource allocation to antennas is shown. First, an antenna deployment including antennas and corresponding positions of the antennas is obtained (step 500). Then, a cell allocation for the antennas is determined so that each antenna is allocated to one of the one or more cells (step 502). Based on the cell allocation, a resource allocation for the antennas is determined so that each antenna is allocated to one of the one or more radio resources (step 504).

[0039] In some embodiments, the method takes antenna deployment as input. This input can be user-defined or automatically generated by an optimization algorithm. The x and y coordinates of the antennas and the path loss of the deployment area are used to calculate the following outputs: the allocation of antennas to radio resources (also known as data streams) and cells. In an NxN MIMO network, each cell sends N data streams. An antenna can only send a single unique data stream; therefore, the data streams must be optimally allocated to the antennas so that users see the maximum benefit of the MIMO network. MIMO network performance is maximized when a good signal is received from each unique data stream.

[0040] To evaluate the proposed solution, the Ericsson Indoor Planner (EIP) tool was used to generate antenna deployments. The solution was inserted after the deployment step and the radio resources were allocated to the antennas so that the overall area covered by the N antennas was optimized. Figure 6The integration of some current embodiments with existing deployment tools according to some embodiments is shown. Given an existing antenna deployment (such as a distributed antenna system (DAS) head deployment), via Figure 7 and 8 In the process shown, each head is first assigned to a cell and then to a radio. Starting with antenna deployment (step 600), antennas are assigned to cells (step 602). Radio resources are then allocated to the antennas (step 604). Performance can then be calculated (step 606), and the method can return to some remaining system (608).

[0041] Figure 7 A method of operation according to some embodiments is shown. Given an existing antenna deployment, the first step is to assign each antenna to a cell, such as step 602 described in this section. The deployment method is independent of the following process; the deployment can be user-defined or automatically generated. The cell allocation is optimized to minimize cell boundaries by creating cells that are as dense as possible.

[0042] To create these optimized cells, antennas are first grouped together. Hereinafter, cell groups will be referred to as clusters. A cluster initially includes antennas that have the highest proximity to each other. Here, proximity can be defined as closest in space or with the smallest path loss. The cluster size is limited by the antenna capacity of the cell (which is a user-defined input). If there are unassigned antennas (step 700), the following steps are used to form the initial cluster:

[0043] 1. Find the antenna (source antenna) that is closest to the point defined by the minimum x-coordinate and minimum y-coordinate of all antennas not assigned to a cluster (steps 706 and 708).

[0044] 2. Form a cluster by grouping together the N closest antennas that are not assigned to the cluster to the source antenna's cell (where N is the antenna capacity of the cell) (step 710).

[0045] 3. Repeat steps 1 and 2 until all antennas have been assigned to clusters (step 704).

[0046] A cluster is characterized by its centroid. The centroid of a cluster is calculated as the point defined by the average x and y positions of all antennas in the cluster.

[0047] Once all antennas have been assigned to clusters, they are reallocated using a variation of the K-means clustering algorithm. The reallocation process is as follows (step 702):

[0048] 1. Find the antenna that has the worst proximity to the centroid of the cluster to which it is assigned.

[0049] 2. The antenna is then assigned to the cluster with the highest proximity (ie, whose centroid is closest to the antenna).

[0050] 3. If the new cluster is not full, the assignment is maintained. If the new cluster is full, the antenna in the new cluster that is closest to the centroid of the old cluster is placed in the old cluster.

[0051] 4. Calculate the centroid of the new cluster.

[0052] a. If the total distance of the antennas to the centroid of their cluster has not decreased, the assignment is restored. The process is repeated starting from step 2 using the antenna with the next worst proximity.

[0053] b. Otherwise, repeat the process from step 1.

[0054] 5. Once all antennas have been checked, or a user-defined number of iterations has elapsed, the process terminates.

[0055] Figure 8 A method of operation according to some embodiments is shown. Given the existing antenna deployment and cell allocation, the next step of the solution is to assign radio / data streams to antennas in order to maximize the area served by the N radio / data streams in the NxN MIMO network. The following steps are taken to achieve this result:

[0056] 1. For each cell (step 800), find the antenna with the best propagation (step 802) and assign that antenna to the radio resources with the first data stream (step 804).

[0057] 2. For the remaining unassigned antennas (step 806), traverse all antenna and data stream combinations and find the combination that maximizes the area where M data stream signals are received (where M = the number of unique data streams that have been assigned).

[0058] 3. Check all unassigned antennas in the cell and assign the antenna whose coverage area overlaps most with the area covered by the largest number of data streams (step 808).

[0059] 4. Repeat step 804 until all antennas in the cell have been assigned data streams.

[0060] 5. Repeat steps 802, 804 and 806 for all cells.

[0061] For illustrative purposes, pseudo code for executing some of the methods discussed herein is provided. This merely represents an example implementation, and the present disclosure is not limited thereto.

[0062]

[0063]

[0064]

[0065]

[0066]

[0067]

[0068]

[0069]

[0070] Fig. 9 900 is a schematic block diagram of a computing node 900 according to some embodiments of the present disclosure. As shown, the computing node 900 includes a control system 902, which includes one or more processors 904 (e.g., a central processing unit (CPU), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA), etc.), a memory 906, and a network interface 908. The one or more processors 904 are also referred to as processing circuits in this article. The one or more processors 904 are used to provide one or more functions of the computing node 900 as described herein. In some embodiments, the functions are implemented with software stored in, for example, the memory 906 and executed by the one or more processors 904.

[0071] Fig.10 900 is a schematic block diagram illustrating a virtualized embodiment of a computing node 900 according to some embodiments of the present disclosure. The discussion is also applicable to other types of network nodes or computing nodes. In addition, other types of network nodes and computing nodes can have similar virtualization architectures.

[0072] As used herein, a "virtualized" computing node is an embodiment of a computing node 900 in which at least a portion of the functionality of the computing node 900 is implemented as a virtual component (e.g., via a virtual machine executed on a physical processing node in a network). As shown, in this example, the computing node 900 includes a control system 902, which includes one or more processors 904 (e.g., CPU, ASIC, FPGA, etc.), a memory 906, and a network interface 908, as described above. The control system 902 is connected to a radio unit 910 via, for example, an optical cable. The control system 902 is connected to one or more processing nodes 1000 via a network interface 908, and the one or more processing nodes 1000 are coupled to the network 1002 or are included as part of the network 1002. Each processing node 1000 includes one or more processors 1004 (e.g., CPU, ASIC, FPGA, etc.), a memory 1006, and a network interface 1008.

[0073] In this example, the functionality 1010 of the computing node 900 described herein is implemented at one or more processing nodes 1000, or distributed in any desired manner between the control system 902 and one or more processing nodes 1000. In some specific embodiments, some or all of the functionality 1010 of the computing node 900 described herein is implemented as a virtual component executed by one or more virtual machines implemented in a virtual environment hosted by the processing node 1000. One of ordinary skill in the art will appreciate that additional signaling or communication between the processing node 1000 and the control system 902 is used in order to perform at least some of the desired functionality 1010.

[0074] In some embodiments, a computer program comprising instructions is provided, which, when executed by at least one processor, causes the at least one processor to perform the functions of a computing node 900 or a node (e.g., a processing node 1000 that implements one or more functions 1010 of a computing node 900 in a virtual environment) according to any embodiment described herein. In some embodiments, a carrier comprising the aforementioned computer program product is provided. The carrier is one of an electrical signal, an optical signal, a radio signal, or a computer-readable storage medium (e.g., a non-transitory computer-readable medium, such as a memory).

[0075] Fig.11 1 is a schematic block diagram of a computing node 900 according to some other embodiments of the present disclosure. The computing node 900 includes one or more modules 1100, each of which is implemented in software. The modules 1100 provide the functionality of the computing node 900 described herein. The discussion also applies to Fig.101000 , wherein module 1100 may be implemented at one of processing nodes 1000 , or distributed among multiple processing nodes 1000 and / or between processing node 1000 and control system 902 .

[0076] Any appropriate steps, methods, features, functions or benefits disclosed herein may be performed by one or more functional units or modules of one or more virtual devices. Each virtual device may include a plurality of these functional units. These functional units may be implemented via a processing circuit, which may include one or more microprocessors or microcontrollers, and other digital hardware that may include a digital signal processor (DSP), dedicated digital logic, etc. The processing circuit may be configured to execute program codes stored in a memory, which may include one or more types of memory, such as a read-only memory (ROM), a random access memory (RAM), a cache memory, a flash memory device, an optical storage device, etc. The program code stored in the memory includes program instructions for executing one or more telecommunications and / or data communication protocols, and instructions for executing one or more technologies described herein. In some embodiments, the processing circuit may be used to cause the corresponding functional unit to perform the corresponding functions according to one or more embodiments of the present disclosure.

[0077] Although the processes in the accompanying figures may show a particular order of operations performed by certain embodiments of the present disclosure, it should be understood that such order is exemplary (e.g., alternative embodiments may perform operations in a different order, combine certain operations, overlap certain operations, etc.).

[0078] Example

[0079] 1. A method for determining radio resource allocation to antennas, performed by a computing node (900), the method comprising:

[0080] - obtaining (500, 600) an antenna deployment including a plurality of antennas and corresponding positions of the plurality of antennas;

[0081] - determining (502, 602) a cell allocation for a plurality of antennas such that each antenna is allocated to one of the one or more cells; and

[0082] - Based on the cell allocation, determining (504, 604) a resource allocation for the plurality of antennas such that each antenna is allocated to one of the one or more radio resources.

[0083] 2. The method of embodiment 1, further comprising the step of calculating (606) a performance metric for the antenna deployment based on the cell allocation and resource allocation for multiple antennas in the antenna deployment.

[0084] 3. A method according to any one of embodiments 1 to 2, wherein obtaining antenna deployment includes: receiving antenna deployment.

[0085] 4. The method according to any one of embodiments 1 to 2, wherein obtaining the antenna deployment includes: determining the antenna deployment by a computing node.

[0086] 5. The method of any one of embodiments 1 to 4, wherein determining a cell allocation for multiple antennas comprises:

[0087] - determining (706, 708) the source antenna; and

[0088] - Allocating (710) the antenna closest to the source antenna to the cell corresponding to the source antenna.

[0089] 6. The method of embodiment 5, wherein the determining step and the assigning step are repeated until each antenna of the plurality of antennas is assigned to one of the one or more cells.

[0090] 7. The method of any one of embodiments 5 to 6, wherein determining the source node comprises:

[0091] - when none of the multiple antennas are assigned to the cell, determining (708) the farthest antenna as the source antenna; and

[0092] - When at least one antenna of the plurality of antennas is allocated to the cell, determining (706) an antenna closest to all the allocated antennas of the plurality of antennas as a source antenna.

[0093] 8. The method of any one of embodiments 1 to 7, wherein the proximity of the first antenna to the second antenna is based on a physical location of the first antenna and the second antenna.

[0094] 9. The method of any one of embodiments 1 to 8, wherein the proximity of the first antenna to the second antenna is based on a propagation characteristic of at least one of the first antenna and the second antenna.

[0095] 10. The method of any one of embodiments 5 to 9, wherein assigning the antenna closest to the source antenna to the cell corresponding to the source antenna further comprises basing the assignment on a maximum number of antennas for a given cell.

[0096] 11. The method of any one of embodiments 1 to 10, wherein determining cell allocations for the plurality of antennas further comprises: regrouping the plurality of antennas using a variation of a K-means algorithm based on proximity of the plurality of antennas (702).

[0097] 12. The method of any one of embodiments 1 to 11, wherein determining resource allocation for multiple antennas comprises: for one cell of the one or more cells,

[0098] - determining (802) the best antenna in a cell;

[0099] - allocating (804) the best antenna to a radio resource of the one or more radio resources corresponding to the first data stream; and

[0100] - for each (806) unassigned antenna in the plurality of antennas, allocating (808) one of the other unassigned antennas in the plurality of antennas to a radio resource in the one or more radio resources that optimizes the rank in the coverage area.

[0101] 13. The method of embodiment 5, wherein the determining step and the assigning step are repeated until each of the one or more cells has been processed.

[0102] 14. The method according to any one of embodiments 12 to 13, wherein determining the best antenna in a cell comprises: determining the best antenna in a cell based on propagation characteristics of multiple antennas.

[0103] 15. A computing node (900) for determining radio resource allocation to an antenna, the wireless device comprising:

[0104] - a processing circuit (904, 906, 1004, 1006) configured to perform any of the steps according to any of embodiments 1 to 14; and

[0105] - A power supply circuit configured to supply power to the computing node (900).

[0106] At least some of the following abbreviations may be used in the present disclosure. If there is an inconsistency between the abbreviations, the above usage shall take precedence. If listed multiple times below, the first listing shall take precedence over subsequent listings.

[0107] AoI Area of ​​Interest

[0108] ASIC Application-Specific Integrated Circuit

[0109] CPU Central Processing Unit

[0110] DAS Distributed Antenna System

[0111] DSP Digital Signal Processor

[0112] EIP Ericsson Indoor Planner

[0113] FPGA Field Programmable Gate Array

[0114] MIMO Multiple Input Multiple Output

[0115] RAM Random Access Memory

[0116] ROM Read Only Memory

[0117] SINR Signal to Interference and Noise Ratio

[0118] SNR Signal to Noise Ratio

[0119] Those skilled in the art will recognize improvements and modifications to the embodiments of the present disclosure. All such improvements and modifications are considered to be within the scope of the concepts disclosed herein.

Claims

1. A method for determining radio resource allocation to an antenna, performed by a computing node, the method comprising: obtaining an antenna deployment including a plurality of antennas and corresponding positions of the plurality of antennas; determining a cell assignment for the plurality of antennas such that each antenna is assigned to one of the one or more cells; as well as determining a resource allocation for the plurality of antennas based on the cell allocation such that each antenna is allocated to one of the one or more radio resources, The determining the cell allocation for the multiple antennas includes: determining a source antenna; and allocating an antenna closest to the source antenna to a cell corresponding to the source antenna, Wherein, determining the source antenna comprises: When none of the multiple antennas are allocated to a cell, determining the farthest antenna as the source antenna; and When at least one antenna among the multiple antennas is allocated to a cell, an antenna closest to all the allocated antennas among the multiple antennas is determined as the source antenna.

2. The method according to claim 1, further comprising: A performance metric of the antenna deployment is calculated based on the cell allocation and the resource allocation for the plurality of antennas in the antenna deployment.

3. The method according to claim 1, wherein: Obtaining the antenna deployment includes: receiving the antenna deployment.

4. The method according to claim 1, wherein: Obtaining the antenna deployment includes: determining the antenna deployment by the computing node.

5. The method according to claim 1, wherein: Determining a source antenna and assigning an antenna closest to the source antenna to a cell corresponding to the source antenna are repeated until each of the plurality of antennas is assigned to one of the one or more cells.

6. The method according to claim 1, wherein: The proximity of the first antenna to the second antenna is based on the physical locations of the first antenna and the second antenna.

7. The method according to claim 6, wherein: The proximity of the first antenna to the second antenna is based on a propagation characteristic of at least one of the first antenna and the second antenna.

8. The method according to any one of claims 1 to 7, wherein: Assigning an antenna closest to the source antenna to a cell corresponding to the source antenna further comprises basing the cell assignment on a maximum number of antennas for a given cell.

9. The method according to any one of claims 1 to 7, wherein: Determining the cell assignment for the plurality of antennas further includes regrouping the plurality of antennas using a variation of a K-means algorithm based on proximity of the plurality of antennas.

10. The method according to any one of claims 1 to 7, wherein: Determining the resource allocation for the plurality of antennas comprises: for one of the one or more cells, determining a best antenna in the one cell; allocating the best antenna to a radio resource of the one or more radio resources corresponding to a first data stream; and For each unassigned antenna in the plurality of antennas, one of the other unassigned antennas in the plurality of antennas is assigned to a radio resource in the one or more radio resources that optimizes a rank in a coverage area.

11. The method according to claim 1, wherein: Determining a source antenna and assigning an antenna closest to the source antenna to a cell corresponding to the source antenna is repeated until each of the one or more cells has been processed.

12. The method according to claim 10, wherein: Determining the best antenna in the one cell includes determining the best antenna in the one cell based on propagation characteristics of the multiple antennas.

13. A computing node for determining radio resource allocation to an antenna, the computing node comprising: The processing circuit is configured to: obtaining an antenna deployment including a plurality of antennas and corresponding positions of the plurality of antennas; determining a cell assignment for the plurality of antennas such that each antenna is assigned to one of the one or more cells; as well as determining a resource allocation for the plurality of antennas based on the cell allocation such that each antenna is allocated to one of the one or more radio resources, The determining the cell allocation for the multiple antennas includes: determining a source antenna; and allocating an antenna closest to the source antenna to a cell corresponding to the source antenna, Wherein, determining the source antenna comprises: When none of the multiple antennas are allocated to a cell, determining the farthest antenna as the source antenna; and When at least one antenna among the multiple antennas is allocated to a cell, an antenna closest to all the allocated antennas among the multiple antennas is determined as the source antenna.

14. The computing node according to claim 13, wherein: The processing circuit is further configured to: A performance metric of the antenna deployment is calculated based on the cell allocation and the resource allocation for the plurality of antennas in the antenna deployment.

15. The computing node according to claim 13, wherein: Obtaining the antenna deployment includes: receiving the antenna deployment.

16. The computing node according to claim 13, wherein: Obtaining the antenna deployment includes: determining the antenna deployment by the computing node.

17. The computing node according to claim 13, wherein: Determining the source antenna and assigning an antenna closest to the source antenna to a cell corresponding to the source antenna are repeated until each of the plurality of antennas is assigned to one of the one or more cells.

18. The computing node according to claim 13, wherein: The proximity of the first antenna to the second antenna is based on the physical locations of the first antenna and the second antenna.

19. The computing node according to claim 18, wherein: The proximity of the first antenna to the second antenna is based on a propagation characteristic of at least one of the first antenna and the second antenna.

20. The computing node according to any one of claims 13 to 19, wherein: Assigning an antenna closest to the source antenna to a cell corresponding to the source antenna further comprises basing the cell assignment on a maximum number of antennas for a given cell.

21. The computing node according to any one of claims 13 to 19, wherein: Determining the cell assignment for the plurality of antennas further includes regrouping the plurality of antennas using a variation of a K-means algorithm based on proximity of the plurality of antennas.

22. The computing node according to any one of claims 13 to 19, wherein: Determining the resource allocation for the plurality of antennas comprises, for one of the one or more cells: determining a best antenna in the one cell; allocating the best antenna to a radio resource of the one or more radio resources corresponding to a first data stream; and For each unassigned antenna in the plurality of antennas, one of the other unassigned antennas in the plurality of antennas is assigned to a radio resource in the one or more radio resources that optimizes a rank in a coverage area.

23. The computing node according to claim 13, wherein: Determining the source antenna and assigning an antenna closest to the source antenna to a cell corresponding to the source antenna is repeated until each of the one or more cells has been processed.

24. The computing node according to claim 22, wherein: Determining the best antenna in the one cell includes determining the best antenna in the one cell based on propagation characteristics of the multiple antennas.

25. A computing node for determining radio resource allocation to an antenna, the computing node comprising: Processing circuitry configured to perform the steps of the method according to any one of claims 1 to 12; as well as The power supply circuit is configured to supply power to the computing node.