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

Claim 1:
2. The distributed task offloading and computing resources management method based on energy harvesting according to claim 1, wherein the device maximum benefit objective function for the device based on the perturbation Lyapunov optimization algorithm is expressed as:, max
    
     
      
       I
       i
      
      (
      t
      )
     
     ,
     
      
       b
       i
      
      (
      t
      )
     
     ,
     
      
       e
       i
       h
      
      (
      t
      )
     
    
   
   
    
     U
     
      b
      i
     
    
    (
    t
    )
   
  
  =
  
   
    
     V
     i
    
    ⁢
    
     
      u
      
       b
       i
      
     
     (
     t
     )
    
   
   +
   
    
     
      Q
      i
     
     (
     t
     )
    
    [
    
     
      
       b
       i
      
      (
      t
      )
     
     -
     
      
       a
       i
      
      (
      t
      )
     
    
    ]
   
   +
   
    
     
      B
      i
     
     (
     t
     )
    
    [
    
     
      
       e
       
        i
        ⁢
        0
       
       t
      
      (
      t
      )
     
     -
     
      
       e
       i
       h
      
      (
      t
      )
     
    
    ]
   
  
 

and constraints comprise:, 0
  ≤
  
   
    e
    i
    h
   
   (
   t
   )
  
  ≤
  
   
    δ
    i
   
   (
   t
   )
  
 

 
  
   E
   i
   min
  
  ≤
  
   
    e
    10
    t
   
   (
   t
   )
  
  ≤
  
   max
   ⁢
   
    {
    
     
      E
      i
      max
     
     ,
     
      
       B
       i
      
      (
      t
      )
     
    
    }
   
  
  <
  ∞
 

 
  
   0
   ≤
   
    
     ∑
     
      ∀
      
       j
       ^
      
     
    
     
    
     
      b
      
       i
       ⁢
       
        j
        ^
       
      
     
     (
     t
     )
    
   
   ≤
   
    
     Q
     i
    
    (
    t
    )
   
  
  ,
  
   ∀
   
    i
    ∈
    M
   
  
  ,
  
   
    j
    ^
   
   ∈
   
    {
    
     0
     ,
     N
    
    }
   
  
 

 
  
   
    f
    
     j
     ^
    
    min
   
   ≤
   
    
     f
     
      i
      ⁢
      
       j
       ^
      
     
    
    (
    t
    )
   
   ≤
   
    f
    
     j
     ^
    
    max
   
  
  ,
  
   ∀
   
    i
    ∈
    M
   
  
  ,
  
   
    j
    ^
   
   ∈
   
    {
    
     0
     ,
     N
    
    }
   
  
 

 
  
   
    Q
    _
   
   i
  
  =
  
   
    
     lim
     
      T
      →
      ∞
     
    
    
     sup
     ⁢
     
      1
      T
     
     ⁢
     
      
       ∑
       
        t
        =
        0
       
       
        T
        -
        1
       
      
       
      
       E
       ⁢
       
        {
        
         
          Q
          i
         
         (
         t
         )
        
        }
       
      
     
    
   
   <
   ∞
  
 

where Ii(t)={Ii0(t), Ii1(t), . . . , Iin(t)} representing a set of task offloading strategies of an i-th mobile device; Ii0(t) represents a local offloading strategy of the i-th mobile device; Iij(t) represents an offloading strategy of the i-th mobile device performing task offloading to a j-th mobile edge computing server, where jϵ{1, 2, . . . , n}; bi(t)={bi0(t), bi1(t), . . . , bin(t)} representing a set of processing task size strategies of the i-th mobile device; bi0(t) represents a local processing task size strategy of the i-th mobile device′; bijt) represents a processing task size strategy of the i-th mobile device performing task offloading to the j-th mobile edge computing server; Ubi(t) represents a device maximum benefit objective function of the i-th mobile device based on the perturbation Lyapunov optimization algorithm; Vi represents a non-negative controllable parameter of the i-th mobile device; ubi(t) represents a maximum benefit function of the i-th mobile device; Qi(t) represents an task queue backlog of the i-th mobile device in a time slot t;, b
    i
   
   (
   t
   )
  
  =
  
   
    ∑
    
     j
     =
     0
    
    N
   
   
    
     b
     ij
    
    (
    t
    ), representing a sum of tasks processed by the i-th mobile device in the time slot t; ai(t) represents the size of tasks of the i-th mobile device arrived in the time slot t; {tilde over (B)}i(t) represents a virtual energy queue of a battery of the i-th mobile device; ei0t(t) represents total energy consumption of the i-th mobile device in the time slot t; eih(t) represents energy charged to the battery of the i-th mobile device in the time slot t; δi(t) represents energy harvested by the i-th mobile device in the time slot t; Eimin represents a minimum battery discharge of the i-th mobile device in each of time slots; Eimax represents a maximum battery discharge of the i-th mobile device in each of the time slots; B (t) represents an energy level of the battery of the i-th mobile device at a beginning of the time slot t; biĵ(t) represents the size of task locally processed by the i-th mobile device or offloaded by the i-th mobile device to a ĵ-th mobile edge computing server, where ĵϵ{0,1, . . . , N}; M represents a set of mobile devices; N represents a set of mobile edge computing servers; fĵmin represents a local CPU minimum frequency or a CPU minimum frequency of the ĵ-th mobile edge computing server; fiĵ(t) represents a local CPU frequency or a CPU frequency of the ĵ-th mobile edge computing server allocated for the i-th mobile device; fĵmax represents a maximum local CPU frequency or a maximum CPU frequency of the ĵ-th mobile edge computing server; and T represents an index of a time slot.