Abstract:
Disclosed are an access method and device in a heterogeneous network for solving the problem that, in network selection of a heterogeneous wireless network, a user can only enjoy at any one time the service of one network and cannot simultaneously enjoy the services of different networks, the method comprising: dividing access points capable of providing a service for a user equipment (UE) into at least one competition group; and determining the access overhead of the competition group, and selecting for the UE, according to the determined access overhead of the competition group, a target competition group from the competition groups for accessing. A network multi-path routing and traffic distribution model is established, such that the UE can select different access methods, thus providing a new traffic operation mode for network development.

Description:
[0001]    This application claims the benefit and priority of Chinese Patent Application No. 201410389810.0, filed with the Chinese Patent Office on Aug. 8, 2014 and entitled “An accessing method and apparatus in a heterogeneous network”, which is hereby incorporated by reference in its entirety. 
       FIELD 
       [0002]    The present invention relates to the field of communications, and particularly to an accessing method and apparatus in a heterogeneous network. 
       BACKGROUND 
       [0003]    As new Radio Access Technologies (RATs), e.g., the cellular network radio technology, the Wireless Fidelity (WiFi) access technology, etc., are constantly emerging, such a wireless communication network setup has emerged that there are a number of radio access technologies coexisting. At present, there are a number of network operators serving their users, and from the perspective of the users, there are separate market shares of the network operators due to their monopolized and exclusive market shares, and the uni-mode characteristic of user equipments. As multimode user equipments are emerging, there are overlapping market shares of the network operators for their users, and the policy of carrying a photo number from one network to another has been issued so that a market share is allowed to be transferred from one network operator to another. 
         [0004]    From the perspective of a service, only one operator is currently selected for the same service of a user, so that the operator may offload traffic of a 3G network to its own WiFi network dependent upon the traffic of the service, and the capacity of the network, but there are no different operators in a cooperative relationship for the same service, thus greatly preventing the user, particularly with a highly mobile on-vehicle user equipment, from select freely between the operators. Moreover the network operators typically enforce their fixed charging rules, so that even if there are different applicable charging modes of service packages corresponding to different services, then it may not be possible for each user to select his or her own desirable charging mode and corresponding quality of service. 
         [0005]    The future trend of the network services shall be such a dynamic pricing mode that the different operators may provide different access services concurrently for the same traffic, and compete for the traffic while they are cooperating with each other. In this way, the users can select freely their desirable ones of the operators; and the operators can compete at a finer granularity, so that the services of the operators will be further improved, and the operators can also avoid their deployments from being repeated, thus lowering their deployment costs, and also extending their shares in the market. 
         [0006]    In summary, in order to select an access network for the heterogeneous wireless network in the prior art, the most appropriate access network is selected primarily for the real demand of a user (for a service), so that the user (service) can only be served by that network at any time instead of being served concurrently by different networks, thus restricting the freedom of the user to select between the networks, which may discourage the experience of the user. 
       SUMMARY 
       [0007]    The invention discloses an accessing method and apparatus in a heterogeneous network so as to address the problem that such a network is selected for the heterogeneous wireless network that the user can only be served by that network at any time instead of being served concurrently by different networks. 
         [0008]    Some embodiments of the invention provide an accessing method in a heterogeneous network, the method includes: 
         [0009]    grouping access points, which can serve a user equipment, into at least one competing group; and 
         [0010]    determining an access overhead of the competing group, and selecting a target competing group for the accessing user equipment from the competing group according to determined access overhead. 
         [0011]    Optionally grouping the access points, which can serve the user equipment, into the at least one competing group includes: 
         [0012]    grouping the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points served by the same operator do not compete with each other, wherein respective access points served by the same operator are grouped into different competing groups; or 
         [0013]    grouping the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points which are operating with the same access technology and served by the same operator do not compete with each other, wherein respective access points which are operating with the same access technology and served by the same operator are grouped into different competing groups; or 
         [0014]    grouping the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points in a preset distance range do not compete with each other, wherein the respective access points in the preset distance range are grouped into different competing groups; or 
         [0015]    grouping the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points operating with the same access technology do not compete with each other, wherein respective access points operating with the same access technology are grouped into different competing groups; or 
         [0016]    grouping the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points where a difference between currently available access rates of each of the access points are above a preset threshold, do not compete with each other, wherein the access points where a difference between currently available access rates of each of the access points are above the preset threshold, are grouped into different competing groups; or 
         [0017]    grouping the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points, which can currently provide such access rates that a difference between each of the access rates and a preset access rate reference value lies in a preset threshold range, shall compete with each other, wherein the access points, which can currently provide such access rates that a difference between each of the access rates and the preset access rate reference value lies in the preset threshold range are grouped into the same competing group; or 
         [0018]    grouping randomly the access points, which can serve the user equipment, into the at least one competing group. 
         [0019]    Optionally before the access overhead of the competing group is determined, the method further includes: for each competing group, determining access rates to be provided for the user equipment by the respective access points in the competing group respectively, and if all the access rates currently available from the respective access points in the competing group are equal to or greater than the access rates to be provided for the user equipment by the respective access points, then determining the competing group as a pre-selected competing group; and 
         [0020]    determining the access overhead of the competing group, and selecting the target competing group for the accessing user equipment from the competing group according to the determined access overhead includes: determining an access overhead of each pre-selected competing group, and selecting the target competing group for the accessing user equipment from the pre-selected competing groups according to the determined access overheads. 
         [0021]    Furthermore the method further includes: 
         [0022]    for each competing group, if the access rate currently available from at least one access point in the competing group is less than the access rate to be provided for the user equipment by the access point, then discarding the competing group. 
         [0023]    Optionally for each competing group, determining the access rates to be provided for the user equipment by the respective access points in the competing group respectively includes: 
         [0024]    for each competing group, determining the access rates to be provided for the user equipment by the respective access points in the competing group respectively under such a principle that net gains of the respective access points in the competing group are maximized. 
         [0025]    Optionally for each competing group, the access rates to be provided for the user equipment by the respective access points in the competing group are determined respectively in the following differential gaming model: 
         [0000]    
       
         
           
             { 
             
               
                 
                   
                     
                       Max 
                        
                       
                         [ 
                         
                           
                             ∫ 
                             0 
                             ∞ 
                           
                            
                           
                             
                               { 
                               
                                 
                                   
                                     1 
                                     
                                       h 
                                       i 
                                     
                                   
                                    
                                   
                                     P 
                                      
                                     
                                       ( 
                                       s 
                                       ) 
                                     
                                   
                                    
                                   
                                     
                                       v 
                                       i 
                                     
                                      
                                     
                                       ( 
                                       s 
                                       ) 
                                     
                                   
                                 
                                 - 
                                 
                                   ( 
                                   
                                     
                                       
                                         
                                           
                                             v 
                                             i 
                                           
                                            
                                           
                                             ( 
                                             s 
                                             ) 
                                           
                                         
                                         2 
                                       
                                        
                                       
                                         b 
                                         i 
                                       
                                     
                                     + 
                                     
                                       
                                         
                                           v 
                                           i 
                                         
                                          
                                         
                                           ( 
                                           s 
                                           ) 
                                         
                                       
                                        
                                       
                                         c 
                                         i 
                                       
                                     
                                   
                                   ) 
                                 
                               
                               } 
                             
                              
                             
                               e 
                               
                                 - 
                                 rs 
                               
                             
                              
                             ds 
                           
                         
                         ] 
                       
                     
                   
                 
                 
                   
                     
                       
                         
                           P 
                           . 
                         
                          
                         
                           ( 
                           s 
                           ) 
                         
                       
                       = 
                       
                         k 
                          
                         
                           [ 
                           
                             a 
                             - 
                             
                               
                                 ∑ 
                                 
                                   i 
                                   = 
                                   1 
                                 
                                 n 
                               
                                
                               
                                 
                                   v 
                                   i 
                                 
                                  
                                 
                                   ( 
                                   s 
                                   ) 
                                 
                               
                             
                             - 
                             
                               P 
                                
                               
                                 ( 
                                 s 
                                 ) 
                               
                             
                           
                           ] 
                         
                       
                     
                   
                 
               
               ; 
             
           
         
       
     
         [0026]    wherein P(s) represents a gain of unit information of the competing group at an instance s of time; {dot over (P)}(s) represents a derivation operation on P(s); v i (s) represents an access rate to be provided for the user equipment by the i-th access point in the pre-selected competing group at the instance s of time, wherein i=1, 2, . . . , n, and n represents the number of access points in the pre-selected competing group; h i  represents the number of hops between the user equipment, and the i-th access point in the pre-selected competing group; r represents a discount rate; and v i (s) 2 b i +v i (s)c i  represents the cost of the i-th access point, wherein b i  and c i  represents preset coefficients. 
         [0027]    Further to any one of the embodiments above, determining the access overhead of the competing group includes: 
         [0028]    determining the access overhead of each competing group according to a gain of unit information of the competing group, and access rates to be provided for the user equipment by the respective access points in the competing group. 
         [0029]    Further to any one of the embodiments above, the access overhead of each competing group is determined in the equation of: 
         [0000]    
       
         
           
             
               
                 ∑ 
                 
                   i 
                   = 
                   1 
                 
                 n 
               
                
               
                 
                   ∫ 
                   0 
                   ∞ 
                 
                  
                 
                   
                     P 
                      
                     
                       ( 
                       s 
                       ) 
                     
                   
                    
                   
                     
                       v 
                       i 
                     
                      
                     
                       ( 
                       s 
                       ) 
                     
                   
                    
                   ds 
                 
               
             
             ; 
           
         
       
     
         [0030]    wherein P(s) represents a gain of unit information of the competing group at an instance s of time; and v i (s) represents an access rate available from the i-th access point in the competing group at the instance s of time, wherein i=1, 2, . . . , n, and n represents the number of access points in the competing group. 
         [0031]    Further to any one of the embodiments above, selecting the target competing group for the accessing user equipment from the competing group according to the determined access overhead further includes: 
         [0032]    selecting the target competing group for the accessing user equipment from the competing group according to a demand of the user equipment for a network quality of an access network. 
         [0033]    Some embodiments of the invention provide an accessing apparatus in a heterogeneous network, the apparatus includes: 
         [0034]    a grouping module configured to group access points, which can serve a user equipment, into at least one competing group; and 
         [0035]    a processing module configured to determine an access overhead of the competing group, and to select a target competing group for the accessing user equipment from the competing group according to determined access overhead. 
         [0036]    Optionally the grouping module is configured: 
         [0037]    to group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points served by the same operator do not compete with each other, wherein respective access points served by the same operator are grouped into different competing groups; or 
         [0038]    to group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points which are operating with the same access technology and served by the same operator do not compete with each other, wherein respective access points which are operating with the same access technology and served by the same operator are grouped into different competing groups; or 
         [0039]    to group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points in a preset distance range do not compete with each other, wherein the respective access points in the preset distance range are grouped into different competing groups; or 
         [0040]    to group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points operating with the same access technology do not compete with each other, wherein respective access points operating with the same access technology are grouped into different competing groups; or 
         [0041]    to group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points where a difference between currently available access rates of each of the access points are above a preset threshold, do not compete with each other, wherein the access points where a difference between currently available access rates of each of the access points are above the preset threshold, are grouped into different competing groups; or 
         [0042]    to group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points, which can currently provide such access rates that a difference between each of the access rates and a preset access rate reference value lies in a preset threshold range, shall compete with each other, wherein the access points, which can currently provide such access rates that a difference between each of the access rates and the preset access rate reference value lies in the preset threshold range are grouped into the same competing group; or 
         [0043]    to group randomly the access points, which can serve the user equipment, into the at least one competing group. 
         [0044]    Optionally the processing module is configured: 
         [0045]    for each competing group, to determine access rates to be provided for the user equipment by the respective access points in the competing group respectively, and if all the access rates currently available from the respective access points in the competing group are equal to or greater than the access rates to be provided for the user equipment by the respective access points, to determine the competing group as a pre-selected competing group; and 
         [0046]    to determine an access overhead of each pre-selected competing group, and to select the target competing group for the accessing user equipment from the pre-selected competing group according to the determined access overhead. 
         [0047]    Furthermore the processing module is further configured: 
         [0048]    for each competing group, if the access rate currently available from at least one access point in the competing group is less than the access rate to be provided for the user equipment by the access point, to discard the competing group. 
         [0049]    Furthermore the processing module is configured: 
         [0050]    for each competing group, to determine the access rates to be provided for the user equipment by the respective access points in the competing group respectively under such a principle that net gains of the respective access points in the competing group are maximized. 
         [0051]    Optionally for each competing group, the processing module is configured to determine the access rates to be provided for the user equipment by the respective access points in the competing group respectively in the following differential gaming model: 
         [0000]    
       
         
           
             { 
             
               
                 
                   
                     
                       Max 
                        
                       
                         [ 
                         
                           
                             ∫ 
                             0 
                             ∞ 
                           
                            
                           
                             
                               { 
                               
                                 
                                   
                                     1 
                                     
                                       h 
                                       i 
                                     
                                   
                                    
                                   
                                     P 
                                      
                                     
                                       ( 
                                       s 
                                       ) 
                                     
                                   
                                    
                                   
                                     
                                       v 
                                       i 
                                     
                                      
                                     
                                       ( 
                                       s 
                                       ) 
                                     
                                   
                                 
                                 - 
                                 
                                   ( 
                                   
                                     
                                       
                                         
                                           
                                             v 
                                             i 
                                           
                                            
                                           
                                             ( 
                                             s 
                                             ) 
                                           
                                         
                                         2 
                                       
                                        
                                       
                                         b 
                                         i 
                                       
                                     
                                     + 
                                     
                                       
                                         
                                           v 
                                           i 
                                         
                                          
                                         
                                           ( 
                                           s 
                                           ) 
                                         
                                       
                                        
                                       
                                         c 
                                         i 
                                       
                                     
                                   
                                   ) 
                                 
                               
                               } 
                             
                              
                             
                               e 
                               
                                 - 
                                 rs 
                               
                             
                              
                             ds 
                           
                         
                         ] 
                       
                     
                   
                 
                 
                   
                     
                       
                         
                           P 
                           . 
                         
                          
                         
                           ( 
                           s 
                           ) 
                         
                       
                       = 
                       
                         k 
                          
                         
                           [ 
                           
                             a 
                             - 
                             
                               
                                 ∑ 
                                 
                                   i 
                                   = 
                                   1 
                                 
                                 n 
                               
                                
                               
                                 
                                   v 
                                   i 
                                 
                                  
                                 
                                   ( 
                                   s 
                                   ) 
                                 
                               
                             
                             - 
                             
                               P 
                                
                               
                                 ( 
                                 s 
                                 ) 
                               
                             
                           
                           ] 
                         
                       
                     
                   
                 
               
               ; 
             
           
         
       
     
         [0052]    wherein P(s) represents a gain of unit information of the competing group at an instance s of time; {dot over (P)}(s) represents a derivation operation on P(s); v i (s) represents an access rate to be provided for the user equipment by the i-th access point in the pre-selected competing group at the instance s of time, wherein i=1, 2, . . . , n, and n represents the number of access points in the pre-selected competing group; h i  represents the number of hops between the user equipment, and the i-th access point in the pre-selected competing group; r represents a discount rate; and v i (s) 2 b i +(s)c i  represents the cost of the i-th access point, wherein b i  and c i  represents preset coefficients. 
         [0053]    Further to any one of the embodiments above, the processing module is configured to determine the access overhead of the competing group by: 
         [0054]    determining the access overhead of each competing group according to a gain of unit information of the competing group, and access rates to be provided for the user equipment by the respective access points in the competing group. 
         [0055]    Further to any one of the embodiments above, the processing module is configured to determine the access overhead of the competing group in the equation of: 
         [0000]    
       
         
           
             
               
                 ∑ 
                 
                   i 
                   = 
                   1 
                 
                 n 
               
                
               
                 
                   ∫ 
                   0 
                   ∞ 
                 
                  
                 
                   
                     P 
                      
                     
                       ( 
                       s 
                       ) 
                     
                   
                    
                   
                     
                       v 
                       i 
                     
                      
                     
                       ( 
                       s 
                       ) 
                     
                   
                    
                   ds 
                 
               
             
             ; 
           
         
       
     
         [0056]    wherein P(s) represents a gain of unit information of the competing group at an instance s of time; and v i (s) represents an access rate available from the i-th access point in the competing group at the instance s of time, wherein i=1, 2, . . . , n, and n represents the number of access points in the competing group. 
         [0057]    Further to any one of the embodiments above, the processing module is further configured: 
         [0058]    to select the target competing group for the accessing user equipment from the competing group according to a demand of the user equipment for a network quality of an access network. 
         [0059]    Some embodiments of the invention provide a communicating device including a transceiver, and at least one processor connected with the transceiver, wherein: 
         [0060]    the transceiver is configured to communicate data with another device; and 
         [0061]    the processor is configured to group access points, which can serve a user equipment, into at least one competing group; and to determine an access overhead of the competing group, and to select a target competing group for the accessing user equipment from the competing group according to determined access overhead. 
         [0062]    Optionally the processor is configured: 
         [0063]    to group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points served by the same operator do not compete with each other, wherein respective access points served by the same operator are grouped into different competing groups; or 
         [0064]    to group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points which are operating with the same access technology and served by the same operator do not compete with each other, wherein respective access points which are operating with the same access technology and served by the same operator are grouped into different competing groups; or 
         [0065]    to group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points in a preset distance range do not compete with each other, wherein the respective access points in the preset distance range are grouped into different competing groups; or 
         [0066]    to group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points operating with the same access technology do not compete with each other, wherein respective access points operating with the same access technology are grouped into different competing groups; or 
         [0067]    to group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points where a difference between currently available access rates of each of the access points are above a preset threshold, do not compete with each other, wherein the access points where a difference between currently available access rates of each of the access points are above the preset threshold, are grouped into different competing groups; or 
         [0068]    to group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points, which can currently provide such access rates that a difference between each of the access rates and a preset access rate reference value lies in a preset threshold range, shall compete with each other, wherein the access points, which can currently provide such access rates that a difference between each of the access rates and the preset access rate reference value lies in the preset threshold range are grouped into the same competing group; or 
         [0069]    to group randomly the access points, which can serve the user equipment, into the at least one competing group. 
         [0070]    Optionally the processor is configured: 
         [0071]    for each competing group, to determine access rates to be provided for the user equipment by the respective access points in the competing group respectively, and if all the access rates currently available from the respective access points in the competing group are equal to or greater than the access rates to be provided for the user equipment by the respective access points, to determine the competing group as a pre-selected competing group; and 
         [0072]    to determine an access overhead of each pre-selected competing group, and to select the target competing group for the accessing user equipment from the pre-selected competing groups according to the determined access overheads. 
         [0073]    Furthermore the processor is further configured: 
         [0074]    for each competing group, if the access rate currently available from at least one access point in the competing group is less than the access rate to be provided for the user equipment by the access point, to discard the competing group. 
         [0075]    Optionally the processor is configured: 
         [0076]    for each competing group, to determine the access rates to be provided for the user equipment by the respective access points in the competing group respectively under such a principle that net gains of the respective access points in the competing group are maximized. 
         [0077]    Optionally for each competing group, the processor is configured to determine the access rates to be provided for the user equipment by the respective access points in the competing group respectively in the following differential gaming model: 
         [0000]    
       
         
           
             { 
             
               
                 
                   
                     
                       Max 
                        
                       
                         [ 
                         
                           
                             ∫ 
                             0 
                             ∞ 
                           
                            
                           
                             
                               { 
                               
                                 
                                   
                                     1 
                                     
                                       h 
                                       i 
                                     
                                   
                                    
                                   
                                     P 
                                      
                                     
                                       ( 
                                       s 
                                       ) 
                                     
                                   
                                    
                                   
                                     
                                       v 
                                       i 
                                     
                                      
                                     
                                       ( 
                                       s 
                                       ) 
                                     
                                   
                                 
                                 - 
                                 
                                   ( 
                                   
                                     
                                       
                                         
                                           
                                             v 
                                             i 
                                           
                                            
                                           
                                             ( 
                                             s 
                                             ) 
                                           
                                         
                                         2 
                                       
                                        
                                       
                                         b 
                                         i 
                                       
                                     
                                     + 
                                     
                                       
                                         
                                           v 
                                           i 
                                         
                                          
                                         
                                           ( 
                                           s 
                                           ) 
                                         
                                       
                                        
                                       
                                         c 
                                         i 
                                       
                                     
                                   
                                   ) 
                                 
                               
                               } 
                             
                              
                             
                               e 
                               
                                 - 
                                 rs 
                               
                             
                              
                             ds 
                           
                         
                         ] 
                       
                     
                   
                 
                 
                   
                     
                       
                         
                           P 
                           . 
                         
                          
                         
                           ( 
                           s 
                           ) 
                         
                       
                       = 
                       
                         k 
                          
                         
                           [ 
                           
                             a 
                             - 
                             
                               
                                 ∑ 
                                 
                                   i 
                                   = 
                                   1 
                                 
                                 n 
                               
                                
                               
                                 
                                   v 
                                   i 
                                 
                                  
                                 
                                   ( 
                                   s 
                                   ) 
                                 
                               
                             
                             - 
                             
                               P 
                                
                               
                                 ( 
                                 s 
                                 ) 
                               
                             
                           
                           ] 
                         
                       
                     
                   
                 
               
               ; 
             
           
         
       
     
         [0078]    wherein P(s) represents a gain of unit information of the competing group at an instance s of time; {dot over (P)}(s) represents a derivation operation on P(s); v i (s) represents an access rate to be provided for the user equipment by the i-th access point in the pre-selected competing group at the instance s of time, wherein i=1, 2, . . . , n, and n represents the number of access points in the pre-selected competing group; h i  represents the number of hops between the user equipment, and the i-th access point in the pre-selected competing group; r represents a discount rate; and v i (s) 2 b i +v i (s)c i  represents the cost of the i-th access point, wherein b i  and c i  represents preset coefficients. 
         [0079]    Further to any one of the embodiments above, the processor configured to determine the access overhead of the competing group is configured: 
         [0080]    to determine the access overhead of each competing group according to a gain of unit information of the competing group, and access rates to be provided for the user equipment by the respective access points in the competing group. 
         [0081]    Further to any one of the embodiments above, the processor is configured to determine the access overhead of the competing group in the equation of: 
         [0000]    
       
         
           
             
               
                 ∑ 
                 
                   i 
                   = 
                   1 
                 
                 n 
               
                
               
                 
                   ∫ 
                   0 
                   ∞ 
                 
                  
                 
                   
                     P 
                      
                     
                       ( 
                       s 
                       ) 
                     
                   
                    
                   
                     
                       v 
                       i 
                     
                      
                     
                       ( 
                       s 
                       ) 
                     
                   
                    
                   ds 
                 
               
             
             ; 
           
         
       
     
         [0082]    wherein P(s) represents a gain of unit information of the competing group at an instance s of time; and v i (s) represents an access rate available from the i-th access point in the competing group at the instance s of time, wherein i=1, 2, . . . , n, and n represents the number of access points in the competing group. 
         [0083]    Further to any one of the embodiments above, the processor is further configured: 
         [0084]    to select the target competing group for the accessing user equipment from the competing group according to a demand of the user equipment for a network quality of an access network. 
         [0085]    The embodiments of the invention provide a solution to competing for traffic in a heterogeneous network so as to extend the mode in which the same service can only be served by one operator at the same time in the prior art, so that a user equipment can select different access schemes, thus providing a new traffic operating mode for the development of the network. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0086]      FIG. 1  is a schematic flow chart of a first accessing method in a heterogeneous network according to the invention; 
           [0087]      FIG. 2  is a schematic diagram of a heterogeneous network model according to the invention; 
           [0088]      FIG. 3  is a schematic diagram of another heterogeneous network model according to the invention; 
           [0089]      FIG. 4  is a schematic flow chart of a second accessing method in a heterogeneous according to the invention; 
           [0090]      FIG. 5  is a schematic flow chart of a first embodiment of the invention; 
           [0091]      FIG. 6  is a schematic diagram of an accessing apparatus in a heterogeneous network according to the invention; and 
           [0092]      FIG. 7  is a schematic diagram of a communication device according to the invention. 
       
    
    
     DETAILED DESCRIPTION OF THE EMBODIMENTS 
       [0093]    In order to make the objects, technical solutions, and advantages of the embodiments of the invention more apparent, the technical solutions according to the embodiments of the invention will be described below clearly and fully with reference to the drawings in the embodiments of the invention, and apparently the embodiments described below are only a part but not all of the embodiments of the invention. Based upon the embodiments here of the invention, all the other embodiments which can occur to those ordinarily skilled in the art without any inventive effort shall fall into the scope of the invention. 
         [0094]    It shall be appreciated that the technical solutions according to the invention can be applicable to various communication systems, e.g., a Global System of Mobile communication (GSM) system, a Code Division Multiple Access (CDMA) system, a Wideband Code Division Multiple Access (WCDMA) system, a General Packet Radio Service (GPRS) system, a Long Term Evolution (LTE) system, an Advanced Long Term Evolution (LTE-A) system, a Universal Mobile Telecommunication System (UMTS) system, etc. 
         [0095]    It shall be further appreciated that in the embodiments of the invention, a User Equipment (UE) includes but will not be limited to a Mobile Station (MS), a Mobile Terminal (MT), a mobile telephone, a handset, a portable equipment, etc., where the user equipment can communicate with one or more core network over a Radio Access Network (RAN), for example, the user equipment can be a mobile telephone (or referred to as a “cellular” telephone), a computer with a wireless communication function, etc., and the user equipment can further be a portable, a miniaturized, a hand-held, a built-in-computer or on-vehicle mobile device, etc. 
         [0096]    In embodiments of the invention, a base station (e.g., an access point) can refer to a device communicating with a wireless terminal in one or more sectors via an air interface in an access network. The base station acting as a router between the wireless terminal, and the remaining components of the access network can be configured to convert a received frame over the air into an IP packet, or vice versa, where the remaining components of the access network can include an Internet Protocol (IP) network. The base station can further coordinate attribute management on the air interface. For example, the base station can be a Base Transceiver Station (BTS) in the GSM or CDMA system, or can be a NodeB in the WCDMA system, or can be an evolved Node B (NodeB or eNB or eNodeB) in the LTE system, although the invention will not be limited thereto. 
         [0097]    In the invention, a plurality of access points are selected for the accessing user equipment based upon access rates to be provided by the respective access points for the user equipment, and access rates currently available from the access points, so that respective operators cooperate cooperatively for the user using their access technologies without wasting the existing communication infrastructure. 
         [0098]    The embodiments of the invention will be described below in further details with reference to the drawings. It shall be appreciated that the embodiments described are merely intended to illustrate and describe the invention, but not to limit the invention. 
         [0099]    In order to enable the different operators to provide different access services concurrently for the same service so as to enable the user to select freely his or her own desirable access point, firstly such a feasible competition mechanism that the competition for traffic appears to the user equipment as the selection of an access point and an access rate, i.e., the competition for traffic in a heterogeneous network. The embodiments of the invention provide such a solution to competition for traffic in a heterogeneous network that the operators can compete cooperatively through dynamic pricing at a fine competition granularity up to the traffic so as to extend the mode in which the same service can only be served by one operator at the same time in the prior art, so that the user equipment can select different access schemes, thus providing a new traffic operating mode for the development of the network, particularly an Internet of vehicles system where there are a high movement speed of the vehicles. 
         [0100]      FIG. 1  illustrates a first accessing method in a heterogeneous according to some embodiments of the invention, and as illustrated in  FIG. 1 , the method includes the following steps: 
         [0101]    The step  11  is to group access points, which can serve a user equipment, into at least one competing group. 
         [0102]    In this step, the access points which can serve the user equipment are grouped into at least one group, each of which is referred to as a competing group in which there is at least one access point which can serve the user equipment. 
         [0103]    The step  12  is to determine an access overhead of the competing group, and to select a target competing group for the accessing user equipment from the competing group according to the determined access overhead. 
         [0104]    In this step, the target competing group is determined for the accessing user equipment from the competing group according to the determined access overhead, where the selected competing group is defined as a target competing group, and the user equipment can access each access point in the target competing group. 
         [0105]    In the embodiment of the invention, firstly the access points which can serve the user equipment are grouped into the at least one competing group; and then the access overhead of the competing group is determined, and the target competing group is determined for the accessing user equipment from the competing group according to the determined access overhead, thus providing such a solution to competition for traffic in a heterogeneous network that the operators can compete cooperatively through dynamic pricing at a fine competition granularity up to the traffic so as to extend the mode in which the same service can only be served by one operator at the same time in the prior art, so that the user equipment can select different access schemes, thus providing a new traffic operating mode for the development of the network. 
         [0106]    In some embodiments, before the step  11 , the method further includes creating a heterogeneous network model, that is, determining the access points in the heterogeneous network, which can serve the user equipment. 
         [0107]    Taking an Internet of vehicles system as an example, an on-vehicle terminal in the Internet of vehicles system may reside concurrently in the heterogeneous network including a cellular network, a WiFi network, and a wireless ad hoc network. The three networks with their respective advantages functionally supplement each other. The ad network including the vehicles can be architecturally understood as supplementation to a radio access network, and some nodes in the ad hoc network in the network model can be regarded as access points, where these nodes can act as forwarding nodes of radio access points. The heterogeneous network model can be created by determining access points, which can serve the on-vehicle terminal, in the cellular network, the WiFi network, and the wireless ad hoc network. 
         [0108]    Optionally the access points can be grouped in the step  11  by grouping all the access points in the heterogeneous network, which can serve the user equipment, or a subset of the access points in the heterogeneous network, which can serve the user equipment. 
         [0109]    By way of an example, taking the Internet of vehicles system as an example, if there are such two on-vehicle terminals in the ad hoc network where the on-vehicle terminal S currently resides that can provide the on-vehicle terminal S with an intermediary access service, that is, the on-vehicle terminal S can be connected with an access point  1  and an access point  2  through the two on-vehicle terminals which are referred to as an intermediary node  1  and an intermediary node  2 , and also the on-vehicle terminal S can further access a 3G access point  3  and access point  4  of an operator A, a WiFi access point  5  and access point  6  of the operator A, a 3G access point  7  and access point  8  of an operator B, and a WiFi access point  9  and access point  10  of the operator B, then the heterogeneous network model of the Internet of vehicles created for the on-vehicle terminal S will be referred to as a network G as illustrated in  FIG. 2 , or any subset, including the on-vehicle terminal S, of the network as illustrated in  FIG. 2 . 
         [0110]    In another example, if there are such two on-vehicle terminals in the ad hoc network where the on-vehicle terminal S currently resides that can serve it directly, which are referred to as an access point  1  and an access point  2 , that is, the on-vehicle terminal S can be connected directly to the access network through these two on-vehicle devices, and also the on-vehicle terminal S can further access a 3G access point  3  and access point  4  of an operator A, a WiFi access point  5  and access point  6  of the operator A, a 3G access point  7  and access point  8  of an operator B, and a WiFi access point  9  and access point  10  of the operator B, then the heterogeneous network model of the Internet of vehicles created for the on-vehicle terminal S will be referred to as a network G as illustrated in  FIG. 3 , or any subset, including the on-vehicle terminal S, of the network as illustrated in  FIG. 3 . 
         [0111]    In some embodiments, the access points which can serve the user equipment are grouped into the at least one competing group in the step  11  in the following schemes without any limitation thereto: 
         [0112]    The access points which can serve the user equipment are grouped into the at least one competing group under such a principle that access points served by the same operator do not compete with each other, where respective access points served by the same operator are grouped into different competing groups; or 
         [0113]    The access points which can serve the user equipment are grouped into the at least one competing group under such a principle that access points, operating with the same access technology, served by the same operator do not compete with each other, where respective access points, operating with the same access technology, served by the same operator are grouped into different competing groups; or 
         [0114]    The access points which can serve the user equipment are grouped into the at least one competing group under such a principle that access points in a preset distance range do not compete with each other, where the respective access points in the preset distance range are grouped into different competing groups; or 
         [0115]    The access points which can serve the user equipment are grouped into the at least one competing group under such a principle that access points operating with the same access technology do not compete with each other, where respective access points operating with the same access technology are grouped into different competing groups; or 
         [0116]    The access points which can serve the user equipment are grouped into the at least one competing group under such a principle that access points where a difference between currently available access rates of each of the access points are above a preset threshold, do not compete with each other, where the access points where a difference between currently available access rates of each of the access points are above the preset threshold, are grouped into different competing groups; or 
         [0117]    The access points which can serve the user equipment are grouped into the at least one competing group under such a principle that access points, which currently can provide such access rates that the differences between the access rates and a preset access rate reference value lie in a preset threshold range, shall compete with each other, where the access points, which currently can provide such access rates that the differences between the access rates and the preset access rate reference value lie in the preset threshold range are grouped into the same competing group; or 
         [0118]    The access points which can serve the user equipment are grouped randomly into the at least one competing group. 
         [0119]    The access points which can serve the user equipment can be grouped otherwise into the at least one competing group instead of being grouped as described in the several grouping schemes listed above, although the invention will not be limited thereto. 
         [0120]    In some embodiments, the access overhead of the competing group is determined in the step  12  as follows: 
         [0121]    The access overhead of each competing group is determined according to a gain of unit information of the competing group, and access rates to be provided for the user equipment by respective access points in the competing group. 
         [0122]    Particularly the access overhead of each of the at least one competing group into which the access points are grouped in the step  11  is determined according to the gain of unit information of the competing group, and the access rates to be provided for the user equipment by the respective access points in the competing group. 
         [0123]    Here for each competing group, the access rates to be provided for the user equipment by the respective access points in the competing group are determined respectively as follows: 
         [0124]    For each competing group, the access rates to be provided for the user equipment by the respective access points in the competing group are determined respectively under such a principle that net gains of the respective access points in the competing group are maximized. 
         [0125]    In some implementation, for each competing group, a differential gaming model can be created to solve for the gain of unit information of the competing group, and the access rates to be provided for the user equipment by the respective access points in the competing group. There are a number of optional implementations of the differential gaming model primarily with the following idea: 
         [0126]    There are n participants (i.e., access points) in differential gaming, and the differential gaming model includes two components: one component is an expression of the maximum net gain of a competing access point, where the net gain of the access point is equal to a gross gain minus the cost of the access point, and if the access point is an access point in the ad hoc network, then the gross gain of the access point may be further shared with another or other access points; and the other component reflects a mutual interference between competition strategies applicable to the respective access points, i.e., a relationship between an access rate available from an access point, and a gain of unit information. The differential gaming model can be solved to thereby calculate the gain of unit information of each competing group, and the access rates to be provided for the user equipment by the respective access points in the competing group. 
         [0127]    Optionally for each competing group, the gain of unit information of the competing group, and the access rates to be provided for the user equipment by the respective access points in the competing group are determined respectively in the following differential gaming model: 
         [0000]    
       
         
           
             
               
                 
                   { 
                   
                     
                       
                         
                           
                             Max 
                              
                             
                               [ 
                               
                                 
                                   ∫ 
                                   0 
                                   ∞ 
                                 
                                  
                                 
                                   
                                     { 
                                     
                                       
                                         
                                           1 
                                           
                                             h 
                                             i 
                                           
                                         
                                          
                                         
                                           P 
                                            
                                           
                                             ( 
                                             s 
                                             ) 
                                           
                                         
                                          
                                         
                                           
                                             v 
                                             i 
                                           
                                            
                                           
                                             ( 
                                             s 
                                             ) 
                                           
                                         
                                       
                                       - 
                                       
                                         ( 
                                         
                                           
                                             
                                               
                                                 
                                                   v 
                                                   i 
                                                 
                                                  
                                                 
                                                   ( 
                                                   s 
                                                   ) 
                                                 
                                               
                                               2 
                                             
                                              
                                             
                                               b 
                                               i 
                                             
                                           
                                           + 
                                           
                                             
                                               
                                                 v 
                                                 i 
                                               
                                                
                                               
                                                 ( 
                                                 s 
                                                 ) 
                                               
                                             
                                              
                                             
                                               c 
                                               i 
                                             
                                           
                                         
                                         ) 
                                       
                                     
                                     } 
                                   
                                    
                                   
                                     e 
                                     
                                       - 
                                       rs 
                                     
                                   
                                    
                                   ds 
                                 
                               
                               ] 
                             
                           
                         
                       
                       
                         
                           
                             
                               
                                 P 
                                 . 
                               
                                
                               
                                 ( 
                                 s 
                                 ) 
                               
                             
                             = 
                             
                               k 
                                
                               
                                 [ 
                                 
                                   a 
                                   - 
                                   
                                     
                                       ∑ 
                                       
                                         i 
                                         = 
                                         1 
                                       
                                       n 
                                     
                                      
                                     
                                       
                                         v 
                                         i 
                                       
                                        
                                       
                                         ( 
                                         s 
                                         ) 
                                       
                                     
                                   
                                   - 
                                   
                                     P 
                                      
                                     
                                       ( 
                                       s 
                                       ) 
                                     
                                   
                                 
                                 ] 
                               
                             
                           
                         
                       
                     
                     ; 
                   
                 
               
               
                 
                   Equation 
                    
                   
                       
                   
                    
                   1 
                 
               
             
           
         
       
     
         [0128]    Where P(s) represents a gain of unit information of the competing group at an instance s of time; {dot over (P)}(s) represents a derivation operation on P(s); v i (s) represents an access rate to be provided for the user equipment by the i-th access point in the competing group at the instance s of time, where i=1, 2, . . . , n, and n represents the number of access points in the competing group; h i  represents the number of hops between the user equipment, and the i-th access point in the competing group; r represents a discount rate; v i (s) 2 b i +v i (s)c i  represents the cost of the i-th access point, where b i  and c i  represents preset coefficients; k represents a rate at which a price is adjusted by a market; and 
         [0000]    
       
         
           
             a 
             - 
             
               
                 ∑ 
                 
                   i 
                   = 
                   1 
                 
                 n 
               
                
               
                 
                   v 
                   i 
                 
                  
                 
                   ( 
                   s 
                   ) 
                 
               
             
           
         
       
     
         [0000]    represents an instantaneous inverted demand function. 
         [0129]    It shall be noted that the parameter h i  in the differential gaming model represents the number of hops between the user equipment, and the i-th access point in the competing group, and particularly the value of this parameter is such that if the user equipment is connected directly with the i-th access point, then h i =1; and if the user equipment is connected with the i-th access point through a number m of intermediate points, then h i =m+1. 
         [0130]    The differential gaming model as illustrated in Equation 1 is solved for the access rate to be provided for the user equipment by each access point in the competing group, which is 
         [0000]    
       
         
           
             
               
                 
                   v 
                   i 
                 
                  
                 
                   ( 
                   s 
                   ) 
                 
               
               = 
               
                 
                   
                     
                       ( 
                       
                         1 
                         - 
                         
                           
                             h 
                             i 
                           
                            
                           
                             kA 
                             i 
                           
                         
                       
                       ) 
                     
                      
                     
                       P 
                        
                       
                         ( 
                         s 
                         ) 
                       
                     
                   
                   + 
                   
                     
                       h 
                       i 
                     
                      
                     
                       ( 
                       
                         
                           kB 
                           i 
                         
                         - 
                         
                           c 
                           i 
                         
                       
                       ) 
                     
                   
                 
                 
                   2 
                    
                   
                     h 
                     i 
                   
                    
                   
                     b 
                     i 
                   
                 
               
             
             , 
             
               i 
               = 
               1 
             
             , 
             2 
             , 
             … 
              
             
                 
             
             , 
             
               n 
               . 
             
           
         
       
     
         [0000]    where A i  and B i  represent solutions to a set of n-element quadratic equations 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       k 
                       2 
                     
                      
                     
                       A 
                       i 
                       2 
                     
                   
                   
                     2 
                      
                     
                       b 
                       i 
                     
                   
                 
                 - 
                 
                   
                     ( 
                     
                       
                         
                           ∑ 
                           
                             j 
                             = 
                             1 
                           
                           n 
                         
                          
                         
                           k 
                           
                             
                               h 
                               j 
                             
                              
                             
                               b 
                               j 
                             
                           
                         
                       
                       + 
                       r 
                       + 
                       
                         2 
                          
                         k 
                       
                     
                     ) 
                   
                    
                   
                     A 
                     i 
                   
                 
                 + 
                 
                   1 
                   
                     2 
                      
                     
                       h 
                       i 
                       2 
                     
                      
                     
                       b 
                       i 
                     
                   
                 
                 + 
                 
                   
                     
                       ∑ 
                       
                         j 
                         = 
                         1 
                       
                       n 
                     
                     
                       j 
                       ≠ 
                       1 
                     
                   
                    
                   
                     
                       
                         k 
                         2 
                       
                        
                       
                         A 
                         i 
                       
                        
                       
                         A 
                         j 
                       
                     
                     
                       b 
                       j 
                     
                   
                 
               
               = 
               0 
             
             , 
           
         
       
     
         [0000]    and a set of n-element simple equations 
         [0000]    
       
         
           
             
               
                 
                   ( 
                   
                     
                       
                         ∑ 
                         
                           j 
                           = 
                           1 
                         
                         n 
                       
                        
                       
                         
                           k 
                            
                           
                             ( 
                             
                               1 
                               - 
                               
                                 
                                   h 
                                   j 
                                 
                                  
                                 
                                   kA 
                                   j 
                                 
                               
                             
                             ) 
                           
                         
                         
                           2 
                            
                           
                             h 
                             j 
                           
                            
                           
                             b 
                             j 
                           
                         
                       
                     
                     + 
                     k 
                     + 
                     r 
                   
                   ) 
                 
                  
                 
                   B 
                   i 
                 
               
               - 
               
                 
                   
                     ∑ 
                     
                       j 
                       = 
                       1 
                     
                     n 
                   
                   
                     j 
                     ≠ 
                     1 
                   
                 
                  
                 
                   
                     
                       k 
                       2 
                     
                      
                     
                       A 
                       i 
                     
                      
                     
                       B 
                       j 
                     
                   
                   
                     2 
                      
                     
                       b 
                       j 
                     
                   
                 
               
               - 
               
                 
                   c 
                   i 
                 
                 
                   2 
                    
                   
                     h 
                     i 
                   
                    
                   
                     b 
                     i 
                   
                 
               
               + 
               
                 
                   kA 
                   i 
                 
                  
                 a 
               
               + 
               
                 
                   ∑ 
                   
                     j 
                     = 
                     1 
                   
                   n 
                 
                  
                 
                   
                     
                       kA 
                       i 
                     
                      
                     
                       c 
                       j 
                     
                   
                   
                     2 
                      
                     
                       b 
                       j 
                     
                   
                 
               
             
             = 
             0 
           
         
       
     
         [0000]    respectively, i.e.: 
         [0000]    
       
         
           
             
               
                 C 
                 i 
               
               = 
               
                 
                   1 
                   r 
                 
                  
                 
                   [ 
                   
                     
                       - 
                       
                         
                           
                             
                               k 
                               2 
                             
                              
                             
                               B 
                               i 
                               2 
                             
                           
                           - 
                           
                             c 
                             i 
                             2 
                           
                         
                         
                           4 
                            
                           
                             b 
                             i 
                           
                         
                       
                     
                     - 
                     
                       
                         kB 
                         i 
                       
                        
                       
                         ( 
                         
                           a 
                           - 
                           
                             
                               ∑ 
                               
                                 j 
                                 = 
                                 1 
                               
                               n 
                             
                              
                             
                               
                                 
                                   kB 
                                   j 
                                 
                                 - 
                                 
                                   c 
                                   j 
                                 
                               
                               
                                 2 
                                  
                                 
                                   b 
                                   j 
                                 
                               
                             
                           
                         
                         ) 
                       
                     
                   
                   ] 
                 
               
             
             , 
             and 
           
         
       
       
         
           
             
               
                 P 
                 * 
               
                
               
                 ( 
                 s 
                 ) 
               
             
             = 
             
               
                 
                   ( 
                   
                     
                       P 
                       0 
                     
                     - 
                     
                       
                         a 
                         + 
                         
                           
                             ∑ 
                             
                               i 
                               = 
                               1 
                             
                             n 
                           
                            
                           
                             
                               
                                 c 
                                 i 
                               
                               - 
                               
                                 kB 
                                 i 
                               
                             
                             
                               2 
                                
                               
                                 b 
                                 i 
                               
                             
                           
                         
                       
                       
                         1 
                         + 
                         
                           
                             ∑ 
                             
                               i 
                               = 
                               1 
                             
                             n 
                           
                            
                           
                             
                               ( 
                               
                                 1 
                                 - 
                                 
                                   
                                     h 
                                     i 
                                   
                                    
                                   
                                     kA 
                                     i 
                                   
                                 
                               
                               ) 
                             
                             
                               2 
                                
                               
                                 h 
                                 i 
                               
                                
                               
                                 b 
                                 i 
                               
                             
                           
                         
                       
                     
                   
                   ) 
                 
                  
                 
                   e 
                   
                     
                       - 
                       
                         [ 
                         
                           k 
                           + 
                           
                             
                               ∑ 
                               
                                 i 
                                 = 
                                 1 
                               
                               n 
                             
                              
                             
                               
                                 k 
                                  
                                 
                                   ( 
                                   
                                     1 
                                     - 
                                     
                                       
                                         h 
                                         i 
                                       
                                        
                                       
                                         kA 
                                         i 
                                       
                                     
                                   
                                   ) 
                                 
                               
                               
                                 2 
                                  
                                 
                                   h 
                                   i 
                                 
                                  
                                 
                                   b 
                                   i 
                                 
                               
                             
                           
                         
                         ] 
                       
                     
                      
                     s 
                   
                 
               
               + 
               
                 
                   
                     a 
                     + 
                     
                       
                         ∑ 
                         
                           i 
                           = 
                           1 
                         
                         n 
                       
                        
                       
                         
                           
                             c 
                             i 
                           
                           - 
                           
                             kB 
                             i 
                           
                         
                         
                           2 
                            
                           
                             b 
                             i 
                           
                         
                       
                     
                   
                   
                     1 
                     + 
                     
                       
                         ∑ 
                         
                           i 
                           = 
                           1 
                         
                         n 
                       
                        
                       
                         
                           ( 
                           
                             1 
                             - 
                             
                               
                                 h 
                                 i 
                               
                                
                               
                                 kA 
                                 i 
                               
                             
                           
                           ) 
                         
                         
                           2 
                            
                           
                             h 
                             i 
                           
                            
                           
                             b 
                             i 
                           
                         
                       
                     
                   
                 
                 . 
               
             
           
         
       
     
         [0131]    Further to any one of the embodiments above, optionally the access overhead of the competing group is determined according to the gain of unit information of the competing group, and the access rates to be provided for the user equipment by the respective access points in the competing group in the step  12  in the equation of: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       ∑ 
                       
                         i 
                         = 
                         1 
                       
                       n 
                     
                      
                     
                       
                         ∫ 
                         0 
                         ∞ 
                       
                        
                       
                         
                           P 
                            
                           
                             ( 
                             s 
                             ) 
                           
                         
                          
                         
                           
                             v 
                             i 
                           
                            
                           
                             ( 
                             s 
                             ) 
                           
                         
                          
                         ds 
                       
                     
                   
                   ; 
                 
               
               
                 
                   
                     Equation 
                      
                     
                         
                     
                      
                     2 
                   
                   ; 
                 
               
             
           
         
       
     
         [0132]    Where P(s) represents a gain of unit information of the competing group at an instance s of time; and v i (s) represents an access rate to be provided for the user equipment by the i-th access point in the pre-selected competing group at the instance s of time, where i=1, 2, . . . , n, and n represents the number of access points in the pre-selected competing group. 
         [0133]    In some embodiments, an access overhead of each pre-selected competing group can also be determined in the differential gaming model, and generally the access overhead of each pre-selected competing group is the sum of gross gains of respective access points in the pre-selected competing group. 
         [0134]    Further to any one of the embodiments above, the target competing group is further selected for the accessing user equipment from the competing group according to the determined access overhead in the step  12  as follows: 
         [0135]    The target competing group is selected for the accessing user equipment from the competing group according to a demand of the user equipment for the network quality of the access network. 
         [0136]    Here the demand of the user equipment for a network quality of the access network includes but will not be limited to one or more of the following demands: 
         [0137]    A demand of the user equipment for a delay of the access network, for example, the delay of the access network is smaller than a preset delay, etc.; 
         [0138]    A demand of the user equipment for a dithering of the access network, for example, the dithering of the access network is below a preset threshold, etc.; and 
         [0139]    A demand of the user equipment for a packet loss ratio of the access network, for example, the packet loss ratio of the access network is below a preset threshold y, etc. 
         [0140]    In some embodiments, the target competing group can be selected for the user equipment from the competing group according to the determined access overhead of each competing group in the step  12  by selecting a competing group satisfying a preset access overhead condition as the target competing group only according to the access overhead of each competing group; or selecting a competing group satisfying both a preset access overhead condition, and the demand of the user equipment for the network quality of the access network as the target competing group according to the access overhead of each competing group, and the demand of the user equipment for the network quality of the access network. 
         [0141]    Here the preset access overhead condition can be such that the access overhead is minimum, or the access overhead is below a preset threshold, or lies in a preset threshold range, etc. If there are at least two competing groups, all of which satisfy the preset access overhead condition, then one of the at least two competing groups can be selected randomly as the target competing group. 
         [0142]    It shall be noted that the access rate as referred to in embodiments of the invention can alternatively be construed as another quantization index of a spectrum resource, e.g., a bandwidth, that is, an access rate currently available from an access point can be construed as a bandwidth currently available from the access point, and an access rate to be provided for the user equipment by the access point can be constructed as a bandwidth to be provided for the user equipment by the access point. 
         [0143]      FIG. 4  illustrates a second accessing method in a heterogeneous according to some embodiments of the invention, and as illustrated in  FIG. 4 , the method includes the followings steps: 
         [0144]    The step  41  is to group access points, which can serve a user equipment, into at least one competing group. 
         [0145]    In this step, the access points which can serve the user equipment are grouped into at least one group, each of which is referred to as a competing group in which there is at least one access point which can serve the user equipment. 
         [0146]    The step  42  is to determine for each competing group access rates to be provided for the user equipment by the respective access points in the competing group respectively, and if all the access rates currently available from the respective access points in the competing group are equal to or greater than the access rates to be provided for the user equipment by the respective access points, to determine the competing group as a pre-selected competing group. 
         [0147]    In this step, firstly the competing group into which the access points are grouped in the step  11  is screened out, and the competing group satisfying the condition (that is, all the access rates currently available from the respective access points in the competing group are equal to or greater than the access rates to be provided for the user equipment by the respective access points) is determined as the pre-selected competing group to thereby improve the efficiency of processing. 
         [0148]    The step  43  is to determine an access overhead of each pre-selected competing group, and to select a target competing group for the accessing user equipment from the pre-selected competing group according to the determined access overhead. 
         [0149]    In this step, one of the pre-selected competing groups is selected for the accessing user equipment according to the determined access overhead, where the selected pre-selected competing group is defined as the target competing group, and the user equipment can access each access point in the target competing group. 
         [0150]    In embodiments of the invention, firstly the access points which can serve the user equipment are grouped into the competing groups; then for each competing group, the access rates to be provided for the user equipment by the respective access points in the competing group are determined, and if all the access rates currently available from the respective access points in the competing group are equal to or greater than the access rates to be provided for the user equipment by the respective access points, the competing group will be determined as the pre-selected competing group; and finally the access overhead of each pre-selected competing group is determined, and one of the pre-selected competing groups is selected for the accessing user equipment according to the determined access overhead, thus providing such a solution to competition for traffic in a heterogeneous network that the operators can compete cooperatively through dynamic pricing at a fine competition granularity up to the traffic so as to extend the mode in which the same service can only be served by one operator at the same time in the prior art, so that the user equipment can select different access schemes, thus providing a new traffic operating mode for the development of the network. 
         [0151]    In some embodiments, before the step  41 , the method further includes creating a heterogeneous network model, that is, determining the access points in the heterogeneous network, which can serve the user equipment. The heterogeneous network model can be created particularly as described above in the first accessing method in a heterogeneous network, so a repeated description thereof will be omitted here. 
         [0152]    Optionally the access points can be grouped in the step  41  by grouping all the access points in the heterogeneous network, which can serve the user equipment, or a subset of the access points in the heterogeneous network, which can serve the user equipment. 
         [0153]    In some embodiments, the access points which can serve the user equipment are grouped into the at least one competing group in the step  41  in the following schemes without any limitation thereto: 
         [0154]    The access points which can serve the user equipment are grouped into the at least one competing group under such a principle that access points served by the same operator do not compete with each other, where respective access points served by the same operator are grouped into different competing groups; or 
         [0155]    The access points which can serve the user equipment are grouped into the at least one competing group under such a principle that access points, operating with the same access technology, served by the same operator do not compete with each other, where respective access points, operating with the same access technology, served by the same operator are grouped into different competing groups; or 
         [0156]    The access points which can serve the user equipment are grouped into the at least one competing group under such a principle that access points in a preset distance range do not compete with each other, where the respective access points in the preset distance range are grouped into different competing groups; or 
         [0157]    The access points which can serve the user equipment are grouped into the at least one competing group under such a principle that access points operating with the same access technology do not compete with each other, where respective access points operating with the same access technology are grouped into different competing groups; or 
         [0158]    The access points which can serve the user equipment are grouped into the at least one competing group under such a principle that access points where a difference between currently available access rates of each of the access points are above a preset threshold, do not compete with each other, where the access points where a difference between currently available access rates of each of the access points are above the preset threshold, are grouped into different competing groups; or 
         [0159]    The access points which can serve the user equipment are grouped into the at least one competing group under such a principle that access points, which currently can provide such access rates that the differences between the access rates and a preset access rate reference value lie in a preset threshold range, shall compete with each other, where the access points, which currently can provide such access rates that the differences between the access rates and the preset access rate reference value lie in the preset threshold range are grouped into the same competing group; or 
         [0160]    The access points which can serve the user equipment are grouped randomly into the at least one competing group. 
         [0161]    The access points which can serve the user equipment can be grouped otherwise into the at least one competing group instead of being grouped as described in the several grouping schemes listed above, although the invention will not be limited thereto. 
         [0162]    In some embodiments, the step  42  further includes: for each competing group, if the access rate currently available from at least one access point in the competing group is less than the access rate to be provided for the user equipment by the access point, then discarding the competing group. 
         [0163]    Optionally for each competing group, the access rates currently available from the respective access points in the competing group are detected in real time according to network load conditions of the respective access points, and if all the access rates currently available from the respective access points in the competing group are equal to or greater than the access rates to be provided for the user equipment by the respective access points, then the competing group will be determined as the pre-selected competing group, and the access overhead of the pre-selected competing group will be calculated; otherwise, that is, if the access rate currently available from at least one access point in the competing group is less than the access rate to be provided for the user equipment by the access point, then the competing group will be discarded. 
         [0164]    In some embodiments, Optionally for each competing group, the access rates to be provided for the user equipment by the respective access points in the competing group are determined respectively in the step  42  as follows: 
         [0165]    For each competing group, the access rates to be provided for the user equipment by the respective access points in the competing group are determined respectively under such a principle that net gains of the respective access points in the competing group are maximized. 
         [0166]    In some embodiments, for each competing group, a differential gaming model can be created to solve for the access rates to be provided for the user equipment by the respective access points in the competing group. There are a number of particular implementations of the differential gaming model primarily with the following idea: 
         [0167]    There are n participants (i.e., access points) in differential gaming, and the differential gaming model includes two components: one component is an expression of the maximum net gain of a competing access point, where the net gain of the access point is equal to a gross gain minus the cost of the access point, and if the access point is an access point in the ad hoc network, then the gross gain of the access point may be further shared with another or other access points; and the other component reflects a mutual interference between competition strategies applicable to the respective access points, i.e., a relationship between an access rate available from an access point, and a gain of unit information. The differential gaming model can be solved to thereby calculate the gain of unit information of each competing group, and the access rates to be provided for the user equipment by the respective access points in the competing group. 
         [0168]    Optionally for each competing group, the access rates to be provided for the user equipment by the respective access points in the competing group are determined respectively in the differential gaming model as illustrated in Equation 1 above. They can be calculated particularly as described above in the first accessing method in a heterogeneous network, so a repeated description thereof will be omitted here. 
         [0169]    Further to any one of the embodiments above, the access overhead of each pre-selected competing group is determined in the step  43  as follows: 
         [0170]    The access overhead of each pre-selected competing group is determined according to the gain of unit information of the pre-selected competing group, and the access rates to be provided for the user equipment by the respective access points in the pre-selected competing group. 
         [0171]    Optionally the access overhead of each pre-selected competing group is determined in Equation 2 above. It can be calculated particularly as described above in the first accessing method in a heterogeneous network, so a repeated description thereof will be omitted here. 
         [0172]    Further to any one of the embodiments above, the target competing group is further selected for the accessing user equipment from the pre-selected competing group according to the determined access overhead in the step  43  as follows: 
         [0173]    The target competing group is selected for the accessing user equipment from the pre-selected competing group according to a demand of the user equipment for the network quality of the access network. 
         [0174]    Here the demand of the user equipment for a network quality of the access network includes but will not be limited to one or more of the following demands: 
         [0175]    A demand of the user equipment for a delay of the access network, for example, the delay of the access network is smaller than a preset delay, etc.; 
         [0176]    A demand of the user equipment for a dithering of the access network, for example, the dithering of the access network is below a preset threshold, etc.; and 
         [0177]    A demand of the user equipment for a packet loss ratio of the access network, for example, the packet loss ratio of the access network is below a preset threshold y, etc. 
         [0178]    Optionally the target competing group can be selected for the user equipment from the pre-selected competing group according to the determined access overhead of each pre-selected competing group in the step  43  by selecting a pre-selected competing group satisfying a preset access overhead condition as the target competing group only according to the access overhead of each pre-selected competing group; or selecting a pre-selected competing group satisfying both a preset access overhead condition, and the demand of the user equipment for the network quality of the access network as the target competing group according to the access overhead of each pre-selected competing group, and the demand of the user equipment for the network quality of the access network. 
         [0179]    Here the preset access overhead condition can be such that the access overhead is minimum, or the access overhead is below a preset threshold, or lies in a preset threshold range, etc. If there are at least two competing groups, all of which satisfy the preset access overhead condition, then one of the at least two competing groups can be selected randomly as the target competing group. 
         [0180]    It shall be noted that the access rate as referred to in the embodiments of the invention can alternatively be construed as another quantization index of a spectrum resource, e.g., a bandwidth, that is, an access rate currently available from an access point can be construed as a bandwidth currently available from the access point, and an access rate to be provided for the user equipment by the access point can be constructed as a bandwidth to be provided for the user equipment by the access point. 
         [0181]    Taking an Internet of vehicles system as an example, the accessing method in a heterogeneous network according to the invention will be described below in connection with embodiments of the invention. 
         [0182]    In a first embodiment, a processing flow of this embodiment is as illustrated in  FIG. 5  including the following steps: 
         [0183]    The step  51  is to model a network, and to determine access points in the network, which can serve a user equipment. 
         [0184]    The step  52  is to group the determined access points into a plurality of competing groups. 
         [0185]    Taking a network model as illustrated in  FIG. 3  as an example, if the access points are grouped into the competing groups in this step under such a principle that access points, operating with the same access technology, served by the same operator do not compete with each other, then the access points will be grouped into 16 competing groups, each of which includes 6 access points, i.e., (1,2,3,5,7,9), (1,2,3,5,7,10), (1,2,3,5,8,9), (1,2,3,5,8,10), (1,2,3,6,7,9), (1,2,3,6,7,10), (1,2,3,6,8,9), (1,2,3,6,8,10), (1,2,4,5,7,9), (1,2,4,5,7,10), (1,2,4,5,8,9), (1,2,4,5,8,10), (1,2,4,6,7,9), (1,2,4,6,7,10), (1,2,4,6,8,9), (1,2,4,6,8,10) respectively. 
         [0186]    The step  53  is to create a differential gaming model. 
         [0187]    There are n participants (access points), denoted as V 1 , V 2  . . . , V n  in some competing group; h i  represents the number of hops traversed by an on-vehicle terminal to the i-th access point; P(s) represents a gain of unit information at an instance s of time; a strategy of a participant V i  is an access rate v i (s) available from the participant; a cost of the participant V i  generally includes a power source cost and a network cost, and there is a quadratic function relationship, represented as v i   2 b i +v i c i , between the cost of the participant, and the access rate available from the participant; P 0  represents a gain of unit information at an initial instance of time; and the strategy relationship between participants in a duopoly market as defined by Tsutsui and Mino is extended to the n participants, thus resulting in a competition strategy relationship among the n access points, i.e., a relationship between the gain of unit information at the instance s of time, P(s), and the access rate v i (s) of the participant v i . 
         [0188]    The step  54  is to calculate for each competing group a gain of unit information of the competing group, and access rates to be provided for the user equipment by the respective access points in the competing group according to the created differential gaming model. 
         [0189]    The step  55  is to calculate for each competing group access rates currently available from the respective access points in the competing group. 
         [0190]    The step  56  is to determine for each competing group whether all the access rates currently available from the respective access points in the competing group are equal to or greater than the access rates to be provided for the user equipment by the respective access points; and 
         [0191]    If so, then the flow will proceed to the step  57 ; 
         [0192]    Otherwise, the flow will proceed to the step  58 ; 
         [0193]    The step  57  is to calculate an access overhead of the competing group, and to proceed to the step  59 ; 
         [0194]    The step  58  is to discard the competing group; and 
         [0195]    The step  59  is to select one of the competing groups for the accessing user equipment according to the calculated access overheads of the competing groups, and a demand of the user equipment for a network quality of an access network. 
         [0196]    Based upon the same inventive idea, some embodiments of the invention further provide an accessing apparatus in a heterogeneous network, and since the apparatus addresses the problem under a similar principle to the first accessing method in a heterogeneous network, and the second accessing method in a heterogeneous network, reference can be made for the implementations of the methods for an implementation of the apparatus, so a repeated description thereof will be omitted here. 
         [0197]      FIG. 6  illustrates an accessing apparatus in a heterogeneous network according to some embodiments of the invention, where the apparatus includes: 
         [0198]    A grouping module  61  is configured to group access points, which can serve a user equipment, into at least one competing group; and 
         [0199]    A processing module  62  is configured to determine an access overhead of the competing group, and to select a target competing group for the accessing user equipment from the competing group according to the determined access overhead. 
         [0200]    The apparatus according to embodiments of the invention can be arranged in a user equipment, or can be arranged in another device, e.g., a higher-layer device configured to schedule respective user equipments (e.g., a base station, etc.) 
         [0201]    In some embodiments, the grouping module  61  is configured: 
         [0202]    To group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points served by the same operator do not compete with each other, where respective access points served by the same operator are grouped into different competing groups; or 
         [0203]    To group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points, operating with the same access technology, served by the same operator do not compete with each other, where respective access points, operating with the same access technology, served by the same operator are grouped into different competing groups; or 
         [0204]    To group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points in a preset distance range do not compete with each other, where the respective access points in the preset distance range are grouped into different competing groups; or 
         [0205]    To group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points operating with the same access technology do not compete with each other, where respective access points operating with the same access technology are grouped into different competing groups; or 
         [0206]    To group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points where a difference between currently available access rates of each of the access points are above a preset threshold, do not compete with each other, where the access points where a difference between currently available access rates of each of the access points are above the preset threshold, are grouped into different competing groups; or 
         [0207]    To group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points, which currently can provide such access rates that the differences between the access rates and a preset access rate reference value lie in a preset threshold range, shall compete with each other, where the access points, which currently can provide such access rates that the differences between the access rates and the preset access rate reference value lie in the preset threshold range are grouped into the same competing group; or 
         [0208]    To group randomly the access points, which can serve the user equipment, into the at least one competing group. 
         [0209]    In a first preferred embodiment, the processing module  62  is configured, for the competing group into which the access points are grouped by the grouping module  61 : 
         [0210]    To determine the access overhead of each competing group, and to select the target competing group for the accessing user equipment from the competing group according to the determined access overhead. 
         [0211]    In a second preferred embodiment, the processing module  62  is configured: 
         [0212]    For each competing group, to determine access rates to be provided for the user equipment by the respective access points in the competing group respectively, and if all the access rates currently available from the respective access points in the competing group are equal to or greater than the access rates to be provided for the user equipment by the respective access points, to determine the competing group as a pre-selected competing group; and to determine an access overhead of each pre-selected competing group, and to select the target competing group for the accessing user equipment from the pre-selected competing group according to the determined access overhead. 
         [0213]    In this preferred embodiment, the processing module  62  firstly screens out the competing group into which the access points are grouped by the grouping module  61 , and determines the competing group satisfying the condition (that is, all the access rates currently available from the respective access points in the competing group are equal to or greater than the access rates to be provided for the user equipment by the respective access points) as the pre-selected competing group; and further determines the access overhead of each pre-selected competing group, and selects the target competing group for the accessing user equipment from the pre-selected competing group according to the determined access overhead to thereby improve the efficiency of processing. 
         [0214]    In this preferred embodiment, the processing module  62  is further configured, for each competing group, if the access rate currently available from at least one access point in the competing group is less than the access rate to be provided for the user equipment by the access point, to discard the competing group. 
         [0215]    Optionally for each competing group, the processing module  62  detects in real time the access rates currently available from the respective access points in the competing group according to network load conditions of the respective access points, and if all the access rates currently available from the respective access points in the competing group are equal to or greater than the access rates to be provided for the user equipment by the respective access points, then the processing module  62  will determine the competing group as the pre-selected competing group, and calculate the access overhead of the pre-selected competing group; otherwise, that is, if the access rate currently available from at least one access point in the competing group is less than the access rate to be provided for the user equipment by the access point, then the processing module  62  will discard the competing group. 
         [0216]    In some embodiments, for each competing group, the processing module  62  is configured: 
         [0217]    For each competing group, to determine the access rates to be provided for the user equipment by the respective access points in the competing group respectively under such a principle that net gains of the respective access points in the competing group are maximized. 
         [0218]    Optionally for each competing group, the processing module  62  is configured to determine the access rates to be provided for the user equipment by the respective access points in the competing group respectively in the following differential gaming model: 
         [0000]    
       
         
           
             { 
             
               
                 
                   
                     
                       Max 
                        
                       
                         [ 
                         
                           
                             ∫ 
                             0 
                             ∞ 
                           
                            
                           
                             
                               { 
                               
                                 
                                   
                                     1 
                                     
                                       h 
                                       i 
                                     
                                   
                                    
                                   
                                     P 
                                      
                                     
                                       ( 
                                       s 
                                       ) 
                                     
                                   
                                    
                                   
                                     
                                       v 
                                       i 
                                     
                                      
                                     
                                       ( 
                                       s 
                                       ) 
                                     
                                   
                                 
                                 - 
                                 
                                   ( 
                                   
                                     
                                       
                                         
                                           
                                             v 
                                             i 
                                           
                                            
                                           
                                             ( 
                                             s 
                                             ) 
                                           
                                         
                                         2 
                                       
                                        
                                       
                                         b 
                                         i 
                                       
                                     
                                     + 
                                     
                                       
                                         
                                           v 
                                           i 
                                         
                                          
                                         
                                           ( 
                                           s 
                                           ) 
                                         
                                       
                                        
                                       
                                         c 
                                         i 
                                       
                                     
                                   
                                   ) 
                                 
                               
                               } 
                             
                              
                             
                               e 
                               
                                 - 
                                 rs 
                               
                             
                              
                             ds 
                           
                         
                         ] 
                       
                     
                   
                 
                 
                   
                     
                       
                         
                           P 
                           . 
                         
                          
                         
                           ( 
                           s 
                           ) 
                         
                       
                       = 
                       
                         k 
                          
                         
                           [ 
                           
                             a 
                             - 
                             
                               
                                 ∑ 
                                 
                                   i 
                                   = 
                                   1 
                                 
                                 n 
                               
                                
                               
                                 
                                   v 
                                   i 
                                 
                                  
                                 
                                   ( 
                                   s 
                                   ) 
                                 
                               
                             
                             - 
                             
                               P 
                                
                               
                                 ( 
                                 s 
                                 ) 
                               
                             
                           
                           ] 
                         
                       
                     
                   
                 
               
               ; 
             
           
         
       
     
         [0219]    Where P(s) represents a gain of unit information of the competing group at an instance s of time; {dot over (P)}(s) represents a derivation operation on P(s); v i (s) represents an access rate to be provided for the user equipment by the i-th access point in the pre-selected competing group at the instance s of time, where i=1, 2, . . . , n, and n represents the number of access points in the pre-selected competing group; h i  represents the number of hops between the user equipment, and the i-th access point in the pre-selected competing group; r represents a discount rate; and v i (s) 2 b i +v i (s)c i  represents the cost of the i-th access point, where b i  and c i  represents preset coefficients. 
         [0220]    Further to any one of the embodiments above, the processing module  62  is configured to determine the access overhead of the competing group by: 
         [0221]    determining the access overhead of each competing group according to a gain of unit information of the competing group, and access rates to be provided for the user equipment by the respective access points in the competing group. 
         [0222]    Optionally, in the first preferred embodiment, the processing module  62  is configured to determine the access overhead of the competing group by determining the access overhead of each competing group according to a gain of unit information of the competing group, and the access rates to be provided for the user equipment by the respective access points in the competing group; 
         [0223]    In the second preferred embodiment, the processing module  62  is configured to determine the access overhead of the competing group by determining an access overhead of each pre-selected competing group according to a gain of unit information of the pre-selected competing group, and access rates to be provided for the user equipment by the respective access points in the pre-selected competing group. 
         [0224]    Optionally the processing module  62  is configured to determine the access overhead of the competing group in the equation of: 
         [0000]    
       
         
           
             
               
                 ∑ 
                 
                   i 
                   = 
                   1 
                 
                 n 
               
                
               
                 
                   ∫ 
                   0 
                   ∞ 
                 
                  
                 
                   
                     P 
                      
                     
                       ( 
                       s 
                       ) 
                     
                   
                    
                   
                     
                       v 
                       i 
                     
                      
                     
                       ( 
                       s 
                       ) 
                     
                   
                    
                   ds 
                 
               
             
             ; 
           
         
       
     
         [0225]    Where P(s) represents a gain of unit information of the competing group at an instance s of time; and v i (s) represents an access rate available from the i-th access point in the competing group at the instance s of time, where i=1, 2, . . . , n, and n represents the number of access points in the competing group. 
         [0226]    Optionally, if the processing module  62  operates in the first preferred embodiment, then P(s) represents a gain of unit information of the competing group at an instance s of time; and v i (s) represents an access rate available from the i-th access point in the competing group at the instance s of time, where i=1, 2, . . . , n, and n represents the number of access points in the competing group in the competing group in the equation above; and 
         [0227]    If the processing module  62  operates the second preferred embodiment, then P(s) represents a gain of unit information of the pre-selected competing group at an instance s of time; and v i (s) represents an access rate available from the i-th access point in the pre-selected competing group at the instance s of time, where i=1, 2, . . . , n, and n represents the number of access points in the competing group in the pre-selected competing group in the equation above. 
         [0228]    Further to any one of the embodiments above, the processing module  62  is further configured: 
         [0229]    To select the target competing group for the accessing user equipment from the competing group according to a demand of the user equipment for a network quality of an access network. 
         [0230]    Here the demand of the user equipment for a network quality of the access network includes but will not be limited to one or more of the following demands: 
         [0231]    A demand of the user equipment for a delay of the access network, for example, the delay of the access network is smaller than a preset delay, etc.; 
         [0232]    A demand of the user equipment for a dithering of the access network, for example, the dithering of the access network is below a preset threshold, etc.; and 
         [0233]    A demand of the user equipment for a packet loss ratio of the access network, for example, the packet loss ratio of the access network is below a preset threshold y, etc. 
         [0234]    Optionally, in the first preferred embodiment, the processing module  62  is further configured to select the target competing group for the accessing user equipment from the competing group according to the demand of the user equipment for the network quality of the access network; that is, the processing module  62  can select a competing group satisfying a preset access overhead condition as the target competing group only according to the access overhead of the competing group into which the access points are grouped by the grouping module  61 ; or the processing module  62  can select a competing group satisfying both a preset access overhead condition, and the demand of the user equipment for the network quality of the access network as the target competing group according to the access overhead of the competing group into which the access points are grouped by the grouping module  61 , and the demand of the user equipment for the network quality of the access network. 
         [0235]    Here the preset access overhead condition can be such that the access overhead is minimum, or the access overhead is below a preset threshold, or lies in a preset threshold range, etc. If there are at least two competing groups, all of which satisfy the preset access overhead condition, then one of the at least two competing groups can be selected randomly as the target competing group. 
         [0236]    In the second preferred embodiment, the processing module  62  is further configured to select the target competing group for the accessing user equipment from the pre-selected competing group according to the demand of the user equipment for the network quality of the access network; that is, the processing module  62  can select a pre-selected competing group satisfying a preset access overhead condition as the target competing group only according to an access overhead of a pre-selected competing group determined by the processing module  62 ; or the processing module  62  can select a competing group satisfying both a preset access overhead condition, and the demand of the user equipment for the network quality of the access network as the target competing group according to an access overhead of a pre-selected competing group determined by the processing module  62 , and the demand of the user equipment for the network quality of the access network. 
         [0237]    Here the preset access overhead condition can be such that the access overhead is minimum, or the access overhead is below a preset threshold, or lies in a preset threshold range, etc. If there are at least two pre-selected competing groups, all of which satisfy the preset access overhead condition, then one of the at least two pre-selected competing groups can be selected randomly as the target competing group. 
         [0238]    A structure of and processing by a communication device according to some embodiments of the invention will be described below in connection with a hardware structure thereof taking a user equipment as an example, where the communication device can be arranged in the user equipment, or can be arranged in another device, e.g., a higher-layer device configured to schedule respective user equipments (e.g., a base station, etc.) 
         [0239]    As illustrated in  FIG. 7 , the communication device includes a transceiver  71 , and at least one processor  72  connected with the transceiver  71 , where: 
         [0240]    The transceiver  71  is configured to communicate data with another device; and 
         [0241]    The processor  72  is configured to group access points, which can serve a user equipment, into at least one competing group; and to determine an access overhead of the competing group, and to select a target competing group for the accessing user equipment from the competing group according to the determined access overhead. 
         [0242]    In some embodiments, the processor  72  is configured: 
         [0243]    To group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points served by the same operator do not compete with each other, where respective access points served by the same operator are grouped into different competing groups; or 
         [0244]    To group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points, operating with the same access technology, served by the same operator do not compete with each other, where respective access points, operating with the same access technology, served by the same operator are grouped into different competing groups; or 
         [0245]    To group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points in a preset distance range do not compete with each other, where the respective access points in the preset distance range are grouped into different competing groups; or 
         [0246]    To group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points operating with the same access technology do not compete with each other, where respective access points operating with the same access technology are grouped into different competing groups; or 
         [0247]    To group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points where a difference between currently available access rates of each of the access points are above a preset threshold, do not compete with each other, where the access points where a difference between currently available access rates of each of the access points are above the preset threshold, are grouped into different competing groups; or 
         [0248]    To group the access points, which can serve the user equipment, into the at least one competing group under such a principle that access points, which currently can provide such access rates that the differences between the access rates and a preset access rate reference value lie in a preset threshold range, shall compete with each other, where the access points, which currently can provide such access rates that the differences between the access rates and the preset access rate reference value lie in the preset threshold range are grouped into the same competing group; or 
         [0249]    To group randomly the access points, which can serve the user equipment, into the at least one competing group. 
         [0250]    In some embodiments, in a first preferred embodiment, the processor  72  is configured, for all the competing groups into which the access points are grouped: 
         [0251]    To determine the access overhead of each competing group, and to select the target competing group for the accessing user equipment from the competing groups according to the determined access overhead. 
         [0252]    In a second preferred embodiment, the processor  72  is configured: 
         [0253]    For each competing group, to determine access rates to be provided for the user equipment by the respective access points in the competing group respectively, and if all the access rates currently available from the respective access points in the competing group are equal to or greater than the access rates to be provided for the user equipment by the respective access points, to determine the competing group as a pre-selected competing group; and to determine an access overhead of each pre-selected competing group, and to select the target competing group for the accessing user equipment from the pre-selected competing groups according to the determined access overheads. 
         [0254]    In this preferred embodiment, the processor  72  firstly screens out the competing groups into which the access points are grouped by the processor  72 , and determines the competing groups satisfying the condition (that is, all the access rates currently available from the respective access points in the competing group are equal to or greater than the access rates to be provided for the user equipment by the respective access points) as the pre-selected competing groups; and further determines the access overhead of each pre-selected competing group, and selects the target competing group for the accessing user equipment from the pre-selected competing groups according to the determined access overheads to thereby improve the efficiency of processing. 
         [0255]    In this preferred embodiment, the processor  72  is further configured, for each competing group, if the access rate currently available from at least one access point in the competing group is less than the access rate to be provided for the user equipment by the access point, to discard the competing group. 
         [0256]    Optionally for each competing group, the processor  72  detects in real time the access rates currently available from the respective access points in the competing group according to network load conditions of the respective access points, and if all the access rates currently available from the respective access points in the competing group are equal to or greater than the access rates to be provided for the user equipment by the respective access points, then the processor  72  will determine the competing group as the pre-selected competing group, and calculate the access overhead of the pre-selected competing group; otherwise, that is, if the access rate currently available from at least one access point in the competing group is less than the access rate to be provided for the user equipment by the access point, then the processor  72  will discard the competing group. 
         [0257]    In some embodiments, for each competing group, the processor  72  is configured: 
         [0258]    For each competing group, to determine the access rates to be provided for the user equipment by the respective access points in the competing group respectively under such a principle that net gains of the respective access points in the competing group are maximized. 
         [0259]    Optionally for each competing group, the processor  72  is configured to determine the access rates to be provided for the user equipment by the respective access points in the competing group respectively in the following differential gaming model: 
         [0000]    
       
         
           
             { 
             
               
                 
                   
                     
                       Max 
                        
                       
                         [ 
                         
                           
                             ∫ 
                             0 
                             ∞ 
                           
                            
                           
                             
                               { 
                               
                                 
                                   
                                     1 
                                     
                                       h 
                                       i 
                                     
                                   
                                    
                                   
                                     P 
                                      
                                     
                                       ( 
                                       s 
                                       ) 
                                     
                                   
                                    
                                   
                                     
                                       v 
                                       i 
                                     
                                      
                                     
                                       ( 
                                       s 
                                       ) 
                                     
                                   
                                 
                                 - 
                                 
                                   ( 
                                   
                                     
                                       
                                         
                                           
                                             v 
                                             i 
                                           
                                            
                                           
                                             ( 
                                             s 
                                             ) 
                                           
                                         
                                         2 
                                       
                                        
                                       
                                         b 
                                         i 
                                       
                                     
                                     + 
                                     
                                       
                                         
                                           v 
                                           i 
                                         
                                          
                                         
                                           ( 
                                           s 
                                           ) 
                                         
                                       
                                        
                                       
                                         c 
                                         i 
                                       
                                     
                                   
                                   ) 
                                 
                               
                               } 
                             
                              
                             
                               e 
                               
                                 - 
                                 rs 
                               
                             
                              
                             ds 
                           
                         
                         ] 
                       
                     
                   
                 
                 
                   
                     
                       
                         
                           P 
                           . 
                         
                          
                         
                           ( 
                           s 
                           ) 
                         
                       
                       = 
                       
                         k 
                          
                         
                           [ 
                           
                             a 
                             - 
                             
                               
                                 ∑ 
                                 
                                   i 
                                   = 
                                   1 
                                 
                                 n 
                               
                                
                               
                                 
                                   v 
                                   i 
                                 
                                  
                                 
                                   ( 
                                   s 
                                   ) 
                                 
                               
                             
                             - 
                             
                               P 
                                
                               
                                 ( 
                                 s 
                                 ) 
                               
                             
                           
                           ] 
                         
                       
                     
                   
                 
               
               ; 
             
           
         
       
     
         [0260]    Where P(s) represents a gain of unit information of the competing group at an instance s of time; P(s) represents a derivation operation on P(s); v i (s) represents an access rate to be provided for the user equipment by the i-th access point in the pre-selected competing group at the instance s of time, where i=1, 2, . . . , n, and n represents the number of access points in the pre-selected competing group; h i  represents the number of hops between the user equipment, and the i-th access point in the pre-selected competing group; r represents a discount rate; and v i (s) 2 b i +v i (s)c i  represents the cost of the i-th access point, where b i  and c i  represents preset coefficients. 
         [0261]    Further to any one of the embodiments above, the processor  72  is configured to determine the access overhead of the competing group by: 
         [0262]    determining the access overhead of each competing group according to a gain of unit information of the competing group, and access rates to be provided for the user equipment by the respective access points in the competing group. 
         [0263]    Optionally in the first preferred embodiment, the processor  72  is configured to determine the access overhead of the competing group by determining the access overhead of each competing group according to a gain of unit information of the competing group, and the access rates to be provided for the user equipment by the respective access points in the competing group; 
         [0264]    In the second preferred embodiment, the processor  72  is configured to determine the access overhead of the competing group by determining an access overhead of each pre-selected competing group according to a gain of unit information of the pre-selected competing group, and access rates to be provided for the user equipment by the respective access points in the pre-selected competing group. 
         [0265]    Optionally the processor  72  is configured to determine the access overhead of the competing group in the equation of: 
         [0000]    
       
         
           
             
               
                 ∑ 
                 
                   i 
                   = 
                   1 
                 
                 n 
               
                
               
                 
                   ∫ 
                   0 
                   ∞ 
                 
                  
                 
                   
                     P 
                      
                     
                       ( 
                       s 
                       ) 
                     
                   
                    
                   
                     
                       v 
                       i 
                     
                      
                     
                       ( 
                       s 
                       ) 
                     
                   
                    
                   ds 
                 
               
             
             ; 
           
         
       
     
         [0266]    Where P(s) represents a gain of unit information of the competing group at an instance s of time; and v i (s) represents an access rate available from the i-th access point in the competing group at the instance s of time, where i=1, 2, . . . , n, and n represents the number of access points in the competing group. 
         [0267]    Optionally, if the processor  72  operates in the first preferred embodiment, then P(s) represents a gain of unit information of the competing group at an instance s of time; and v i (s) represents an access rate available from the i-th access point in the competing group at the instance s of time, where i=1, 2, . . . , n, and n represents the number of access points in the competing group in the competing group in the equation above; and 
         [0268]    If the processor  72  operates the second preferred embodiment, then P(s) represents a gain of unit information of the pre-selected competing group at an instance s of time; and v i (s) represents an access rate available from the i-th access point in the pre-selected competing group at the instance s of time, where i=1, 2, . . . , n, and n represents the number of access points in the competing group in the pre-selected competing group in the equation above. 
         [0269]    Further to any one of the embodiments above, the processor  72  is further configured: 
         [0270]    To select the target competing group for the accessing user equipment from the competing group according to a demand of the user equipment for a network quality of an access network. 
         [0271]    Here the demand of the user equipment for a network quality of the access network includes but will not be limited to one or more of the following demands: 
         [0272]    A demand of the user equipment for a delay of the access network, for example, the delay of the access network is smaller than a preset delay, etc.; 
         [0273]    A demand of the user equipment for a dithering of the access network, for example, the dithering of the access network is below a preset threshold, etc.; and 
         [0274]    A demand of the user equipment for a packet loss ratio of the access network, for example, the packet loss ratio of the access network is below a preset threshold, etc. 
         [0275]    Optionally, in the first preferred embodiment, the processor  72  is further configured to select the target competing group for the accessing user equipment from the competing group according to the demand of the user equipment for the network quality of the access network; 
         [0276]    that is, the processor  72  can select a competing group satisfying a preset access overhead condition as the target competing group only according to the access overhead of the competing group into which the access points are grouped by the processor  72 ; or the processor  72  can select a competing group satisfying both a preset access overhead condition, and the demand of the user equipment for the network quality of the access network as the target competing group according to the access overhead of the competing group into which the access points are grouped by the processor  72 , and the demand of the user equipment for the network quality of the access network. 
         [0277]    Here the preset access overhead condition can be such that the access overhead is minimum, or the access overhead is below a preset threshold, or lies in a preset threshold range, etc. If there are at least two competing groups, all of which satisfy the preset access overhead condition, then one of the at least two competing groups can be selected randomly as the target competing group. 
         [0278]    In the second preferred embodiment, the processor  72  is further configured to select the target competing group for the accessing user equipment from the pre-selected competing group according to the demand of the user equipment for the network quality of the access network; that is, the processor  72  can select a pre-selected competing group satisfying a preset access overhead condition as the target competing group only according to an access overhead of a pre-selected competing group determined by the processor  72 ; or the processor  72  can select a competing group satisfying both a preset access overhead condition, and the demand of the user equipment for the network quality of the access network as the target competing group according to an access overhead of a pre-selected competing group determined by the processor  72 , and the demand of the user equipment for the network quality of the access network. 
         [0279]    Here the preset access overhead condition can be such that the access overhead is minimum, or the access overhead is below a preset threshold, or lies in a preset threshold range, etc. If there are at least two pre-selected competing groups, all of which satisfy the preset access overhead condition, then one of the at least two pre-selected competing groups can be selected randomly as the target competing group. 
         [0280]    Those skilled in the art shall appreciate that the embodiments of the invention can be embodied as a method, a system or a computer program product. Therefore the invention can be embodied in the form of an all-hardware embodiment, an all-software embodiment or some embodiments of software and hardware in combination. Furthermore the invention can be embodied in the form of a computer program product embodied in one or more computer useable storage mediums (including but not limited to a disk memory, a CD-ROM, an optical memory, etc.) in which computer useable program codes are contained. 
         [0281]    The invention has been described in a flow chart and/or a block diagram of the method, the device (system) and the computer program product according to the embodiments of the invention. It shall be appreciated that respective flows and/or blocks in the flow chart and/or the block diagram and combinations of the flows and/or the blocks in the flow chart and/or the block diagram can be embodied in computer program instructions. These computer program instructions can be loaded onto a general-purpose computer, a specific-purpose computer, an embedded processor or a processor of another programmable data processing device to produce a machine so that the instructions executed on the computer or the processor of the other programmable data processing device create means for performing the functions specified in the flow(s) of the flow chart and/or the block(s) of the block diagram. 
         [0282]    These computer program instructions can also be stored into a computer readable memory capable of directing the computer or the other programmable data processing device to operate in a specific manner so that the instructions stored in the computer readable memory create an article of manufacture including instruction means which perform the functions specified in the flow(s) of the flow chart and/or the block(s) of the block diagram. 
         [0283]    These computer program instructions can also be loaded onto the computer or the other programmable data processing device so that a series of operational steps are performed on the computer or the other programmable data processing device to create a computer implemented process so that the instructions executed on the computer or the other programmable device provide steps for performing the functions specified in the flow(s) of the flow chart and/or the block(s) of the block diagram. 
         [0284]    Although the preferred embodiments of the invention have been described, those skilled in the art benefiting from the underlying inventive concept can make additional modifications and variations to these embodiments. Therefore the appended claims are intended to be construed as encompassing the preferred embodiments and all the modifications and variations coming into the scope of the invention. 
         [0285]    Evidently those skilled in the art can make various modifications and variations to the invention without departing from the spirit and scope of the invention. Thus the invention is also intended to encompass these modifications and variations thereto so long as the modifications and variations come into the scope of the claims appended to the invention and their equivalents.