Patent ID: 11930080
Assignee: HUNAN UNIVERSITY
Field: Digital communication (Electrical engineering)
Classification: CPC H | IPC H

Claim 5:
6. A vehicle-mounted heterogeneous network collaborative task unloading system based on smart lamp posts, comprising:
a first information collection module configured to acquire coordinates of vehicles required for task unloading in a street and a cache required for the task unloading;
a second information collection module configured to acquire coordinates of vehicles required for task unloading in a street and preload caches required for unloading a vehicle task at random for each of the smart lamp posts; and
a vehicle terminal configured to calculate a communication delay Dijkn[t] when the vehicle i requests a cache j from a smart lamp post kn;
Dijkn[t]=Di(t)+Dq[t], in the formula, Di(t) is a communication time of the cache j and Dq[t] is a queuing delay of the cache j; traversing all the caches required for unloading a vehicle i task, taking the maximum communication delay in all the caches as the communication delay between the vehicle i and the smart lamp post network, and determining whether the communication delay between the vehicle i and the smart lamp post network is less than the time for the vehicle i to send a request to the cloud center, if so, the vehicle i unloads the task to the smart lamp post, otherwise, unloads the task to the cloud center;
a smart lamp pole terminal configured to take profit of a single smart lamp post itself as an index for the smart lamp post terminal, divide the smart lamp post network into a plurality of coalitions, take the profit maximization of the coalition as an optimization objective, optimize smart lamp post combination in the coalition, and output the optimal coalition combination, wherein the optimization process comprises the following steps:
S41: taking the profit of the single smart lamp post itself as the index, and dividing the smart lamp post network into a plurality of coalitions;
S42: assuming that the smart lamp post k joins a coalition S, calculating the profit of the smart lamp post k after joining the coalition, wherein the calculation process is expressed as:

V(S)=Hk−Rk−Wk;

in the formula, V(S) represents profit of a smart lamp post k after the smart lamp post k joins the coalition S; Hk represents income available to the smart lamp post k; Rk represents costs required for the smart lamp post k to load a cache; Wk represents communication costs generated when the smart lamp post k cooperates with other smart lamp posts; wherein:
Hk=Σi∈Mhj/Dijkn[t], in the formula, M represents a total number of vehicles in the street; hj represents income that can be obtained by the cache j in the smart lamp post k;
Rk=Σj∈krj, in the formula, rj represents costs required for the smart lamp post k to load the cache j;
Wk=Dj(t)*w, in the formula, w represents a communication cost weight;
S43: if the profit of the smart lamp post k after joining the coalition S is greater than 0, the smart lamp post k can join the coalition S, otherwise, the smart lamp post k cannot join the coalition S;
S44: constructing an optimization model, taking the profit maximization of the coalition as an optimization objective, optimizing the members of the smart lamp posts in the coalition, and outputting an optimal coalition combination, wherein the optimization model is expressed as:, MaxsizeV
   ⁡
   (
   S
   )
  
  =
  
   
    
     ∑
     
      k
      ∈
      S
     
    
    
     H
     k
    
   
   -
   
    R
    k
   
   -
   
    
     W
     k
    
    .