Patent ID: 11956307
Assignee: CHONGQING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS
Field: Digital communication (Electrical engineering)
Classification: CPC H  Y | IPC H

Claim 2:
3. The distributed task offloading and computing resources management method based on energy harvesting according to claim 2, wherein in the device maximum benefit objective function for the device based on the perturbation Lyapunov optimization algorithm, the i-th mobile device is capable of performing task computing locally only in a case that fi0L(t)≤fi0U(t), and if the i-th mobile device is capable of performing task computing locally, an optimal local execution strategy is expressed as:, f
   
    i
    ⁢
    0
   
   *
  
  =
  
   {
   
    
     
      
       
        
         f
         
          i
          ⁢
          0
         
         L
        
        (
        t
        )
       
       ,
       
        
         
          
           B
           ~
          
          i
         
         (
         t
         )
        
        <
        0
       
       ,
       
        
         
          f
          
           i
           ⁢
           0
          
          M
         
         (
         t
         )
        
        ≤
        
         
          f
          
           i
           ⁢
           0
          
          L
         
         (
         t
         )
        
       
      
     
    
    
     
      
       
        
         f
         
          i
          ⁢
          0
         
         M
        
        (
        t
        )
       
       ,
       
        
         
          f
          
           i
           ⁢
           0
          
          L
         
         (
         t
         )
        
        ≤
        
         
          f
          
           i
           ⁢
           0
          
          M
         
         (
         t
         )
        
        ≤
        
         
          f
          
           i
           ⁢
           0
          
          U
         
         (
         t
         )
        
       
      
     
    
    
     
      
       
        f
        
         i
         ⁢
         0
        
        U
       
       ,
       
        
         
          
           B
           ~
          
          i
         
         (
         t
         )
        
        ≥
        
         0
         ⁢
            
         or
         ⁢
            
         
          
           
            B
            ~
           
           i
          
          (
          t
          )
         
        
        <
        0
       
       ,
       
        
         
          f
          
           i
           ⁢
           0
          
          M
         
         (
         t
         )
        
        ≥
        
         
          f
          
           i
           ⁢
           0
          
          L
         
         (
         t
         )
        
       
      
     
    
   
  
 

where f*i0 represents the optimal local execution strategy;, f
     
      i
      ⁢
      0
     
     M
    
    (
    t
    )
   
   =
   
    -
    
     
      A
      +
      
       
        
         A
         2
        
        -
        
         8
         ⁢
         
          
           
            B
            ~
           
           i
          
          (
          t
          )
         
         ⁢
         
          k
          i
         
         ⁢
         
          τ
          ⁡
          (
          
           
            
             Q
             i
            
            (
            t
            )
           
           +
           
            
             
              V
              i
             
             ⁢
             
              ρ
              i
             
            
            
             ln
             ⁢
               
             2
            
           
          
          )
         
        
       
      
     
     
      4
      ⁢
      
       
        
         B
         ~
        
        i
       
       (
       t
       )
      
      ⁢
      
       k
       i
      
      ⁢
      τ
     
    
   
  
  ;, {tilde over (B)}i(t) represents the virtual energy queue of the battery of the i-th mobile device; ki represents an effective energy coefficient related to a chip architecture of the i-th mobile device; τ represents a length of each of the time slots; Vi represents a nonnegative controllable parameter; Qi(t) represents the task queue backlog of the i-th mobile device in the time slot t; ρi represents a benefit weight factor of the i-th mobile device;, A
   =
   
    
     2
     ⁢
     
      
       
        B
        ~
       
       i
      
      (
      t
      )
     
     ⁢
     
      k
      i
     
     ⁢
     
      γ
      i
     
    
    +
    
     
      
       Q
       i
      
      (
      t
      )
     
     ⁢
     
      τ
      
       γ
       i
      
     
    
   
  
  ,, where γi represents a computation density obtained by performing offline measurement.