Method and system for selecting optimal edge computing node in internet of vehicle environment

A system for selecting an optimal edge computing node in an Internet of vehicle (IoV) environment, comprising:

• a property acquisition module, configured to acquire properties of computing tasks of a vehicle in the IoV environment as well as properties of different edge computing nodes, wherein the properties of the computing tasks of the vehicle comprise:
• data volumes Dj of the computing tasks, numbers Cj of central processing unit (CPU) cycles required by the computing tasks, maximum time Tjmax required to complete the tasks, and distances rij between the vehicle and the nodes;
• and 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)
• S
• N
• after the edge computing nodes are connected to the vehicle;
• a matching degree acquisition module, configured to compute 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 the data transmission speeds of the edge computing nodes, and a number of CPU cycles required by each of the computing tasks of the vehicle is matched with the computing resources allocated by the edge computing nodes;
• a comprehensive matching degree acquisition module, configured to analyze computing demands of different computing tasks, assign weights to different types of matching degrees, and compute comprehensive matching degrees;
• and
• a comparison and selection module, configured to compare the comprehensive matching degrees acquired by the comprehensive matching degree acquisition module, and select an optimal edge computing node according to a comparison result to compute each of the computing tasks of the vehicle;
• wherein
• the matching degree acquisition module comprises:
• a first acquisition module, configured to match 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
• J
• ij
• =
• t
• ij
• Smin
• t
• ij
• S
• ,
• J
• ij
• ∈
• (
• 0
• ,
• 1
• )
• 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
• v
• ij
• =
• b
• ij
• ⁢
• v
• j
• =
• b
• ij
• ⁢
• B
• j
• ⁢
• log
• 2
• (
• 1
• +
• S
• N
• )
• ;
• 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
• t
• ij
• S
• =
• D
• j
• v
• ij
• to obtain minimum transmission time tijS min for each of the computing tasks of the vehicle j, with an equation of tijS min=min {t1jS, t2jS, t3jS . . . tnjS};
• a second acquisition module, configured to match 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
• K
• ij
• =
• t
• ij
• Emin
• t
• ij
• E
• ,
• K
• ij
• ∈
• (
• 0
• ,
• 1
• )
• between the number of CPU cycles required by the 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
• t
• ij
• E
• =
• C
• j
• f
• ij
• to obtain minimum transmission time tijE min=min {t1jE, t2jE, t3jE . . . tnjE} for each of the computing tasks of the vehicle j;
• a third acquisition module, configured to match 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
• L
• ij
• =
• T
• j
• m
• ⁢
• a
• ⁢
• x
• -
• t
• ij
• T
• j
• m
• ⁢
• a
• ⁢
• x
• ,
• wherein time tij required to complete each of the tasks is computed according to an equation
• t
• ij
• =
• D
• j
• v
• ij
• +
• C
• j
• f
• ij
• ;
• and
• a fourth acquisition module, configured to compute 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
• R
• ij
• =
• r
• ij
• m
• ⁢
• a
• ⁢
• x
• -
• r
• ij
• r
• ij
• m
• ⁢
• a
• ⁢
• x
• .