US9648624B2ActiveUtilityA1

Semi-decentralized scheduling in a wireless network

60
Assignee: Telefonaktiebolaget L M Erisccon (publ)Priority: Jul 20, 2012Filed: Jul 16, 2013Granted: May 9, 2017
Est. expiryJul 20, 2032(~6 yrs left)· nominal 20-yr term from priority
H04W 72/52H04W 72/541H04W 28/16H04W 16/08H04W 84/045H04W 72/0486H04W 72/1252H04W 72/082
60
PatentIndex Score
2
Cited by
12
References
27
Claims

Abstract

In a network ( 700, 800 ) with a plurality of cells ( 715, 815, 825 ), there may be interference couplings among the cells ( 715, 815, 825 ). This may be particularly true for heterogeneous networks ( 800 ). For radio resource scheduling in such network ( 700, 800 ), a semi-decentralized scheduling is proposed in which radio resource scheduling issue is reformulated as load scheduling issue. In the proposed semi-decentralized scheduling, portions of the total load or available headroom are centrally allocated to each local node ( 710, 810, 820 ) subject to the stability of the network ( 700, 800 ). At each local node ( 710, 810, 820 ), radio resources are granted to users ( 740, 840 ) of that local node ( 710, 810, 820 ) subject to the portion of the load or headroom allocated to that local node ( 710, 810, 820 ).

Claims

exact text as granted — not AI-modified
What is claimed is: 
     
       1. A method performed at a central scheduler to schedule radio resources to users located in a plurality of cells of a wireless network, the method comprising:
 for each cell, obtaining load related parameters of that cell; 
 for each cell pair among the plurality of cells, obtaining a coupling factor of that cell pair; 
 for each cell, allocating a free headroom L Fj  to that cell based on the load related parameters of the cells and based on the coupling factors among the cells; and 
 for each cell, notifying a local scheduler associated with that cell of the free headroom L Fj  allocated to that cell; 
 wherein each cell:
 a) partially or wholly overlaps with at least one other cell, or 
 b) is geographically adjacent to at least one other cell, or 
 c) partially or wholly overlaps with at least one other cell and is geographically adjacent to the at least one other cell, 
 
 wherein for each cell, the load related parameters of that cell comprise a minimum required load Σ i=1   n     j   L jil , a throughput distribution Σ i=1   n     j   r ji , and a throughput proportionality {circumflex over (k)} j  of that cell, 
 wherein each cell pair comprises a cell x and a cell y, and the corresponding coupling factor u xy  couples an interference experienced at the cell x due to usage of the radio resources scheduled for the users of the cell y, 
 wherein for each cell, the corresponding free headroom L Fj  defines an amount of load headroom available for distribution among the users of that cell when the local scheduler associated with that cell schedules the radio resources to those users, and 
 wherein the free headrooms L Fj  are allocated subject to a system stability of the wireless network, the system stability being defined such that when the radio resources are scheduled to the users in accordance with the allocated headrooms L Fj , then for each cell, an interference experienced at that cell due to usage of the scheduled radio resources does not exceed a maximum allowable interference at that cell. 
 
     
     
       2. The method of  claim 1 , wherein the step of obtaining the load related parameters for each cell comprises:
 for each cell, receiving the throughput distribution Σ i=1   n     j   r ji  of that cell from the local scheduler associated with that cell; 
 for each cell, receiving the throughput proportionality {circumflex over (k)} j  of that cell from the local scheduler associated with that cell; and 
 
       for each cell, determining the minimum required load Σ i=1   n     j   L jil  of that cell. 
     
     
       3. The method of  claim 1 , wherein the step of allocating the free headrooms L Fj  to the plurality of cells comprises:
 generating a set of simultaneous equations, each equation modeling a total received power I tot   x  at a radio node of each cell x; and 
 solving the set of simultaneous equations for the free headrooms L Fj  to be allocated to the plurality of cells, 
 wherein for each cell, the total received power I tot   x  at the radio node of that cell is modeled as a combination of an own contribution, a coupled interference contribution, and an other contribution, 
 wherein the own contribution of the cell x comprises contribution to the total received power I tot   x  due to transmissions from the users of the cell x, and 
 wherein the coupled interference contribution to the cell x comprises, for each cell y different from the cell x, an own contribution of that different cell y coupled to the cell x by the coupling factor u xy . 
 
     
     
       4. The method of  claim 3 ,
 wherein the step of generating the set of simultaneous equations comprises generating a matrix in a form of AD L  in which 
 
       
         
           
             
               A 
               = 
               
                 [ 
                 
                   
                     
                       1 
                     
                     
                       
                         u 
                         12 
                       
                     
                     
                       … 
                     
                     
                       
                         u 
                         
                           1 
                           ⁢ 
                           c 
                         
                       
                     
                   
                   
                     
                       
                         u 
                         21 
                       
                     
                     
                       1 
                     
                     
                       … 
                     
                     
                       
                         u 
                         
                           2 
                           ⁢ 
                           c 
                         
                       
                     
                   
                   
                     
                       ⋮ 
                     
                     
                       ⋮ 
                     
                     
                       ⋱ 
                     
                     
                       ⋮ 
                     
                   
                   
                     
                       
                         u 
                         
                           c 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           1 
                         
                       
                     
                     
                       
                         u 
                         
                           c 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           2 
                         
                       
                     
                     
                       … 
                     
                     
                       1 
                     
                   
                 
                 ] 
               
             
           
         
          is a coupling matrix, each u xy  is the coupling factor that couples interferences in cell x to users in cell y, c is the number of cells,
 D L =diag(L), L=[L HR1 ,L HR2 , . . . , L HRc ] T , and each L HRy  is the total load of the cell y, and 
 
         wherein the step of solving the set of simultaneous equations comprises solving the matrix AD L  for a free headroom matrix 
       
       
         
           
             
               
                 L 
                 F 
               
               = 
               
                 [ 
                 
                   
                     
                       
                         L 
                         
                           F 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           1 
                         
                       
                     
                   
                   
                     
                       
                         L 
                         
                           F 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           2 
                         
                       
                     
                   
                   
                     
                       ⋮ 
                     
                   
                   
                     
                       
                         L 
                         Fc 
                       
                     
                   
                 
                 ] 
               
             
           
         
          so as to satisfy a stability condition ρ(AD L ) <1 in which each L FJ  denotes the free headroom allocated to each cell, and ρ(•) denotes a spectral radius of the matrix. 
       
     
     
       5. The method of  claim 4 , wherein the step of solving the set of simultaneous equations further comprises solving the matrix AD L  for the free headroom matrix 
       
         
           
             
               
                 L 
                 F 
               
               = 
               
                 [ 
                 
                   
                     
                       
                         L 
                         
                           F 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           1 
                         
                       
                     
                   
                   
                     
                       
                         L 
                         
                           F 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           2 
                         
                       
                     
                   
                   
                     
                       ⋮ 
                     
                   
                   
                     
                       
                         L 
                         Fc 
                       
                     
                   
                 
                 ] 
               
             
           
         
       
       so as to maximize a total throughput 
       
         
           
             
               
                 
                   Γ 
                   _ 
                 
                 TOT 
               
               = 
               
                 
                   ∑ 
                   
                     j 
                     = 
                     1 
                   
                   c 
                 
                 ⁢ 
                 
                   
                     
                       k 
                       ^ 
                     
                     j 
                   
                   ⁢ 
                   
                     L 
                     Fj 
                   
                 
               
             
           
         
       
       of the plurality of the cells subject to a condition 
       
         
           
             
               
                 
                   
                     
                       k 
                       ^ 
                     
                     
                       j 
                       0 
                     
                   
                   ⁢ 
                   
                     L 
                     
                       Fj 
                       0 
                     
                   
                 
                 
                   
                     
                       k 
                       ^ 
                     
                     
                       j 
                       1 
                     
                   
                   ⁢ 
                   
                     L 
                     
                       Fj 
                       1 
                     
                   
                 
               
               = 
               
                 
                   
                     Θ 
                     ^ 
                   
                   
                     j 
                     0 
                   
                 
                 
                   
                     Θ 
                     ^ 
                   
                   
                     j 
                     1 
                   
                 
               
             
           
         
       
       in which {circumflex over (k)} j L Fj  and {circumflex over (Θ)} j  respectively represent a throughput upper bound and a throughput fraction of cell j. 
     
     
       6. The method of  claim 5 , wherein the step of solving the set of simultaneous equations further comprises solving the matrix AD L  such that 
       
         
           
             
               
                 
                   L 
                   F 
                 
                 = 
                 
                   
                     [ 
                     
                       
                         
                           
                             L 
                             
                               F 
                               ⁢ 
                               
                                   
                               
                               ⁢ 
                               1 
                             
                           
                         
                       
                       
                         
                           
                             L 
                             
                               F 
                               ⁢ 
                               
                                   
                               
                               ⁢ 
                               2 
                             
                           
                         
                       
                       
                         
                           ⋮ 
                         
                       
                       
                         
                           
                             L 
                             Fc 
                           
                         
                       
                     
                     ] 
                   
                   = 
                   
                     a 
                     ⁡ 
                     
                       [ 
                       
                         
                           
                             
                               
                                 
                                   
                                     
                                       
                                         
                                           
                                             
                                               Θ 
                                               ^ 
                                             
                                             1 
                                           
                                           / 
                                           
                                             
                                               k 
                                               ^ 
                                             
                                             1 
                                           
                                         
                                       
                                     
                                     
                                       
                                         
                                           
                                             
                                               Θ 
                                               ^ 
                                             
                                             2 
                                           
                                           / 
                                           
                                             
                                               k 
                                               ^ 
                                             
                                             2 
                                           
                                         
                                       
                                     
                                   
                                 
                               
                               
                                 
                                   ⋮ 
                                 
                               
                             
                           
                         
                         
                           
                             
                               
                                 
                                   Θ 
                                   ^ 
                                 
                                 c 
                               
                               / 
                               
                                 
                                   k 
                                   ^ 
                                 
                                 c 
                               
                             
                           
                         
                       
                       ] 
                     
                   
                 
               
               , 
             
           
         
       
       wherein scalar a is chosen such that ρ(AD L) =L stab  in which 1−L stab >0 represents a stability margin. 
     
     
       7. The method of  claim 1 , further comprising:
 for each cell, obtaining a load-throughput characteristic of the local scheduler associated with that cell, the load-throughput characteristic relating the throughput with the load of a scheduling algorithm used by the associated local scheduler, 
 wherein the step of allocating the free headrooms L Fj  to the plurality of cells comprises, for each cell, allocating the free headrooms L Fj  also based on the load-throughput characteristic of the local scheduler associated with that cell. 
 
     
     
       8. The method of  claim 1 , wherein the free headrooms L Fj  are allocated for uplink scheduling of the radio resources by the local schedulers associated with the plurality of cells. 
     
     
       9. The method of  claim 1 , wherein the plurality of cells comprises a macro cell and one or more pico cells, each pico cell being wholly or partially overlapped by the macro cell. 
     
     
       10. A central scheduler structured to schedule radio resources to users located in a plurality of cells of a wireless network, the central scheduler included in a node of the wireless network, the central scheduler comprising:
 a processor coupled to a memory that stores program instructions, wherein when the processor executes the program instructions, the central scheduler causes the node of the wireless network to: 
 obtain, for each cell, load related parameters of that cell; 
 obtain, for each cell pair among the plurality of cells, a coupling factor of that cell pair; and 
 allocate, for each cell, a free headroom L Fj  to that cell based on the load related parameters of the cells and based on the coupling factors among the cells, and notify a local scheduler associated with that cell of the free headroom L Fj  allocated to that cell, 
 wherein each cell:
 a partially or wholly overlaps with at least one other cell, or 
 b) is geographically adjacent to at least one other cell, or 
 c) partially or wholly overlaps with at least one other cell and is geographically adjacent to the at least one other cell, 
 
 wherein for each cell, the load related parameters of that cell comprise a minimum required load Σ i=1   n     j   L jil , a throughput distribution Σ i=1   n     j   r ji , and a throughput proportionality {circumflex over (k)} j  of that cell, 
 wherein each cell pair comprises a cell x and a cell y, and the corresponding coupling factor u xy  couples an interference experienced at the cell x due to usage of the radio resources scheduled for the users of the cell y, 
 wherein for each cell, the corresponding free headroom L Fj  defines an amount of load headroom available for distribution among the users of that cell when the local scheduler associated with that cell schedules the radio resources to those users, and 
 wherein the free headrooms L Fj  are allocated subject to a system stability of the wireless network, the system stability being defined such that when the radio resources are scheduled to the users in accordance with the allocated headrooms L Fj , then for each cell, an interference experienced at that cell due to usage of the scheduled radio resources does not exceed a maximum allowable interference at that cell. 
 
     
     
       11. The central scheduler of  claim 10 , wherein in obtaining the load related parameters for each cell, the central scheduler causes the node of the wireless network to:
 receive, for each cell, the throughput distribution Σ i=1   n     j   r ji  of that cell from the local scheduler associated with that cell, 
 receive, for each cell, the throughput proportionality {circumflex over (k)} j  of that cell from the local scheduler associated with that cell, and 
 determine, for each cell, the minimum required load Σ i=1   n     j   L jil  of that cell. 
 
     
     
       12. The central scheduler of  claim 10 , wherein in allocating the free headrooms L Fj  to the plurality of cells, the central scheduler causes the node of the wireless network to:
 generate a set of simultaneous equations, each equation modeling a total received power I tot   y  at a radio node of each cell y, and 
 solve the set of simultaneous equations for the free headrooms L Fj  to be allocated to the plurality of cells, 
 wherein for each cell, the total received power I tot   y  at the radio node of that cell is modeled as a combination of an own contribution, a coupled interference contribution, and an other contribution, 
 wherein the own contribution of the cell y comprises contribution to the total received power I tot   y  due to transmissions from the users of the cell y, and 
 wherein the coupled interference contribution of the cell y comprises, for each cell x different from the cell y, own contribution of that different cell x coupled to the cell y by the coupling factor u xy . 
 
     
     
       13. The central scheduler of  claim 12 ,
 wherein in generating the set of simultaneous equations, the central scheduler causes the node of the wireless network to generate a matrix equation in a form of AD L  in which 
 
       
         
           
             
               A 
               = 
               
                 [ 
                 
                   
                     
                       1 
                     
                     
                       
                         u 
                         12 
                       
                     
                     
                       … 
                     
                     
                       
                         u 
                         
                           1 
                           ⁢ 
                           c 
                         
                       
                     
                   
                   
                     
                       
                         u 
                         21 
                       
                     
                     
                       1 
                     
                     
                       … 
                     
                     
                       
                         u 
                         
                           2 
                           ⁢ 
                           c 
                         
                       
                     
                   
                   
                     
                       ⋮ 
                     
                     
                       ⋮ 
                     
                     
                       ⋱ 
                     
                     
                       ⋮ 
                     
                   
                   
                     
                       
                         u 
                         
                           c 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           1 
                         
                       
                     
                     
                       
                         u 
                         
                           c 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           2 
                         
                       
                     
                     
                       … 
                     
                     
                       1 
                     
                   
                 
                 ] 
               
             
           
         
          is a coupling matrix, each u xy  is the coupling factor that couples users in cell y to interferences in cell x, c is the number of cells, D L  =diag(L), L =[L 1 , L 2 , . . . , L c ] T , and each L x  is the total load of the cell x, and 
         wherein in solving the set of simultaneous equations, the central scheduler causes the node of the wireless network to solve the matrix equation AD L  for a free headroom matrix 
       
       
         
           
             
               
                 L 
                 F 
               
               = 
               
                 [ 
                 
                   
                     
                       
                         L 
                         
                           F 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           1 
                         
                       
                     
                   
                   
                     
                       
                         L 
                         
                           F 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           2 
                         
                       
                     
                   
                   
                     
                       ⋮ 
                     
                   
                   
                     
                       
                         L 
                         Fc 
                       
                     
                   
                 
                 ] 
               
             
           
         
          so as to satisfy a stability condition ρ(AD L)<1 in which each L fj  denotes the free headroom allocated to each cell, and ρ(•) denotes a spectral radius of the matrix. 
       
     
     
       14. The central scheduler of  claim 13 , wherein in solving the set of simultaneous equations, the central scheduler causes the node of the wireless network to solve the matrix equation AD L  for the free headroom matrix 
       
         
           
             
               
                 L 
                 F 
               
               = 
               
                 [ 
                 
                   
                     
                       
                         L 
                         
                           F 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           1 
                         
                       
                     
                   
                   
                     
                       
                         L 
                         
                           F 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           2 
                         
                       
                     
                   
                   
                     
                       ⋮ 
                     
                   
                   
                     
                       
                         L 
                         Fc 
                       
                     
                   
                 
                 ] 
               
             
           
         
       
       so as to maximize a total throughput of the 
       
         
           
             
               
                 
                   Γ 
                   _ 
                 
                 TOT 
               
               = 
               
                 
                   ∑ 
                   
                     j 
                     = 
                     1 
                   
                   c 
                 
                 ⁢ 
                 
                   
                     
                       k 
                       ^ 
                     
                     j 
                   
                   ⁢ 
                   
                     L 
                     Fj 
                   
                 
               
             
           
         
       
       of the plurality of the cells subject to a condition 
       
         
           
             
               
                 
                   
                     
                       k 
                       ^ 
                     
                     
                       j 
                       0 
                     
                   
                   ⁢ 
                   
                     L 
                     
                       Fj 
                       0 
                     
                   
                 
                 
                   
                     
                       k 
                       ^ 
                     
                     
                       j 
                       1 
                     
                   
                   ⁢ 
                   
                     L 
                     
                       Fj 
                       1 
                     
                   
                 
               
               = 
               
                 
                   
                     Θ 
                     ^ 
                   
                   
                     j 
                     0 
                   
                 
                 
                   
                     Θ 
                     ^ 
                   
                   
                     j 
                     1 
                   
                 
               
             
           
         
       
       in which {circumflex over (k)} j L Fj  and {circumflex over (Θ)} j  respectively represent a throughput upper bound and a throughput fraction of cell j. 
     
     
       15. The central scheduler of  claim 14 , wherein in solving the set of simultaneous equations, the central scheduler causes the node of the wireless network to solve the matrix equation AD L  such that 
       
         
           
             
               
                 
                   L 
                   F 
                 
                 = 
                 
                   
                     [ 
                     
                       
                         
                           
                             L 
                             
                               F 
                               ⁢ 
                               
                                   
                               
                               ⁢ 
                               1 
                             
                           
                         
                       
                       
                         
                           
                             L 
                             
                               F 
                               ⁢ 
                               
                                   
                               
                               ⁢ 
                               2 
                             
                           
                         
                       
                       
                         
                           ⋮ 
                         
                       
                       
                         
                           
                             L 
                             Fc 
                           
                         
                       
                     
                     ] 
                   
                   = 
                   
                     a 
                     ⁡ 
                     
                       [ 
                       
                         
                           
                             
                               
                                 
                                   
                                     
                                       
                                         
                                           
                                             
                                               Θ 
                                               ^ 
                                             
                                             1 
                                           
                                           / 
                                           
                                             
                                               k 
                                               ^ 
                                             
                                             1 
                                           
                                         
                                       
                                     
                                     
                                       
                                         
                                           
                                             
                                               Θ 
                                               ^ 
                                             
                                             2 
                                           
                                           / 
                                           
                                             
                                               k 
                                               ^ 
                                             
                                             2 
                                           
                                         
                                       
                                     
                                   
                                 
                               
                               
                                 
                                   ⋮ 
                                 
                               
                             
                           
                         
                         
                           
                             
                               
                                 
                                   Θ 
                                   ^ 
                                 
                                 c 
                               
                               / 
                               
                                 
                                   k 
                                   ^ 
                                 
                                 c 
                               
                             
                           
                         
                       
                       ] 
                     
                   
                 
               
               , 
             
           
         
       
       wherein scalar a is chosen such that ρ(AD L) =L stab  in which 1−L stab >0 represents a stability margin. 
     
     
       16. The central scheduler of  claim 10 , wherein in allocating the free headrooms L Fj  to the plurality of cells, the central scheduler causes the node of the wireless network to allocate, for each cell, the free headrooms L Fj  also based on a load-throughput characteristic of the local scheduler associated with that cell, the load-throughput characteristic relating the throughput with the load of a scheduling algorithm used by the associated local scheduler. 
     
     
       17. The central scheduler of  claim 10 , wherein the free headrooms L Fj  are allocated for uplink scheduling of the radio resources by the local schedulers associated with the plurality of cells. 
     
     
       18. The central scheduler of  claim 10 , wherein the plurality of cells comprises a macro cell and one or more pico cells, each pico cell being wholly or partially overlapped by the macro cell. 
     
     
       19. A non-transitory computer-readable medium comprising, stored therein, programming instructions that when executed by a computer of a central scheduler, cause the computer to schedule radio resources to users located in a plurality of cells of a wireless network by:
 for each cell, obtaining load related parameters of that cell; 
 for each cell pair among the plurality of cells, obtaining a coupling factor of that cell pair; 
 for each cell, allocating a free headroom L Fj  to that cell based on the load related parameters of the cells and based on the coupling factors among the cells; and 
 for each cell, notifying a local scheduler associated with that cell of the free headroom L Fj  allocated to that cell; 
 wherein each cell:
 a) partially or wholly overlaps with at least one other cell, or 
 b) is geographically adjacent to at least one other cell, or 
 c) partially or wholly overlaps with at least one other cell and is geographically adjacent to the at least one other cell, 
 
 wherein for each cell, the load related parameters of that cell comprise a minimum required load Σ i=1   n     j   L jil , a throughput distribution Σ i=1   n     j   r ji , and a throughput proportionality {circumflex over (k)} j  of that cell, 
 wherein each cell pair comprises a cell x and a cell y, and the corresponding coupling factor u xy  couples an interference experienced at the cell x due to usage of the radio resources scheduled for the users of the cell y, 
 wherein for each cell, the corresponding free headroom L Fj  defines an amount of load headroom available for distribution among the users of that cell when the local scheduler associated with that cell schedules the radio resources to those users, and 
 wherein the free headrooms L Fj  are allocated subject to a system stability of the wireless network, the system stability being defined such that when the radio resources are scheduled to the users in accordance with the allocated headrooms L Fj , then for each cell, an interference experienced at that cell due to usage of the scheduled radio resources does not exceed a maximum allowable interference at that cell. 
 
     
     
       20. A method performed at a local scheduler to schedule radio resources to users located in a cell of a wireless network associated with the local scheduler, the method comprising:
 providing load related parameters of the associated cell to a central scheduler of the wireless network; 
 receiving from the central scheduler a notification of a free headroom L Fj  allocated to the associated cell; and 
 scheduling the radio resources to one or more users located in the associated cell subject to the free headroom L Fj  allocated to the cell by the central scheduler; 
 wherein the associated cell:
 a)partially or wholly overlaps with at least one other cell, or 
 b) is geographically adjacent to at least one other cell, or 
 c) partially or wholly overlaps with at least one other cell and is geographically adjacent to the at least one other cell, 
 
 wherein the load related parameters of the associated cell provided to the central scheduler comprises a throughput distribution Σ i=1   n     j   r ji , a throughput proportionality {circumflex over (k)} j , and one or both of a minimum required load Σ i=1   n     j   L jil  and a number of users n j  of the associated cell, 
 wherein the free headroom L Fj  defines an amount of load headroom available for distribution among the users of the associated cell when the local scheduler schedules the radio resources to those users, and 
 wherein when the radio resources are scheduled to the users in accordance with the allocated headrooms L Fj  then an interference experienced at the associated cell due to usage of the scheduled radio resources does not exceed a maximum allowable interference at the associated cell. 
 
     
     
       21. The method of  claim 20 , wherein the allocated free headroom L Fj  is used for uplink scheduling of the radio resources. 
     
     
       22. The method of  claim 20 , wherein the local scheduler is a part of a radio node serving the associated cell. 
     
     
       23. The method of  claim 20 , wherein the associated cell is a macro cell that overlaps one or more pico cells or is a pico cell overlapped by a macro cell. 
     
     
       24. A local scheduler structured to schedule radio resources to users located in a cell of a wireless network associated with the local scheduler, the local scheduler included in a node serving the cell of the wireless network, the local scheduler comprising:
 a processor coupled to a memory that stores program instructions, wherein when the processor executes the program instructions, the local scheduler causes the node serving the cell of the wireless network to: 
 provide load related parameters of the associated cell to a central scheduler of the wireless network, and 
 receive from the central scheduler a notification of a free headroom L Fj  allocated to the associated cell, and schedule the radio resources to one or more users located in the associated cell subject to the free headroom L Fj  allocated to the cell by the central scheduler, 
 wherein the associated cell:
 a) partially or wholly overlaps with at least one other cell, or 
 b) is geographically adjacent to at least one other cell, or 
 c) partially or wholly overlaps with at least one other cell and is geographically adjacent to the at least one other cell, 
 
 wherein the load related parameters of the associated cell provided to the central scheduler comprises a throughput distribution Σ i=1   n     j   r ji , a throughput proportionality {circumflex over (k)} j , and one or both of a minimum required load and a number of users n j  of the associated cell, 
 wherein the free headroom L Fj  defines an amount of load headroom available for distribution among the users of the associated cell when the local scheduler schedules the radio resources to those users, and 
 wherein when the radio resources are scheduled to the users in accordance with the allocated headrooms L Fj , then an interference experienced at the associated cell due to usage of the scheduled radio resources does not exceed a maximum allowable interference at the associated cell. 
 
     
     
       25. The local scheduler of  claim 24 , wherein the allocated free headroom L fj  is used for uplink scheduling of the radio resources. 
     
     
       26. The local scheduler of  claim 24 , wherein the associated cell is a macro cell that overlaps one or more pico cells or is a pico cell overlapped by a macro cell. 
     
     
       27. A non-transitory computer-readable medium, comprising stored therein, programming instructions that when executed by a computer of a local scheduler cause the computer to schedule radio resources to users located in a cell of a wireless network associated with the local scheduler by:
 providing load related parameters of the associated cell to a central scheduler of the wireless network; 
 receiving from the central scheduler a notification of a free headroom L Fj  allocated to the associated cell; and 
 scheduling the radio resources to one or more users located in the associated cell subject to the free headroom L Fj  allocated to the cell by the central scheduler; 
 wherein the associated cell:
 a) partially or wholly overlaps with at least one other cell, or 
 b) is geographically adjacent to at least one other cell, or 
 c) partially or wholly overlaps with at least one other cell and is geographically adjacent to the at least one other cell, 
 
 wherein the load related parameters of the associated cell provided to the central scheduler comprises a throughput distribution Σ i=1   n     j   r ji , a throughput proportionality {circumflex over (k)} j , and one or both of a minimum required load Σ i=1   n     j   L jil  and a number of users n j  of the associated cell, 
 wherein the free headroom L Fj  defines an amount of load headroom available for distribution among the users of the associated cell when the local scheduler schedules the radio resources to those users, and 
 wherein when the radio resources are scheduled to the users in accordance with the allocated headrooms L Fj  then an interference experienced at the associated cell due to usage of the scheduled radio resources does not exceed a maximum allowable interference at the associated cell.

Cited by (0)

No later patents cite this yet.

References (0)

No backward citations on record.