Abstract:
A method and device for selecting a heterogeneous network serving cell based on inter-cell cooperation, which relate to the field of digital communications. The method disclosed in the embodiments of the present invention comprises: acquiring, by a central node base station in a heterogeneous network, alternative users in each cell in the heterogeneous network; and according to a pre-set alternative user selection criterion, selecting an alternative user in the entire network from the alternative users in all cells in the heterogeneous network; and if the alternative user in the entire network needs to conduct a reselection operation, initiating a cell reselection flow. Also disclosed is a device for selecting a heterogeneous network serving cell based on inter-cell cooperation corresponding to the method.

Description:
TECHNICAL FIELD 
       [0001]    The disclosure relates to the field of digital communications, and in particular, to a solution for selecting a heterogeneous network serving cell of a Carrier Aggregation (CA) system based on inter-cell cooperation. 
       BACKGROUND 
       [0002]    The heterogeneous network becomes a research hotspot of mobile communications because it can realize the optimization of system performance by improving the topological structure of the network. The heterogeneous network is composed of a high-power macro base stations and low-power nodes of network planning. The low-power nodes are under the coverage of the macro base stations and placed autonomously. The low-power nodes include a femtocell, a pico-cell, a relay station, and so on, which can realize coverage of hotspot region and shunt of cell services, so that a cell splitting gain is obtained. Because the power and coverage of different types of base stations are different, and the low-power node placed autonomously, the interference problems of control channels and service channels of different base stations are very outstanding in the heterogeneous network, so the heterogeneous network faces huge technical challenges. 
         [0003]    In the next generation evolution system, for example, the 3GPP-LTE-A standard, enhanced Inter-Cell Interference Coordination (eICIC) schemes are adopted to solve the interference problems. The eICIC is one of the symbol key technologies in the LTE-A for improving the cell edge coverage and realizing the Range Extension (RE) with the intent to shunt the cell services. The eICIC schemes are divided into two types: an eICIC scheme based on the CA technology and the other eICIC scheme based on the time-domain Almost Blank Subframe (ABS). The ABS realizes service silence by configuring ABS subframes in an interfered cell, and the interfered cell uses these ABS subframes to provide services for users strongly interfered in the cell, so that the coordination of interferences between the cells is realized. 
         [0004]    As one of the key technologies, the CA can not only provide a high-speed service on a large bandwidth formed by aggregation, but also can avoid interferences in a frequency domain which realizes the heterogeneous network at a Component Carrier (CC) resolution level. It is supposed that the bandwidth of the heterogeneous network is composed of two CCs, namely f 1  and f 2 . In order to realize the interference coordination between the macro base station and the pico-cell, the f 1  and f 2  can be allocated to the users of the macro base station and the pico-cell respectively, so as to avoid the interferences of the service channel and the control channel of the users. Or, a cell centre user of the pico-cell can be allocated with the same CC as the macro base station, and an edge user is allocated with the CC different from that of the macro base station. The disadvantage of the scheme is that it can only be adopted by the LTE-A users, but cannot be compatible with the LTE users. The application of all the above technologies has an important premise, that is, the problem of selecting a user service cell from the cells needs to be solved at first. In a cellular mobile communication network, all users have a home service cell, which provides the users with broadcasting, service transmission and other services. In a traditional homogeneous network, selecting the user service cell is based on the measurement of received signal intensity. In the heterogeneous network, because the transmission power of added nodes is far lower than that of the macro base station, a method for selecting a service cell based on the received signal intensity will cause a very small coverage range of these nodes and does not realize the maximization of cell splitting gain. For the purpose of boosting the priority of the low-power nodes and extending the coverage range of the low-power nodes, the 3GPP meeting launches researches and discussions, and provides some cell selection and reselection algorithms in the enhanced LTE-A heterogeneous network, which mainly include an RE algorithm and a path loss algorithm presented by Qualcomm. The core idea of the RE algorithm is that in the traditional service cell selection algorithm, a bias value which is greater than 0 is added to the Reference Signal Receiving Power (RSRP) of the low-power node, and the bias value of the RSRP of the macro base station is 0, so as to reduce the threshold of the low-power node and increase the chance of a UE to select the low-power node as the serving cell. In the cell selection algorithm based on path loss, each UE selects the cell with the minimum path loss as the serving cell. 
         [0005]    The above method obviously enlarges the coverage range of the low-power nodes, which is even similar to the macro base station. But for the users at the coverage edge of the low-power nodes, even though an interference elimination means is adopted to eliminate the influence of a strong interference source, a downlink Signal to Interference plus Noise Ratio (SINR) is very low due to the too low transmission power of its serving cell (the low-power node), therefore the spectral efficiency of the cell is reduced. 
         [0006]    When a multi-antenna technology is adopted, the inter-cell interference coordination can be further performed in the spatial domain; for example, in a Coordinated Multi-Point (CoMP) transmission technology. Through the interaction of channel information of the mobile users between adjacent cells, the adjacent cells adopt a certain interference avoiding policy to the edge users or multiple cells perform joint transmission to the mobile users, thereby improving the throughput of the edge users and increasing the coverage of high data transmission rate, reducing the interferences of the edge users, and improving the throughput of the cells. In the heterogeneous network, the CoMP transmission technology can serve as an enhancement of the eICIC technology, and can further increase the system capacity based on a gain obtained by the eICIC technology. 
         [0007]    At present, the cell selection and interference management are two independent processes. The cell selection increases the number of users of the low-power node through load balancing, and the interference management is used for solving the problem of the increase of inter-cell interferences. With the increase of density of the low-power nodes, if the processing is continued according to the above method, the complexity of an interference management algorithm will increase sharply, and the effectiveness of the interference management algorithm will be reduced, thus influencing the increase of the number of low-power node users. 
       SUMMARY 
       [0008]    The disclosure provides a method and device for selecting a heterogeneous network serving cell based on inter-cell cooperation, so as to increase the system capacity of a low-power node. 
         [0009]    To solve the above technical problem, the disclosure discloses a method for selecting a heterogeneous network serving cell based on inter-cell cooperation, which includes that: 
         [0010]    a central node base station in a heterogeneous network obtains alternative users in each cell in the heterogeneous network, and selects an alternative user in the entire network from the alternative users in all cells in the heterogeneous network according to a pre-set alternative user selection criterion; 
         [0011]    if the alternative user in the entire network needs to perform a reselection operation, a cell reselection flow is initiated. 
         [0012]    In an embodiment, the method further includes that: 
         [0013]    each cell base station in the heterogeneous network selects in this cell the alternative users in a cell according to the pre-set alternative user selection criterion, and reports the selected alternative users in the cell to the central node base station. 
         [0014]    In an embodiment, in the above method, the alternative user selection criterion includes one or more of the followings: 
         [0015]    a system rate maximizing criterion, a degree of freedom restoring criterion, and a frequency reuse criterion. 
         [0016]    In an embodiment, in the above method, the system rate maximizing criterion is: 
         [0017]    selecting the user with the maximum rate ratio R m (q)/R m (j) in the rate ratios R m (q)/R m (j) of cell reselection of all users as the alternative user, and R m (q) is the rate obtained in the reselected cell by the user m, and R m (j) is the rate obtained in the current serving cell j by the user m. 
         [0018]    In an embodiment, in the above method, the rate ratio R m (q)/R m (j) of cell reselection of the user is determined according to the following process: 
         [0019]    calculating R m (q) and R m (j) respectively, so as to obtain the rate ratio R m (q)/R m (j) of cell reselection of the users; 
         [0020]    he rate obtained in each cell by each user is determined according to the following formula: 
         [0000]    
       
         
           
             
               
                 R 
                 m 
               
                
               
                 ( 
                 
                   q 
                   * 
                 
                 ) 
               
             
             = 
             
               
                 ∑ 
                 
                   k 
                   ⋐ 
                   K 
                 
               
                
               
                   
               
                
               
                 
                   
                     G 
                      
                     
                       ( 
                       
                         y 
                         
                           
                             q 
                             * 
                           
                           , 
                           k 
                         
                       
                       ) 
                     
                   
                    
                   
                     E 
                      
                     
                       ( 
                       
                         R 
                         
                           k 
                           , 
                           m 
                           , 
                           
                             q 
                             * 
                           
                         
                       
                       ) 
                     
                   
                 
                 
                   y 
                   
                     
                       q 
                       * 
                     
                     , 
                     k 
                   
                 
               
             
           
         
       
     
         [0021]    where, R m (q*) is the rate obtained in the cell q* by the user m; 
         [0022]    E(R k,m,q* ) is the mathematical expectation of R k,m,q* , R k,m,q*  is the instantaneous average maximum data rate that the user m can realize on the carrier k of the cell q*, and K is the total number of carriers in the cell q*; y q*,k =Σ m⊂M x m,q*  is the number of users accessing the cell q*; when x m,q*  is equal to 1, q* is the serving cell of the user m; when x m,q*  is equal to 0, q* is not the serving cell of the user m; M is the total number of users supported by the cell q*; 
         [0000]    
       
         
           
             
               G 
                
               
                 ( 
                 
                   y 
                   
                     
                       q 
                       * 
                     
                     , 
                     k 
                   
                 
                 ) 
               
             
             = 
             
               
                 ∑ 
                 
                   m 
                   = 
                   1 
                 
                 
                   y 
                   
                     
                       q 
                       * 
                     
                     , 
                     k 
                   
                 
               
                
               
                   
               
                
               
                 1 
                 m 
               
             
           
         
       
     
         [0000]    is a diversity gain of multiple users. 
         [0023]    In an embodiment, in the above method, the degree of freedom restoring criterion is: 
         [0024]    in a spatial beam joint selection algorithm in the set time, selecting the user with the maximum number of beam closing times in the numbers of beam closing times of all users as the alternative user. 
         [0025]    In an embodiment, in the above method, in the spatial beam joint selection algorithm in the set time, the process of determining the number of beam closing times of the user is as follows: 
         [0026]    parameters A and b k,q  when the overall system rate is the maximum are iteratively calculated, and the number of beam closing times of each user is counted in the process of calculating the parameters A and b k,q  when the overall system rate is the maximum; 
         [0027]    the overall system rate R composed of Q cells is calculated according to the following formula: 
         [0000]        R=Σ   q=1   Q Σ k=1   K  log 2 (1+ a   k,q   SINR   k,m,q );
 
         [0028]    where, K is the number of carriers in the cell q; 
         [0029]    SINR k,m,q  is the SINR of the user m in a block fading scenario on the carrier k in the cell q; 
         [0030]    when a k,q  is equal to 1, the carrier kin the cell q is allocated to the user m; when a k,q  is equal to 0, the carrier k in the cell q is not allocated to the user m. 
         [0031]    In an embodiment, in the above method, the frequency reuse criterion is: 
         [0032]    selecting the user with the maximum Fractional Frequency Reuse (FFR) in the FFRs of all users in the set time as the alternative user. 
         [0033]    In an embodiment, in the above method, the FFR of the user is calculated according to the following formula: 
         [0000]    
       
      
       FFR=FFR 
       1 
       ·P 
       1 
       +FFR 
       2 
       ·P 
       2 
       +FFR 
       3 
       ·P 
       3 
       + . . . +FFR 
       Q 
       ·P 
       Q  
      
     
         [0034]    where, FFR 1 =⅓, FFR 2 =⅔, FFR 3 =1, and FFR Q =1/Q; 
         [0035]    and P 1 , P 2 , . . . P Q  are weighting coefficients. 
         [0036]    The disclosure also discloses a device for selecting a heterogeneous network serving cell based on inter-cell cooperation, which includes: 
         [0037]    an alternative user selecting module, which is configured to obtain the alternative users in each cell in the heterogeneous network, and select an alternative user in the entire network from the alternative users in all cells in the heterogeneous network according to the pre-set alternative user selection criterion; and 
         [0038]    a cell reselecting module, which is configured to, if the alternative user in the entire network needs to perform the reselection operation, initiate the cell reselection flow. 
         [0039]    In an embodiment, in the above device, the alternative user selection criterion includes one or more of the followings: 
         [0040]    the system rate maximizing criterion, the degree of freedom restoring criterion, and the frequency reuse criterion. 
         [0041]    In an embodiment, in the above device, the system rate maximizing criterion is: 
         [0042]    selecting the user with the maximum rate ratio R m (q)/R m (j) in the rate ratios R m (q)/R m (j) of cell reselection of all users as the alternative user, and R m (q) is the rate obtained in the reselected cell by the user m, and R m (j) is the rate obtained in the current serving cell j by the user m. 
         [0043]    In an embodiment, in the above device, the alternative user selecting module is configured to: 
         [0044]    calculate R m (q) and R m (j) respectively, so as to obtain the rate ratio R m (q)/R m (j) of cell reselection of the users; 
         [0045]    the rate obtained in each cell by each user is determined according to the following formula: 
         [0000]    
       
         
           
             
               
                 R 
                 m 
               
                
               
                 ( 
                 
                   q 
                   * 
                 
                 ) 
               
             
             = 
             
               
                 ∑ 
                 
                   k 
                   ⋐ 
                   K 
                 
               
                
               
                   
               
                
               
                 
                   
                     G 
                      
                     
                       ( 
                       
                         y 
                         
                           
                             q 
                             * 
                           
                           , 
                           k 
                         
                       
                       ) 
                     
                   
                    
                   
                     E 
                      
                     
                       ( 
                       
                         R 
                         
                           k 
                           , 
                           m 
                           , 
                           
                             q 
                             * 
                           
                         
                       
                       ) 
                     
                   
                 
                 
                   y 
                   
                     
                       q 
                       * 
                     
                     , 
                     k 
                   
                 
               
             
           
         
       
     
         [0046]    where, R m (q*) is the rate obtained in the cell q* by the user m; 
         [0047]    E(R k,m,q* ) is the mathematical expectation of R k,m,q* , R k,m,q*  is the instantaneous average maximum data rate that the user m can realize on the carrier k of the cell q*, and K is the total number of carriers in the cell q*; y q*,k =Σ m⊂M x m,q*  is the number of users accessing the cell q*; when x m,q*  is equal to 1, q* is the serving cell of the user m; when x m,q*  is equal to 0, q* is not the serving cell of the user m; M is the total number of users supported by the cell q*; 
         [0000]    
       
         
           
             
               G 
                
               
                 ( 
                 
                   y 
                   
                     
                       q 
                       * 
                     
                     , 
                     k 
                   
                 
                 ) 
               
             
             = 
             
               
                 ∑ 
                 
                   m 
                   = 
                   1 
                 
                 
                   y 
                   
                     
                       q 
                       * 
                     
                     , 
                     k 
                   
                 
               
                
               
                   
               
                
               
                 1 
                 m 
               
             
           
         
       
     
         [0000]    is the diversity gain of multiple users. 
         [0048]    In an embodiment, in the above device, the degree of freedom restoring criterion is: 
         [0049]    in the spatial beam joint selection algorithm in the set time, selecting the user with the maximum number of beam closing times in the numbers of beam closing times of all users as the alternative user. 
         [0050]    In an embodiment, in the above device, the alternative user selecting module is configured to determine the number of beam closing times of the user in the spatial beam joint selection algorithm in the set time, including that: 
         [0051]    the parameters A and b k,q  when the overall system rate is the maximum are iteratively calculated, and the number of beam closing times of each user is counted in the process of calculating the parameters A and b k,q  when the overall system rate is the maximum; 
         [0052]    the overall system rate R composed of Q cells is calculated according to the following formula: 
         [0000]        R=Σ   q=1   Q Σ k=1   K  log 2 (1+ a   k,q   SINR   k,m,q );
 
         [0000]    where, K is the number of carriers in the cell q; 
         [0053]    SINR k,m,q  is the SINR of the user m in a block fading scenario on the carrier k in the cell q; 
         [0054]    when a k,q  is equal to 1, the carrier kin the cell q is allocated to the user m; when a k,q  is equal to 0, the carrier k in the cell q is not allocated to the user m. 
         [0055]    In an embodiment, in the above device, the frequency reuse criterion is: 
         [0056]    selecting the user with the maximum FFR in the FFRs of all users in the set time as the alternative user. 
         [0057]    In an embodiment, in the above device, the alternative user selecting module is configured to calculate the FFR of the user according to the following formula: 
         [0000]        FFR=FFR   1   ·P   1   +FFR   2   ·P   2   +FFR   3   ·P   3   + . . . +FFR   Q   ·P   Q ; 
         [0058]    where, FFR 1 =⅓, FFR 2 =⅔, FFR 3 =1, and FFR Q =1/Q; 
         [0059]    and P 1 , P 2 , . . . P Q  are weighting coefficients. 
         [0060]    In an embodiment, the device further includes: 
         [0061]    a reporting module, which is configured to, when the device is a cooperation cell base station in the heterogeneous network, select in this cell the alternative users in a cell according to the pre-set alternative user selection criterion, and report the selected alternative users in the cell to the central node base station. 
         [0062]    The disclosure also provides a computer readable medium, in which a computer program is stored; the computer program includes a program instruction; when the program instruction is executed by a base station device, the device performs the method for selecting a heterogeneous network serving cell based on inter-cell cooperation. 
         [0063]    The technical solution of the disclosure considers cell selection and interference management jointly, so that the complexity of an interference management algorithm is reduced, and the effectiveness of interference management is improved, thereby increasing the system capacity of a lower-power node. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0064]      FIG. 1  is a schematic diagram of a heterogeneous network; 
           [0065]      FIG. 2( a )  is an implementation block diagram of a central node base station for selecting a heterogeneous network serving cell based on inter-cell cooperation according to an embodiment of the disclosure; 
           [0066]      FIG. 2( b )  is an implementation block diagram of a cooperation base station i for selecting a heterogeneous network serving cell based on inter-cell cooperation according to an embodiment of the disclosure; 
           [0067]      FIG. 2( c )  is an implementation block diagram of a cooperation base station j for selecting a heterogeneous network serving cell based on inter-cell cooperation according to an embodiment of the disclosure; 
           [0068]      FIG. 3  is a flowchart of selecting a heterogeneous network serving cell based on inter-cell cooperation according to an embodiment of the disclosure; 
           [0069]      FIG. 4  is a flowchart of performing a cell selection algorithm based on inter-cell cooperation according to another embodiment of the disclosure; and 
           [0070]      FIG. 5  is a block diagram of a device for selecting a heterogeneous network serving cell based on inter-cell cooperation according to an embodiment of the disclosure. 
       
    
    
     DETAILED DESCRIPTION 
       [0071]    The technical solution of the disclosure is elaborated below with reference to the accompanying drawings. It should be noted that, the embodiments of the disclosure and the characteristics in the embodiments can be combined under the condition of no conflicts. 
       Embodiment 1 
       [0072]    The inventor of the application finds that the prior art mainly has the following disadvantages. 
         [0073]    On an aspect, a large number of edge users emerge because of the introduction of low-power nodes; all the existing methods for selecting a cell are presented based on the signal intensity (an RE algorithm) or interference (a path loss method). But at the cell edge, the SINR influences the selection of users greatly. 
         [0074]    On the other aspect, the low-power nodes introduced in the heterogeneous network adopts a multi-antenna technology; if the interference of an adjacent cell and spatial information are considered while selecting a serving cell, a better cell split gain can be obtained; but all the existing methods do not consider these factors. 
         [0075]    So, in view of the above disadvantages, the inventor of the application puts forward that the serving cell of the edge users can be dynamically selected by a Dynamic Cell Selection (DCS) technology, and the number of users is increased by a cell diversity gain; besides, cell selection and interference management are considered jointly, so that the complexity of the interference management algorithm is reduced, and the effectiveness of interference management is improved, thereby increasing the system capacity of the lower-power node. 
         [0076]    Based on the above idea, the present embodiment provides a method for selecting a heterogeneous network serving cell based on inter-cell cooperation. The heterogeneous network is composed of a macro base station and several low-power base stations under the coverage of the macro base station, such as a femtocell and a pico-cell. The carriers aggregated in the base station include CC 1 , CC 2 , . . . CC k . The method mainly includes that: 
         [0077]    a central node base station in the heterogeneous network obtains alternative users in each cell in the heterogeneous network, and selects an alternative user in the entire network from the alternative users in all cells in the heterogeneous network according to a pre-set alternative user selection criterion; and 
         [0078]    if the alternative user in the entire network needs to perform a reselection operation, a cell reselection flow is initiated. 
         [0079]    The process that the central node base station obtains the alternative users in each cell in the heterogeneous network is that: each cell base station in the heterogeneous network selects in this cell the alternative users in a cell according to the pre-set alternative user selection criterion, and reports the selected alternative users in the cell to the central node base station. 
         [0080]    The alternative user selection criterion on which the central node base station and each cell base station are based at least includes one or more of the followings: 
         [0081]    a system rate maximizing criterion, a degree of freedom restoring criterion, and a frequency reuse criterion. 
         [0082]    In the embodiment, the system rate maximizing criterion is: selecting the user with the maximum rate ratio R m (q)/R m (j) in the rate ratios R m (q)/R m (j) of cell reselection of all users as the alternative user, and here R m (q) is the rate obtained in the reselected cell q by the user m, and R m (j) is the rate obtained in the current serving cell j by the user m. it should be noted that, the rate obtained by the user in each cell and involved in the present embodiment is an average rate value during a given time period. 
         [0083]    Specifically, the process of determining the ratio R m (q)/R m (j) of cell reselection of each user is as follows: 
         [0084]    supposing there are M users in the system, and the rate obtained in the cell q* by the user m is: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       R 
                       m 
                     
                      
                     
                       ( 
                       
                         q 
                         * 
                       
                       ) 
                     
                   
                   = 
                   
                     
                       ∑ 
                       
                         k 
                         ⋐ 
                         K 
                       
                     
                      
                     
                         
                     
                      
                     
                       
                         
                           G 
                            
                           
                             ( 
                             
                               y 
                               
                                 
                                   q 
                                   * 
                                 
                                 , 
                                 k 
                               
                             
                             ) 
                           
                         
                          
                         
                           E 
                            
                           
                             ( 
                             
                               R 
                               
                                 k 
                                 , 
                                 m 
                                 , 
                                 
                                   q 
                                   * 
                                 
                               
                             
                             ) 
                           
                         
                       
                       
                         y 
                         
                           
                             q 
                             * 
                           
                           , 
                           k 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   1 
                   ) 
                 
               
             
           
         
       
     
         [0085]    where, M is the total number of users supported by the cell q*; 
         [0086]    E(R k,m,q* ) is the mathematical expectation of R k,m,q* , R k,m,q*  is the instantaneous average maximum data rate that the user m can realize on the carrier k of the cell q*, and K is the total number of carriers in the cell q*; y q*,k =Σ m⊂M x m,q*  is the number of users accessing the cell q*; when x m,q*  is equal to 1, q* is the serving cell of the user m; when x m,q*  is equal to 0, q* is not the serving cell of the user m; 
         [0000]    
       
         
           
             
               G 
                
               
                 ( 
                 
                   y 
                   
                     
                       q 
                       * 
                     
                     , 
                     k 
                   
                 
                 ) 
               
             
             = 
             
               
                 ∑ 
                 
                   m 
                   = 
                   1 
                 
                 
                   y 
                   
                     
                       q 
                       * 
                     
                     , 
                     k 
                   
                 
               
                
               
                   
               
                
               
                 1 
                 m 
               
             
           
         
       
     
         [0000]    is a diversity gain of multiple users, which depends on the number of users competing for the same resource. 
         [0087]    When the rate R m (q*) obtained in the cell q* by the user m is calculated in the above formula, a calculation mode of weighted rate is adopted. 
         [0088]    In the present embodiment, the degree of freedom restoring criterion is: counting the numbers of beam closing times of all users in a spatial beam joint selection algorithm within the set time, and selecting the user with the maximum number of beam closing times as the alternative user. 
         [0089]    It is supposed that the system is a downlink link of M users and K carriers, each the base station and each user respectively has N transmitting antennae and a receiving antenna, and the transmitted power on each carrier of each cell remains unchanged. A binary matrix A={a k,m |a k,m ⊂{0,1}} K×M  is used for describing the carrier selection between users. When a k,m  is equal to 1, the carrier k is allocated to the user m; or else, a k,m  is equal to 0. 
         [0090]    S k,m,i =h k,m,i =b k,i  is used for representing a channel gain in a certain time slot, h k,m,i =[h 1   k,m,i , h 2   k,m,i , . . . h N   k,m,i ] is used for representing a channel, and b k,j εC N×1  is used for representing a beam forming matrix; if it is a block fading scenario, the SINR is: 
         [0000]    
       
         
           
             
               
                 
                   
                     SINR 
                     
                       k 
                       , 
                       m 
                       , 
                       q 
                     
                   
                   = 
                   
                     
                       
                         P 
                         q 
                       
                        
                       
                         
                            
                           
                             
                               h 
                               
                                 k 
                                 , 
                                 m 
                                 , 
                                 q 
                               
                             
                              
                             
                               b 
                               
                                 k 
                                 , 
                                 q 
                               
                             
                           
                            
                         
                         2 
                       
                     
                     
                       
                         
                           ∑ 
                           
                             
                               i 
                               = 
                               1 
                             
                             , 
                             
                               i 
                               ≠ 
                               q 
                             
                           
                           N 
                         
                          
                         
                             
                         
                          
                         
                           
                             a 
                             
                               k 
                               , 
                               i 
                             
                           
                            
                           
                             P 
                             i 
                           
                            
                           
                             
                                
                               
                                 
                                   h 
                                   
                                     k 
                                     , 
                                     m 
                                     , 
                                     i 
                                   
                                 
                                  
                                 
                                   b 
                                   
                                     k 
                                     , 
                                     i 
                                   
                                 
                               
                                
                             
                             2 
                           
                         
                       
                       + 
                       
                         σ 
                         q 
                         2 
                       
                     
                   
                 
               
               
                 
                   ( 
                   2 
                   ) 
                 
               
             
           
         
       
     
         [0091]    If the rate of the mth user is defined as: 
         [0000]        R   m,q =Σ k=1   K  log 2 (1+ SINR   k,m,q )=Σ k=1   K   R   k,m,q   (3),
 
         [0092]    then the overall system rate composed of Q cells is: 
         [0000]    
       
         
           
             
               
                 
                   
                     R 
                     = 
                     
                       
                         
                           ∑ 
                           
                             q 
                             = 
                             1 
                           
                           Q 
                         
                          
                         
                             
                         
                          
                         
                           
                             ∑ 
                             
                               k 
                               = 
                               1 
                             
                             K 
                           
                            
                           
                             
                               log 
                               2 
                             
                             ( 
                             
                               1 
                               + 
                               
                                 
                                   
                                     a 
                                     
                                       k 
                                       , 
                                       q 
                                     
                                   
                                    
                                   
                                     P 
                                     q 
                                   
                                    
                                   
                                     
                                        
                                       
                                         
                                           h 
                                           
                                             k 
                                             , 
                                             q 
                                             , 
                                             q 
                                           
                                         
                                          
                                         
                                           b 
                                           
                                             k 
                                             , 
                                             q 
                                           
                                         
                                       
                                        
                                     
                                     2 
                                   
                                 
                                 
                                   
                                     
                                       ∑ 
                                       
                                         
                                           i 
                                           = 
                                           1 
                                         
                                         , 
                                         
                                           i 
                                           ≠ 
                                           q 
                                         
                                       
                                       N 
                                     
                                      
                                     
                                         
                                     
                                      
                                     
                                       
                                         a 
                                         
                                           k 
                                           , 
                                           i 
                                         
                                       
                                        
                                       
                                         P 
                                         i 
                                       
                                        
                                       
                                         
                                            
                                           
                                             
                                               h 
                                               
                                                 k 
                                                 , 
                                                 q 
                                                 , 
                                                 i 
                                               
                                             
                                              
                                             
                                               b 
                                               
                                                 k 
                                                 , 
                                                 i 
                                               
                                             
                                           
                                            
                                         
                                         2 
                                       
                                     
                                   
                                   + 
                                   
                                     σ 
                                     q 
                                     2 
                                   
                                 
                               
                             
                             ) 
                           
                         
                       
                       = 
                       
                         
                           ∑ 
                           
                             q 
                             = 
                             1 
                           
                           Q 
                         
                          
                         
                             
                         
                          
                         
                           
                             ∑ 
                             
                               k 
                               = 
                               1 
                             
                             K 
                           
                            
                           
                             
                               log 
                               2 
                             
                              
                             
                               ( 
                               
                                 1 
                                 + 
                                 
                                   
                                     a 
                                     
                                       k 
                                       , 
                                       q 
                                     
                                   
                                    
                                   
                                     SINR 
                                     
                                       k 
                                       , 
                                       m 
                                       , 
                                       q 
                                     
                                   
                                 
                               
                               ) 
                             
                           
                         
                       
                     
                   
                   , 
                 
               
               
                 
                   ( 
                   4 
                   ) 
                 
               
             
           
         
       
     
         [0093]    where, i is the adjacent cell except the cell q, i is equal to 1, 2, . . . , Q, but i is not equal to q; 
         [0094]    for finding the proper A and b k,q , an alternately iterating method is adopted, which includes that: supposing that b k,q  is known, it is tried to close a certain carrier, that is, a k,m  is set to 0, so as to maximize the overall system rate to obtain the new A; then, the new b k,q  is solved based on the new A, where b k,q  represents a beam precoding vector on the carrier k of the user in the cell q. In the present embodiment, the frequency reuse criterion is: counting the FFRs of all users in a carrier beam joint selection algorithm within the set time, and selecting the user with the maximum FFR as the alternative user. 
         [0095]    Note that, there may be multiple users in each cell, but there is only one user performing data transmission in the cell at any time, then, for any user m, a k,m  is equal to a k,q ; that is, there is no need to differentiate the user m and the cell q in the subscripts of the parameters. 
         [0096]    Specifically, the average FFR is defined as: 
         [0000]        FFR=FFR   1   ·P   1   +FFR   2   ·P   2   +FFR   3   ·P   3   + . . . +FFR   Q   ·P   Q   (5)
 
         [0097]    where, FFR 1 =⅓, FFR 2 =⅔, FFR 3 =1, and FFR Q =1/Q; and P 1 , P 2 , . . . P Q  are weighting coefficients. 
         [0098]    Besides, in the above method, when a carrier beam of joint cell is selected, and the user satisfies a closing criterion, the transmission of carrier will be closed; the selection criterion  1  is: the user has the minimum SINR on the carrier compared with the cooperative scheduling user on the carrier; at the same time, the user is suffered from the maximum interference; 
         [0099]    in the above method, when the carrier beam of joint cell is selected, and the user satisfies the closing criterion, the transmission of carrier will be closed; the selection criterion  2  is: the user has the minimum SINR on the carrier compared with the cooperative scheduling user on the carrier, at the same time, the user is suffered from the interference which is greater than a noise value; 
         [0100]    in the above method, when the carrier beam of joint cell is selected, the FFR weight is equal to the number of users not closed on the carrier/the total number of cooperative scheduling users on the carrier. 
         [0101]    In the above method, when the cell reselection is performed, judgement can be performed according to a weighted average rate criterion. 
         [0102]    Specifically, the cell reselection criterion based on the weighted average rate includes the following two steps: 
         [0103]    Step 1: R m* (q)/R m* (j) of the user is calculated, where j is the original serving cell, and q is the other cell; 
         [0104]    Step 2: if the user m* selects q*, the corresponding R m* (q*)/R m* (j) is greater than a threshold R_th, namely: 
         [0000]        R   m* ( q )/ R   m* ( j )&gt; R _ th   (6)
 
         [0105]    and the number of users in the cell is fewer than U m , then the user m* changes the serving cell from j to q*; 
         [0106]    Step 3: the cell and the serving cell q* update their own service user sets respectively. 
         [0107]    The specific implementation of the above method is elaborated below by taking the LTE-A system for example. 
         [0108]    As shown in  FIG. 1 , the heterogeneous network is composed of a macro-cell and two pico-cells. The radius of the macro-cell is 500 m, and the power is 43 dBm. The two pico-cells are under the coverage of the macro-cell. The macro-cell is set as the cell  1 , and the two pico-cells are set as the cell  2  and the cell  3 . The bandwidths of all the base stations are formed by aggregating two carriers. It is supposed that there are three cells and 40 users. 
         [0109]      FIG. 2  is an implementation block diagram based on the present embodiment, which is split into the following two layers: 
         [0110]    the cooperation base station, for example, the base station i (as shown in  FIG. 2 b   ) and the base station j (as shown in  FIG. 2 c   ), and 
         [0111]    the central node base station (as shown in  FIG. 2 a   ), which can be any base station, for example, the macro-cell base station. 
         [0112]    An independent fair scheduler (a PF scheduler) and carrier selection run on the cooperation base stations; the fair scheduler calculates a user scheduling priority according to the instantaneous average rate and the historical average rate of the user in the home base station of the user, then decides to schedule the user according to the priority sequence, finally schedules, based on an output result of a central node, the user on the selected carrier according to a jointly designed beam vector. 
         [0113]    First of all, the central node base station runs the joint cell carrier selection algorithm, the beam selection algorithm, and the cell selection algorithm; 
         [0114]    for performing each above algorithm operation, the central node base station can receive a measurement result of each base station, for example, a channel matrix from each user to each cell; 
         [0115]    secondly, the central node base station runs the joint cell carrier selection algorithm and the beam selection algorithm, jointly decides the carrier selection vector of each user, and jointly designs the beam vector of each user; 
         [0116]    thirdly, the central node base station selects, based on the output results of the joint cell carrier selection algorithm and the beam selection algorithm in a certain period of time or parameter statistics, an alternative user in the entire network according to the alternative user selection criterion; 
         [0117]    finally, the central node base station decides, according to the reselection criterion, whether the alternative user performs the reselection operation, and initiates the cell reselection flow. 
         [0118]      FIG. 3  is a flowchart of selecting a heterogeneous network serving cell based on inter-cell cooperation according to an embodiment of the disclosure.  FIG. 3  shows the implementation process of the above method. 
         [0119]    In the LTE, a system message is carried in an SIB message of a broadcast channel SBCH. It is supposed that the cell  1  is the base station where the central node is. The central node base station determines the cells  1 ,  2  and  3  are the cooperation cells, so they form a measurement cell set; the cells  1 ,  2  and  3  are broadcasted in this cell through the SIB message extension (namely the measurement cell set is redefined in the SIB message of the LTE). The user UE 1  can obtain the measurement cell set, namely the cells  1 ,  2  and  3 , by reading the SIB message. 
         [0120]    A measurement configuration of the UE 1  to the cells  1 ,  2  and  3  is realized through Measurement configuration IE in the RRCConnectionReconfiguration message, and the measurement configuration message Measurement configuration IE is formed by extending the original message IE of the LTE system. 
         [0121]    The user UE 1  completes the measurement of parameters, such as RSRP and Reference Signal Received Quality (RSRQ), required by a cell set (the cells  1 ,  2  and  3 ) algorithm, and the measurement of channel matrix according to the measurement configuration by using a public pilot symbol of each of the cells  1 ,  2  and  3 . 
         [0122]    The cell  2  and the cell  3  report the measurement results of their own cell users to the cell  1 . 
         [0123]    The cell  1  collects the measurement values of all users aiming at the cell set (the cells  1 ,  2  and  3 ). 
         [0124]    The cell  1  calculates the carrier selection vector and the beam selection vector of the user, and informs each cell; then, the PF scheduler of each cell schedules the user in turn; 
         [0125]    the cell  1  counts the parameters according to the process of calculating the carrier selection vector and the beam selection vector, and selects the alternative user from all users in the 3 cells according to the alternative user selection criterion; if the user UE 1  is the alternative user, the cell reselecting module judges whether the UE 1  satisfies the reselection criterion; 
         [0126]    the cell  1  calculates, based on the reselection criterion, the cell reselection result of the UE 1  according to the reselection algorithm; if the target cell is the cell  3 , the selection result is informed to all the cells (the cells  1 ,  2  and  3 ). 
         [0127]    all the cells (the cells  1 ,  2  and  3 ) respectively inform the selection result to each user in them; and 
         [0128]    the user UE 1  enters the cell reselection flow. 
         [0129]      FIG. 4  is a flowchart of performing a cell selection algorithm based on inter-cell cooperation according to another embodiment of the disclosure.  FIG. 4  shows the flowchart of performing the cell selection algorithm in the above method. 
         [0130]    The algorithm mainly includes three parts, namely pre-allocation, user cell selection and reselection. The pre-allocation includes Step 1 and Step 2 in  FIG. 4 . The pre-allocation mainly provides an initial value for the subsequent cell selection algorithm. So, the cell  1  first collects channel measurement values of all users, and then finds for each user the cell with the maximum equivalent rate {circumflex over (R)} b,k,i , and pre-allocates it to the user as the serving cell; the cell  1  counts the number of pre-allocated users of each cell and the parameters based on the pre-allocated serving cell; finally, the cell  1  informs each cell of the initial value of the cell selection, the user channels of other cells, and the number of users of each cell, for example, the cell  1  informs the cell  2  the initial value of the cell selection, and the channel values from the user of the cell  2  to the cell  1  and the cell  3 . 
         [0131]    If the initial value of the cell selection is [20 12 8], that is, there are 20 users in the cell  1 , there are 12 users in the cell  2 , and there are 8 users in the cell  3 , in the user cell selection part of the algorithm, the user of each cell calculates the equivalent rate from him to the three cells, and reports the ratio of the maximum equivalent rate of the other cells to the equivalent rate of this cell to the serving cell; the serving cell  1  first queues 20×1 (20 users, and each user corresponds to an alternative cell) equivalent rates in descending order. In the user cell selection process, the user at the starting position of the queue is selected, and the user and his rate ratio are reported to the central node. 
         [0132]    In the reselection step, the central node first queues the rate ratios of the alternative users in the three cells, then selects the first user in the queue, and finally performs cell reselection criterion verification to the user; it is supposed that the user and the base station corresponding to the first maximum value in the queue are m and q′ respectively, first it is verified whether the formulae (1 to 6) are satisfied; if so, the user m is allocated to the base station q′, at the same time, Q hm  of the base station q′ is updated, and it is set that the user has been reselected; or else, the algorithm ends. 
         [0133]    The last process is a post process, which is intended to inform a service base station of the user of the serving cell which is determined according to the above selection algorithm; then the user initiates the cell reselection flow. 
         [0134]    After the above three processes, all users complete a process of updating cooperative selection of a cell. 
       Embodiment 2 
       [0135]      FIG. 5  is a block diagram of a device for selecting a heterogeneous network serving cell based on inter-cell cooperation according to an embodiment of the disclosure. The present embodiment provides a device for selecting a heterogeneous network serving cell based on inter-cell cooperation, which is a base station device. The base station, which can implement the method in embodiment 1, includes a processor, a program storage device and a data storage device. The device mainly includes the following modules: 
         [0136]    an alternative user selecting module, which is configured to, when the device is the central node base station in the heterogeneous network, obtain the alternative users in each cell in the heterogeneous network, and select an alternative user in the entire network from the alternative users in all cells in the heterogeneous network according to the pre-set alternative user selection criterion; and 
         [0137]    a cell reselecting module, which is configured to, if the alternative user in the entire network needs to perform the reselection operation, initiate the cell reselection flow. 
         [0138]    In addition, the device may also serve as the cooperation cell base station in the heterogeneous network; so, the device may also include a reporting module, which is configured to, when the device is the cooperation cell base station in the heterogeneous network, select in this cell the alternative users in a cell according to the pre-set alternative user selection criterion, and report the selected alternative users in the cell to the central node base station. 
         [0139]    The alternative user selection criterion involved in the present embodiment includes one or more of the followings: 
         [0140]    the system rate maximizing criterion, the degree of freedom restoring criterion, and the frequency reuse criterion. 
         [0141]    The system rate maximizing criterion is: selecting the user with the maximum rate ratio R m (q)/R m (j) in the rate ratios R m (q)/R m (j) of cell reselection of all users as the alternative user, and R m (q) is the rate obtained in the reselected cell by the user m, and R m (j) is the rate obtained in the current serving cell j by the user m. 
         [0142]    Specifically, the rate ratio R m (q)/R m (j) of cell reselection of the user can be determined according to the following process: 
         [0143]    calculating R m (q) and R m (j) respectively, so as to obtain the rate ratio R m (q)/R m (j) of cell reselection of the users; 
         [0144]    The rate obtained in each cell by each user is determined according to the following formula: 
         [0000]    
       
         
           
             
               
                 R 
                 m 
               
                
               
                 ( 
                 
                   q 
                   * 
                 
                 ) 
               
             
             = 
             
               
                 ∑ 
                 
                   k 
                   ⋐ 
                   K 
                 
               
                
               
                   
               
                
               
                 
                   
                     G 
                      
                     
                       ( 
                       
                         y 
                         
                           
                             q 
                             * 
                           
                           , 
                           k 
                         
                       
                       ) 
                     
                   
                    
                   
                     E 
                      
                     
                       ( 
                       
                         R 
                         
                           k 
                           , 
                           m 
                           , 
                           
                             q 
                             * 
                           
                         
                       
                       ) 
                     
                   
                 
                 
                   y 
                   
                     
                       q 
                       * 
                     
                     , 
                     k 
                   
                 
               
             
           
         
       
     
         [0145]    where, R m (q*) is the rate obtained in the cell q* by the user m, and M is the total number of users supported by the cell q*; 
         [0146]    E(R k,m,q* ) is the mathematical expectation of R k,m,q* , R k,m,q*  is the instantaneous average maximum data rate that the user m can realize on the carrier k of the cell q*, and K is the total number of carriers in the cell q*; y q*,k =Σ m⊂M x m,q*  is the number of users accessing the cell q*; when x m,q*  is equal to 1, q* is the serving cell of the user m; when x m,q*  is equal to 0, q* is not the serving cell of the user m; 
         [0000]    
       
         
           
             
               G 
                
               
                 ( 
                 
                   y 
                   
                     
                       q 
                       * 
                     
                     , 
                     k 
                   
                 
                 ) 
               
             
             = 
             
               
                 ∑ 
                 
                   m 
                   = 
                   1 
                 
                 
                   y 
                   
                     
                       q 
                       * 
                     
                     , 
                     k 
                   
                 
               
                
               
                   
               
                
               
                 1 
                 m 
               
             
           
         
       
     
         [0000]    is the diversity gain of multiple users. 
         [0147]    The degree of freedom restoring criterion is: in the spatial beam joint selection algorithm in the set time, selecting the user with the maximum number of beam closing times in the numbers of beam closing times of all users as the alternative user. 
         [0148]    Specifically, when the numbers of beam closing times of all users are determined in the spatial beam joint selection algorithm in the set time, the parameters A and b k,q  when the overall system rate is the maximum are iteratively calculated, and the number of beam closing times of each user is counted in the process of calculating the parameters A and b k,q  when the overall system rate is the maximum; 
         [0149]    the overall system rate R composed of Q cells is calculated according to the following formula: 
         [0000]        R=Σ   q=1   Q Σ k=1   K  log 2 (1+ a   k,q   SINR   k,m,q );
 
         [0150]    where, K is the number of carriers in the cell q, SINR k,m,q  is the SINR of the user m in the block fading scenario on the carrier k in the cell q; a k,m  is obtained through A={a k,m |a k,m ⊂{0,1}} K×M ; when a k,m  is equal to 1, the carrier k is allocated to the user m; when a k,m  is equal to 0, the carrier k is not allocated to the user m. Note that, there may be multiple users in each cell, but there is only one user performing data transmission in the cell at any time, then, for any user m, a k,m  is equal to a k,q ; that is, there is no need to differentiate the user m and the cell q in the subscripts of the parameters. 
         [0151]    The frequency reuse criterion is: selecting the user with the maximum FFR in the FFRs of all users in the set time as the alternative user. 
         [0152]    Specifically, the FFR of the user can be calculated according to the following formula: 
         [0000]    
       
      
       FFR=FFR 
       1 
       ·P 
       1 
       +FFR 
       2 
       ·P 
       2 
       +FFR 
       3 
       ·P 
       3 
       + . . . +FFR 
       Q 
       ·P 
       Q  
      
     
         [0153]    where, FFR 1 =⅓, FFR 2 =⅔, FFR 3 =1, and FFR Q =1/Q; 
         [0154]    and P 1 , P 2 , . . . P Q  are weighting coefficients. 
         [0155]    Because the above device can implement the method in embodiment 1, the detailed implementation mode of the device can refer to the corresponding description of the embodiment 1, and will not be elaborated here. 
         [0156]    Those ordinary skilled in the art may understand that all or part of the steps in the method can be performed by related hardware instructed through a program; the program may be stored in computer readable storage media, such as a read-only memory, a magnetic disk or a compact disk. Optionally, all or part of the steps of the embodiment may also be implemented by using one or multiple integrated circuits. Correspondingly, each module/unit in the embodiment may be implemented in the form of hardware or in the form of software function module. The disclosure is not limited to any particular combination of hardware and software. 
         [0157]    The above is only the preferred embodiments of the disclosure and not intended to limit the disclosure. Any modifications, equivalent replacements, improvements and the like within the spirit and principle of the disclosure shall fall within the scope of protection of the disclosure. 
       INDUSTRIAL APPLICABILITY 
       [0158]    The technical solution of the disclosure considers cell selection and interference management jointly, so that the complexity of an interference management algorithm is reduced, and the effectiveness of interference management is improved, thereby increasing the system capacity of a lower-power node.