| CPC H04L 67/12 (2013.01) [H04L 67/568 (2022.05)] | 6 Claims |
|
1. A vehicle-mounted heterogeneous network collaborative task unloading method based on smart lamp posts, comprising the following steps:
S1: acquiring coordinates of vehicles required for task unloading in a street and a cache required for the task unloading;
S2: acquiring coordinates of smart lamp posts in the street, and preloading caches required for unloading a vehicle task at random for each of the smart lamp posts;
S3: calculating 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 a cloud center, if so, the vehicle i unloads the task to the smart lamp post network, otherwise, unloads the task to the cloud center;
S4: taking profit of a single smart lamp post itself as an index for the smart lamp post terminal, dividing the smart lamp post network into a plurality of coalitions, taking the profit maximization of the coalition as an optimization objective, optimizing a smart lamp post combination in the coalition, and outputting an optimal coalition combination; wherein the step S4 specifically 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 S, 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; 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 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;
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:
 |