US 11,902,088 B2
Method and system for selecting optimal edge computing node in internet of vehicle environment
Hui Hu, Xi'an (CN); Chaofeng Chen, Xi'an (CN); Fuxin Liu, Xi'an (CN); Yanhui Wang, Xi'an (CN); and Zhiyu Feng, Xi'an (CN)
Assigned to Chang'an University, (CN)
Appl. No. 17/755,570
Filed by Chang'an University, Xi'an (CN)
PCT Filed Mar. 29, 2021, PCT No. PCT/CN2021/083482
§ 371(c)(1), (2) Date May 2, 2022,
PCT Pub. No. WO2021/197245, PCT Pub. Date Oct. 7, 2021.
Claims priority of application No. 202010247198.9 (CN), filed on Mar. 31, 2020.
Prior Publication US 2023/0040264 A1, Feb. 9, 2023
Int. Cl. G06F 15/173 (2006.01); H04L 41/0803 (2022.01); G06F 9/50 (2006.01); G08G 1/01 (2006.01); H04L 67/12 (2022.01)
CPC H04L 41/0803 (2013.01) [G06F 9/5027 (2013.01); G08G 1/0125 (2013.01); H04L 67/12 (2013.01)] 8 Claims
OG exemplary drawing
 
1. A method for selecting an optimal edge computing node in an Internet of vehicle (IoV) environment, comprising the following steps:
step 1: acquiring and analyzing properties of computing tasks of a vehicle in the IoV environment as well as properties of different edge computing nodes;
step 2: computing matching degrees between the properties of the computing tasks of the vehicle and the properties of the edge computing nodes, wherein a data volume of each of the computing tasks of the vehicle is matched with data transmission speeds of the edge computing nodes, and a number of central processing unit (CPU) cycles required by each of the computing tasks of the vehicle is matched with computing resources allocated by the edge computing nodes;
step 3: analyzing computing demands of different computing tasks, assigning weights to different types of matching degrees, and computing comprehensive matching degrees; and
step 4: comparing the comprehensive matching degrees in step 3, and selecting an optimal edge computing node according to a comparison result to compute each of the computing tasks of the vehicle,
wherein, in step 1, the properties of the computing tasks of the vehicle comprise: data volumes Dj of the computing tasks, numbers Cj of CPU cycles required by the computing tasks, maximum time Tjmax required to complete the tasks, and distances rij between the vehicle and the nodes;
the properties of the edge computing nodes comprise bandwidths Bj of the edge computing nodes, percentages bij of time slots allocated by the edge computing nodes to the vehicle in unit time, computing resources fij allocated by the edge computing nodes to the vehicle, and average signal-to-noise ratios (SNRs)

OG Complex Work Unit Math
after the edge computing nodes are connected to the vehicle;
wherein matching the properties of the tasks with the properties of the nodes in step 2 specifically comprises:
matching the data volume of each of the computing tasks of the vehicle with the data transmission speeds of the edge computing nodes, to obtain matching degrees

OG Complex Work Unit Math
between the data volume of each of the computing tasks of the vehicle and the data transmission speeds of the edge computing nodes,
wherein, the data transmission speeds vij of the edge computing nodes are computed according to an equation

OG Complex Work Unit Math
and transmission time of all base stations for a data volume of each of computing tasks of a vehicle j is computed according to an equation

OG Complex Work Unit Math
to obtain minimum transmission time tijS min for each of the computing task of the vehicle j, with an equation of tijS min=min {t1jS, t2jS, t3jS . . . tnjS};
matching the number of CPU cycles required by each of the computing tasks of the vehicle with the computing resources allocated by the edge computing nodes, to obtain matching degrees

OG Complex Work Unit Math
between the number of CPU cycles required by each of the computing tasks of the vehicle and the computing resources allocated by the edge computing nodes,
wherein execution time of all base stations for the data volume of each of the computing tasks of the vehicle j is computed according to an equation

OG Complex Work Unit Math
to obtain minimum transmission time tijE min=min {t1jE, t2jE, t3jE . . . tnjE} for each of the computing task of the vehicle j;
matching maximum completion time for each of the computing tasks of the vehicle with time required by the nodes to compute the task, an equation for computing matching degrees Lij being

OG Complex Work Unit Math
wherein time tij required to complete each of the tasks is computed according to an equation

OG Complex Work Unit Math
and
computing matching degrees with the distances rij between the vehicle and the nodes and a maximum distance rijmax=max{r1j, r2j, r3j . . . rnj} according to an equation

OG Complex Work Unit Math