Patent ID: 11943114
Assignee: SHANDONG UNIVERSITY
Field: Digital communication (Electrical engineering)
Classification: CPC H  Y | IPC H

Claim 2:
3. The active edge caching method based on community discovery and weighted federated learning according to claim 1, wherein dividing users into different user groups by using a Louvain community discovery algorithm comprises:
A. treating each node in the D2D content sharing graph g as an independent community;
B. assigning each node in turn to a community where its neighbor nodes are located, computing a modularity change ΔQ before and after assigning, recording a neighbor node maxΔQ with maximum ΔQ, and assigning the node to a community where the neighbor node with maximum ΔQ is located if maxΔQ>0, otherwise remaining the node unchanged, wherein ΔQ is computed by formula (I):, Δ
       ⁢
       
        Q
        
         u
         →
         
          𝒞
          i
         
        
       
      
      =
      
       [
       
        
         
          
           A
           
            u
            ,
            v
           
          
          +
          
           a
           
            u
            →
            
             𝒞
             i
            
           
          
         
         
          2
          ⁢
          m
         
        
        -
        
         
          (
          
           
            
             a
             
              𝒞
              i
             
            
            +
            
             a
             ⁡
             (
             u
             )
            
           
           
            2
            ⁢
            m
           
          
          )
         
         2
        
       
       ]
      
     
     ,
    
   
   
    
     (
     I
     )
    
   
  
 

 
  
   -
   
    [
    
     
      
       A
       
        u
        ,
        v
       
      
      
       2
       ⁢
       m
      
     
     -
     
      
       (
       
        
         a
         
          𝒞
          i
         
        
        
         2
         ⁢
         m
        
       
       )
      
      2
     
     -
     
      
       (
       
        
         a
         ⁡
         (
         u
         )
        
        
         2
         ⁢
         m
        
       
       )
      
      2
     
    
    ]
   
  
  ,
 

 
  =
  
   
    
     a
     
      u
      →
      
       𝒞
       i
      
     
    
    
     2
     ⁢
     m
    
   
   -
   
    
     
      a
      
       𝒞
       i
      
     
     ×
     
      a
      ⁡
      (
      u
      )
     
    
    
     2
     ⁢
     
      m
      2
     
    
   
  
 

wherein, m=Σεu,v is a sum of all edge weights in the D2D content sharing graph g; Au,v=ΣcEu,v, ∀u, v∈Ci is a sum of edge weights between all nodes in community Ci; aCi represents a sum of weights of connecting edges between community Ci and other communities; au→Ci is a sum of edge weights between all nodes after node u is moved into community Ci; a(u) is a sum of weights of all edges connected to node u;
C. repeating step B until the communities of all nodes do not change;
D. compressing the nodes in the same community into a new node to convert the edge weights between nodes within the community into an edge weight of the new node and convert the edge weights between communities into edge weights between new nodes; and
E. repeating steps A-D until the modularity of the entire D2D content sharing graph g does not change.