US11510182B2ActiveUtilityA1

Resource management method and apparatus in user-centric wireless network

55
Assignee: ELECTRONICS & TELECOMMUNICATIONS RES INSTPriority: Nov 18, 2019Filed: Nov 12, 2020Granted: Nov 22, 2022
Est. expiryNov 18, 2039(~13.4 yrs left)· nominal 20-yr term from priority
H04W 28/16H04W 72/04H04L 27/2601H04W 16/10
55
PatentIndex Score
0
Cited by
15
References
17
Claims

Abstract

A resource management method performed by a CP in C-RAN system includes configuring M user-centric cells for M terminals with a plurality of ANs, and determining a number K of orthogonal resource sharing groups sharing a same orthogonal resource; selecting K user-centric cells as group headers for the K orthogonal resource sharing groups, and adding the selected K user-centric cells as group headers to the K orthogonal resource sharing groups; configuring the K orthogonal resource sharing groups by sequentially adding ungrouped user-centric cells to the K orthogonal resource sharing groups; and dividing total system resources into K orthogonal resources, and mapping the divided K orthogonal resources to the K orthogonal resource sharing groups, respectively.

Claims

exact text as granted — not AI-modified
What is claimed is: 
     
       1. A resource management method performed by a central processor (CP), in a cloud radio access network (C-RAN) system configured with a plurality of access nodes (ANs) and the CP, the resource management method comprising:
 configuring M user-centric cells for M terminals with the plurality of ANs, and determining a number K of orthogonal resource sharing groups sharing a same orthogonal resource, wherein M and K are natural numbers; 
 selecting K user-centric cells as group headers for the K orthogonal resource sharing groups, and adding the selected K user-centric cells as group headers to the K orthogonal resource sharing groups; 
 configuring the K orthogonal resource sharing groups by sequentially adding ungrouped user- centric cells to the K orthogonal resource sharing groups; and 
 dividing total system resources into K orthogonal resources, and mapping the divided K orthogonal resources to the K orthogonal resource sharing groups, respectively. 
 
     
     
       2. The resource management method according to  claim 1 , wherein the CP includes base nodes (BNs) each of which corresponds to each of the plurality of ANs and a central node (CN) for centrally controlling the BNs. 
     
     
       3. The resource management method according to  claim 2 , wherein function- splitting is applied to each of the BNs and the ANs. 
     
     
       4. The resource management method according to  claim 1 , wherein the number K of the orthogonal resource sharing groups determines a number of reuses of orthogonal resources. 
     
     
       5. The resource management method according to  claim 1 , wherein the group headers are selected by:
 calculating sums of weights for the M user-centric cells; and 
 selecting user-centric cells corresponding to K largest sums of weights from the sums of weights for the M user-centric cells as the group headers. 
 
     
     
       6. The resource management method according to  claim 5 , wherein the weight is a weight reflecting an amount of interference between each of the M user-centric cells and each of user-centric cells that do not overlap with the each of the M user-centric cells, a throughput of a terminal associated with each of the M user-centric cells, and a throughput of a terminal associated with each of the user-centric cells that do not overlap with the each of the M user-centric cells. 
     
     
       7. The resource management method according to  claim 6 , wherein the amount of interference is measured by the terminal associated with each of the M user-centric cells, and reported to the CP. 
     
     
       8. The resource management method according to  claim 6 , wherein the amount of interference is estimated by the CP based on information on beams reported as optimal beams by the terminal associated with each of the M user-centric cells. 
     
     
       9. The resource management method according to  claim 6 , wherein the CP calculates the throughput of the terminal associated with each of the M user-centric cells by collecting information on an amount of data serviced to the terminal associated with each of the M user-centric cells during a predetermined time window. 
     
     
       10. The resource management method according to  claim 1 , wherein the ungrouped user-centric cells sequentially added to the K orthogonal resource sharing groups are determined using a bipartite matching technique. 
     
     
       11. The resource management method according to  claim 10 , wherein the bipartite matching technique is performed based on a Hungarian algorithm or an extended Kuhn-Munkres algorithm. 
     
     
       12. A central processor (CP), in a cloud radio access network (C-RAN) system configured with a plurality of access nodes (ANs) and the CP, the CP comprising:
 at least one processor; and 
 a memory storing at least one instruction executable by the at least one processor, 
 wherein when executed by the at least one processor, the at least one instruction causes the at least one processor to: 
 configure M user-centric cells for M terminals with the plurality of ANs, and determine a number K of orthogonal resource sharing groups sharing a same orthogonal resource, wherein M and K are natural numbers; 
 select K user-centric cells as group headers for the K orthogonal resource sharing groups, and add the selected K user-centric cells as group headers to the K orthogonal resource sharing groups; 
 configure the K orthogonal resource sharing groups by sequentially adding ungrouped user- centric cells to the K orthogonal resource sharing groups; and 
 divide total system resources into K orthogonal resources, and map the divided K orthogonal resources to the K orthogonal resource sharing groups, respectively. 
 
     
     
       13. The central processor according to  claim 12 , wherein the at least one instruction further causes the at least one processor to select the group headers by:
 calculating sums of weights for the M user-centric cells; and 
 selecting user-centric cells corresponding to K largest sums of weights from the sums of weights for the M user-centric cells as the group headers. 
 
     
     
       14. The central processor according to  claim 13 , wherein the weight is a weight reflecting an amount of interference between each of the M user-centric cells and each of user-centric cells that do not overlap with the each of the M user-centric cells, a throughput of a terminal associated with each of the M user-centric cells, and a throughput of a terminal associated with each of the user-centric cells that do not overlap with the each of the M user-centric cells. 
     
     
       15. The central processor according to  claim 14 , wherein the amount of interference is measured by the terminal associated with each of the M user-centric cells, and reported to the CP. 
     
     
       16. The central processor according to  claim 14 , wherein the CP calculates the throughput of the terminal associated with each of the M user-centric cells by collecting information on an amount of data serviced to the terminal associated with each of the M user-centric cells during a predetermined time window. 
     
     
       17. The central processor according to  claim 12 , wherein the ungrouped user-centric cells sequentially added to the K orthogonal resource sharing groups are determined using a bipartite matching technique.

Cited by (0)

No later patents cite this yet.

References (0)

No backward citations on record.