Patent ID: 11902088
Assignee: CHANG'AN UNIVERSITY
Field: Digital communication (Electrical engineering)
Classification: CPC H  G | IPC G  H

Claim 1:
2. The method for selecting an optimal edge computing node in an IoV environment according to claim 1, wherein the assigning weights to different types of matching degrees in step 3 comprises:
respectively computing a mean and a variance for each of Dj, Cj, Tjmax according to the properties Tj={Dj, Cj, Tjmax}j∈M of the computing tasks,
wherein for the data volumes Dj of the computing tasks and the numbers Cj of CPU cycles required by the computing tasks, the Dj and Cj each have a demand degree OD, OC of 3 if being greater than or equal to a sum of a mean and a variance thereof; the Dj and Cj each have a demand degree OD, OC of 2 if being between the sum of the mean and the variance thereof and a difference between the mean and the variance thereof; and the Dj and Cj each have a demand degree OD, OC of 1 if being less than or equal to the difference between the mean and the variance thereof
wherien for the maximum time Tjmax required to complete the tasks, the Tjmax has a demand degree OT of 3 if being less than or equal to a difference between a mean and a variance thereof; the Tjmax has a demand degree OT of 2 if being between a sum of the mean and the variance thereof and the difference between the mean and the variance thereof; and the Tjmax has a demand degree OT of 1 if being greater than or equal to the sum of the mean and the variance thereof;
wherein distances toward base stations of the edge computing nodes for each of the computing tasks have a demand degree OR of 2;
Dj, Cj, Tjmax respectively correspond to a transmission speed demand, an execution speed demand and a task completion time demand, with corresponding matching degrees of Jij, Kij, Lij;
and after the demand degrees OD, OC, OT, OR are obtained, weights wR, wJ, wK, wL are computed according to equations:, w
    J
   
   =
   
    
     O
     D
    
    
     
      O
      D
     
     +
     
      O
      C
     
     +
     
      O
      T
     
     +
     
      O
      R
     
    
   
  
  ⁢
  

  
   
    w
    K
   
   =
   
    
     O
     C
    
    
     
      O
      D
     
     +
     
      O
      C
     
     +
     
      O
      T
     
     +
     
      O
      R
     
    
   
  
  ⁢
  

  
   
    w
    L
   
   =
   
    
     O
     T
    
    
     
      O
      D
     
     +
     
      O
      C
     
     +
     
      O
      T
     
     +
     
      O
      R
     
    
   
  
  ⁢
  

  
   
    
     w
     R
    
    =
    
     
      O
      R
     
     
      
       O
       D
      
      +
      
       O
       C
      
      +
      
       O
       T
      
      +
      
       O
       R
      
     
    
   
   ,
  
 

wherein OD, OC, OT, OR respectively represent the transmission speed demand, the execution speed demand, the task completion time demand and the distance demand, and proportions of the OD, OC, OT, OR in a total demand are the weights of the matching degrees Jij, Kij, Lij, Rij; and
an equation for computing comprehensive matching degrees is:

Zij=RijwR+JijwJ+KijwK+LijwL.