METHOD AND SYSTEM FOR SELECTING OPTIMAL EDGE COMPUTING NODE IN INTERNET OF VEHICLE ENVIRONMENT

Abstract

The present disclosure provides a method and system for selecting an optimal edge computing node in an Internet of vehicle (IoV) environment. The method includes: acquiring and analyzing properties of computing tasks of a vehicle in the IoV environment; acquiring and analyzing properties of different edge computing nodes; computing matching degrees between the properties of the computing tasks and the properties of the nodes; analyzing computing demands of different tasks, and assigning weights to different types of matching degrees; and selecting a node having an optimal sum for products of the matching degrees and the weights as an optimal edge computing node to compute each of the computing tasks of the vehicle.

Claims

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 D.sub.j of the computing tasks, numbers C.sub.j of CPU cycles required by the computing tasks, maximum time T.sub.j.sup.max required to complete the tasks, and distances r.sub.ij between the vehicle and the nodes; The properties of the edge computing nodes comprise: bandwidths B.sub.j of the edge computing nodes, percentages b.sub.ij of time slots allocated by the edge computing nodes to the vehicle in unit time, computing resources f.sub.ij allocated by the edge computing nodes to the vehicle, and average signal-to-noise ratios (SNRs) $\frac{S}{N}$ 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 $J_{\mathrm{ij}}=\frac{t_{\mathrm{ij}}^{\mathrm{Smin}}}{t_{\mathrm{ij}}^S},J_{\mathrm{ij}}\in \left(0,1\right)$ 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 v.sub.ij of the edge computing nodes are computed according to an equation $v_{\mathrm{ij}}=b_{\mathrm{ij}}{v}_j=b_{\mathrm{ij}}{B}_j{\log }_2\left(1+\frac{S}{N}\right);$ 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_{\mathrm{ij}}^S=\frac{D_j}{v_{\mathrm{ij}}}$ to obtain minimum transmission time t.sub.ij.sup.S min for each of the computing task of the vehicle j, with an equation of t.sub.ij.sup.S min=min {t.sub.1j.sup.S, t.sub.2j.sup.S, t.sub.3j.sup.S . . . t.sub.nj.sup.S}; 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 $K_{\mathrm{ij}}=\frac{t_{\mathrm{ij}}^{\mathrm{Emin}}}{t_{\mathrm{ij}}^E},K_{\mathrm{ij}}\in \left(0,1\right)$ 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 $t_{\mathrm{ij}}^E=\frac{C_j}{f_{\mathrm{ij}}}$ to obtain minimum transmission time t.sub.ij.sup.E min=min {t.sub.1j.sup.E, t.sub.2j.sup.E, t.sub.3j.sup.E . . . t.sub.nj.sup.E} 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 L.sub.ij being $L_{\mathrm{ij}}=\frac{T_j^{max}-t_{\mathrm{ij}}}{T_j^{max}},$ Wherein, time t.sub.ij required to complete each of the tasks is computed according to an equation $t_{\mathrm{ij}}=\frac{D_j}{v_{\mathrm{ij}}}+\frac{C_j}{f_{\mathrm{ij}}};$ and Computing matching degrees with the distances r.sub.ij between the vehicle and the nodes and a maximum distance r.sub.ij.sup.max=max{r.sub.1j, r.sub.2j, r.sub.3j . . . r.sub.nj} according to an equation $R_{\mathrm{ij}}=\frac{r_{\mathrm{ij}}^{max}-r_{\mathrm{ij}}}{r_{\mathrm{ij}}^{max}}.$

2. The method for selecting an optimal edge computing node in an IoV environment according to claim 1, wherein the assigning weights to different types of matching degrees in step 3 comprises: respectively computing a mean and a variance for each of D.sub.j, C.sub.j, T.sub.j.sup.max according to the properties T.sub.j={D.sub.j, C.sub.j, T.sub.j.sup.max}j∈M of the computing tasks, Wherein, for the data volumes D.sub.j of the computing tasks and the numbers C.sub.j of CPU cycles required by the computing tasks, the D.sub.j and C.sub.j each have a demand degree O.sub.D, O.sub.C of 3 if being greater than or equal to a sum of a mean and a variance thereof; the D.sub.j and C.sub.j each have a demand degree O.sub.D, O.sub.C of 2 if being between the sum of the mean and the variance thereof and a difference between the mean and the variance thereof; and the D.sub.j and C.sub.j each have a demand degree O.sub.D, O.sub.C of 1 if being less than or equal to the difference between the mean and the variance thereof; For the maximum time T.sub.j.sup.max required to complete the tasks, the T.sub.j.sup.max has a demand degree O.sub.T of 3 if being less than or equal to a difference between a mean and a variance thereof; the T.sub.j.sup.max has a demand degree O.sub.T of 2 if being between a sum of the mean and the variance thereof and the difference between the mean and the variance thereof; and the T.sub.j.sup.max has a demand degree O.sub.T of 1 if being greater than or equal to the sum of the mean and the variance thereof; Distances toward base stations of the edge computing nodes for each of the computing tasks have a demand degree O.sub.R of 2; D.sub.j, C.sub.j, T.sub.j.sup.max respectively correspond to a transmission speed demand, an execution speed demand and a task completion time demand, with corresponding matching degrees of J.sub.ij, K.sub.ij, L.sub.ij; and after the demand degrees O.sub.D, O.sub.C, O.sub.T, O.sub.R are obtained, weights w.sub.R, w.sub.J, w.sub.K, w.sub.L are computed according to equations: $w_J=\frac{O_D}{O_D+O_C+O_T+O_R}{w}_K=\frac{O_C}{O_D+O_C+O_T+O_R}{w}_L=\frac{O_T}{O_D+O_C+O_T+O_R}{w}_R=\frac{O_R}{O_D+O_C+O_T+O_R},$ Wherein, O.sub.D, O.sub.C, O.sub.T, O.sub.R respectively represent the transmission speed demand, the execution speed demand, the task completion time demand and the distance demand, and proportions of the O.sub.D, O.sub.C, O.sub.T, O.sub.R in a total demand are the weights of the matching degrees J.sub.ij, K.sub.ij, L.sub.ij, R.sub.ij; and An equation for computing comprehensive matching degrees is:
Z.sub.ij=R.sub.ijw.sub.R+J.sub.ijw.sub.J+K.sub.ijw.sub.K+L.sub.ijw.sub.L.

3. The method for selecting an optimal edge computing node in an IoV environment according to claim 2, wherein the comparing the comprehensive matching degrees in step 4 comprises: Matching each of the computing tasks of the vehicle with multiple edge computing nodes, assigning values to weights of different matching degrees, and computing multiple comprehensive matching degrees, Wherein when the comprehensive matching degrees are compared, if only one maximum value is present among the comprehensive matching degrees for the computing task of the vehicle j, a node where the value is located is selected as an optimal edge computing node for the computing task of the vehicle j.

4. The method for selecting an optimal edge computing node in an IoV environment according to claim 3, wherein in the step 4, when the comprehensive matching degrees are compared, if two or more same maximum values are present among the computed comprehensive matching degrees, a comparison sequence for the matching degrees J.sub.ij, K.sub.ij, L.sub.ij, R.sub.ij is determined according to the weights w.sub.R, w.sub.J, w.sub.K, w.sub.L, a matching degree having a larger weight is compared first, and a node having a largest matching degree is selected to execute the computing task.

5. 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 D.sub.j of the computing tasks, numbers C.sub.j of central processing unit (CPU) cycles required by the computing tasks, maximum time T.sub.j.sup.max required to complete the tasks, and distances r.sub.ij between the vehicle and the nodes; and the properties of the edge computing nodes comprise: bandwidths B.sub.j of the edge computing nodes, percentages b.sub.ij of time slots allocated by the edge computing nodes to the vehicle in unit time, computing resources f.sub.ij allocated by the edge computing nodes to the vehicle, and average signal-to-noise ratios (SNRs) $\frac{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_{\mathrm{ij}}=\frac{t_{\mathrm{ij}}^{\mathrm{Smin}}}{t_{\mathrm{ij}}^S},J_{\mathrm{ij}}\in \left(0,1\right)$ 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 v.sub.ij of the edge computing nodes are computed according to an equation $v_{\mathrm{ij}}=b_{\mathrm{ij}}{v}_j=b_{\mathrm{ij}}{B}_j{\log }_2\left(1+\frac{S}{N}\right);$ 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_{\mathrm{ij}}^S=\frac{D_j}{v_{\mathrm{ij}}}$ to obtain minimum transmission time t.sub.ij.sup.S min for each of the computing tasks of the vehicle j, with an equation of t.sub.ij.sup.S min=min {t.sub.1j.sup.S, t.sub.2j.sup.S, t.sub.3j.sup.S . . . t.sub.nj.sup.S}; 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_{\mathrm{ij}}=\frac{t_{\mathrm{ij}}^{\mathrm{Emin}}}{t_{\mathrm{ij}}^E},K_{\mathrm{ij}}\in \left(0,1\right)$ 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_{\mathrm{ij}}^E=\frac{C_j}{f_{\mathrm{ij}}}$ to obtain minimum transmission time t.sub.ij.sup.E min=min {t.sub.1j.sup.E, t.sub.2j.sup.E, t.sub.3j.sup.E . . . t.sub.nj.sup.E} 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 L.sub.ij being $L_{\mathrm{ij}}=\frac{T_j^{max}-t_{\mathrm{ij}}}{T_j^{max}},$ Wherein time t.sub.ij required to complete each of the tasks is computed according to an equation $t_{\mathrm{ij}}=\frac{D_j}{v_{\mathrm{ij}}}+\frac{C_j}{f_{\mathrm{ij}}};$ and A fourth acquisition module, configured to compute matching degrees with the distances r.sub.ij between the vehicle and the nodes and a maximum distance r.sub.ij.sup.max=max{r.sub.1j, r.sub.2j, r.sub.3j . . . r.sub.nj} according to an equation $R_{\mathrm{ij}}=\frac{r_{\mathrm{ij}}^{max}-r_{\mathrm{ij}}}{r_{\mathrm{ij}}^{max}}.$

6. The system for selecting an optimal edge computing node in an IoV environment according to claim 5, wherein in the matching degree acquisition module, the weights are assigned to the different types of matching degrees as follows: Respectively computing a mean and a variance for each of D.sub.j, C.sub.j, T.sub.j.sup.max according to the properties T.sub.j={D.sub.j, C.sub.j, T.sub.j.sup.max}j∈M of the computing tasks, Wherein, for the data volumes D.sub.j of the computing tasks and the numbers C.sub.j of CPU cycles required by the computing tasks, the D.sub.j and C.sub.j each have a demand degree O.sub.D, O.sub.C of 3 if being greater than or equal to a sum of a mean and a variance thereof; the D.sub.j and C.sub.j each have a demand degree O.sub.D, O.sub.C of 2 if being between the sum of the mean and the variance thereof and a difference between the mean and the variance thereof; and the D.sub.j and C.sub.j each have a demand degree O.sub.D, O.sub.C of 1 if being less than or equal to the difference between the mean and the variance thereof; For the maximum time T.sub.j.sup.max required to complete the tasks, the T.sub.j.sup.max has a demand degree O.sub.T of 3 if being less than or equal to a difference between a mean and a variance thereof; the T.sub.j.sup.max has a demand degree O.sub.T of 2 if being between a sum of the mean and the variance thereof and the difference between the mean and the variance thereof; and the T.sub.j.sup.max has a demand degree O.sub.T of 1 if being greater than or equal to the sum of the mean and the variance thereof; Distances toward base stations of the edge computing nodes for the computing tasks have a demand degree O.sub.R of 2; D.sub.j, C.sub.j, T.sub.j.sup.max respectively correspond to a transmission speed demand, an execution speed demand and a task completion time demand, with corresponding matching degrees of J.sub.ij, K.sub.ij, L.sub.ij; and after the demand degrees O.sub.D, O.sub.C, O.sub.T, O.sub.R are obtained, weights w.sub.R, w.sub.J, w.sub.K, w.sub.L are computed according to equations: $w_J=\frac{O_D}{O_D+O_C+O_T+O_R}{w}_K=\frac{O_C}{O_D+O_C+O_T+O_R}{w}_L=\frac{O_T}{O_D+O_C+O_T+O_R}{w}_R=\frac{O_R}{O_D+O_C+O_T+O_R},$ Wherein, O.sub.D, O.sub.C, O.sub.T, O.sub.R respectively represent the transmission speed demand, the execution speed demand, the task completion time demand and the distance demand, and proportions of the O.sub.D, O.sub.C, O.sub.T, O.sub.R in a total demand are the weights of the matching degrees J.sub.ij, K.sub.ij, L.sub.ij, R.sub.ij; and An equation for computing comprehensive matching degrees is:
Z.sub.ij=R.sub.ijw.sub.R+J.sub.ijw.sub.J+K.sub.ijw.sub.K+L.sub.ijw.sub.L.

7. The system for selecting an optimal edge computing node in an IoV environment according to claim 6, wherein in the comprehensive matching degree acquisition module, the comprehensive matching degrees are compared as follows: Matching each of the computing tasks of the vehicle with multiple edge computing nodes, assigning values to weights of different matching degrees, and computing multiple comprehensive matching degrees, Wherein when the comprehensive matching degrees are compared, if only one maximum value is present among the comprehensive matching degrees for the computing task of the vehicle j, a node where the value is located is selected as an optimal edge computing node for the computing task of the vehicle j; and if two or more same maximum values are present among the computed comprehensive matching degrees, a comparison sequence for the matching degrees J.sub.ij, K.sub.ij, L.sub.ij, R.sub.ij is determined according to the weights w.sub.R, w.sub.J, w.sub.K, w.sub.L, a matching degree having a larger weight is compared first, and a node having a largest matching degree is selected to execute the computing task.

8. The system for selecting an optimal edge computing node in an IoV environment according to claim 5, wherein each of the edge computing nodes is provided with one base station; base stations of different edge computing nodes are connected in a wired manner; and the vehicle communicates with the base stations through time division multiple address (TDMA).

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0065] To describe the technical solutions in the embodiments of the present disclosure or in the prior art more clearly, the following briefly introduces the accompanying drawings required for describing the embodiments or the prior art. Apparently, the accompanying drawings in the following description show some embodiments of the present disclosure, and a person of ordinary skill in the art may still derive other drawings from these accompanying drawings without creative efforts.

[0066] FIG. 1 is a flow chart of a method for selecting an optimal edge computing node in an IoV environment according to an embodiment of the present disclosure; and

[0067] FIG. 2 is a schematic view for selecting and matching an optimal edge computing node in an IoV environment according to an embodiment of the present disclosure.

DETAILED DESCRIPTION OF THE EMBODIMENTS

[0068] In order to make the objectives, technical solutions and technical solutions in the embodiments of the present disclosure more clear, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the accompanying drawings in the embodiments of the present disclosure. Obviously, the described embodiments are some of the embodiments of the present disclosure. All other embodiments obtained by the person of ordinary skill in the art based on the embodiments of the present disclosure without creative efforts should fall within the protection scope of the present disclosure.

[0069] Referring to FIG. 1, the embodiment of the present disclosure provides a method for selecting an optimal edge computing node in an IoV environment, specifically including the following steps:

[0070] Acquire and analyze properties of computing tasks of a vehicle in the IoV environment; and acquire and analyze properties of different edge computing nodes.

[0071] Compute matching degrees between the properties of the tasks and the properties of the nodes after the properties of the computing tasks of the vehicle and the properties of the edge computing nodes are acquired.

[0072] Analyze computing demands of different computing tasks, assign weights to different types of matching degrees, and compute comprehensive matching degrees.

[0073] Compare the comprehensive matching degrees, determine a comparison sequence for the matching degrees according to the demands of the computing tasks if the comprehensive matching degrees are the same, and select an optimal edge computing node to compute each of the computing tasks of the vehicle.

[0074] Preferably, the step of acquiring properties of computing tasks of a vehicle and properties of edge computing nodes specifically includes:

[0075] The properties of the computing tasks of the vehicle include: data volumes D.sub.j of the computing tasks, numbers C.sub.j of CPU cycles required by the computing tasks, maximum time T.sub.j.sup.max required to complete the tasks, and distances r.sub.ij between the vehicle and the nodes.

[0076] The properties of the edge computing nodes include: bandwidths B.sub.j of the edge computing nodes, percentages b.sub.ij of time slots allocated by the edge computing nodes to the vehicle in unit time, computing resources f.sub.ij allocated by the edge computing nodes to the vehicle, and average SNRs

[00021]$\frac{S}{N}$

after the edge computing nodes are connected to the vehicle.

[0077] Referring to FIG. 2, preferably, the step of matching the properties of the computing tasks of the vehicle with the properties of the edge computing nodes specifically includes:

[0078] Match a data volume of each of the computing tasks of the vehicle with data transmission speeds of the edge computing nodes, where the data transmission speeds v.sub.ij of the edge computing nodes are computed through the bandwidths B.sub.j of the edge computing nodes, the average SNRs

[00022]$\frac{S}{N}$

after the edge computing nodes are connected to the vehicle and the percentages b.sub.ij of the time slots allocated by the edge computing nodes to the vehicle in the unit time according to an equation

[00023]$v_{\mathrm{ij}}=b_{\mathrm{ij}}{v}_j=b_{\mathrm{ij}}{B}_j{\log }_2\left(1+\frac{S}{N}\right),$

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

[00024]$t_{\mathrm{ij}}^S=\frac{D_j}{v_{\mathrm{ij}}}$

to obtain minimum transmission time t.sub.ij.sup.S min for each of the computing tasks of the vehicle j, t.sub.ij.sup.S min=min{t.sub.1j.sup.S, t.sub.2j.sup.S, t.sub.3j.sup.S . . . t.sub.nj.sup.S}. Therefore, matching degrees

[00025]$J_{\mathrm{ij}}=\frac{t_{\mathrm{ij}}^{\mathrm{Smin}}}{t_{\mathrm{ij}}^S},J_{\mathrm{ij}}\in \left(0,1\right)$

between the data volume of each of the computing tasks of the vehicle and the data transmission speeds of the edge computing nodes are obtained.

[0079] Match a number of CPU cycles required by each of the computing tasks of the vehicle with the computing resources allocated by the edge computing nodes, and compute execution time of all base station for the data volume of each of the computing tasks of the vehicle j according to an equation

[00026]$t_{\mathrm{ij}}^E=\frac{C_j}{f_{\mathrm{ij}}}$

to obtain minimum transmission time t.sub.ijE min=min {t.sub.1j.sup.E, t.sub.2j.sup.E, t.sub.3j.sup.E . . . t.sub.nj.sup.E} for each of the computing tasks of the vehicle j. Therefore, matching degrees

[00027]$K_{\mathrm{ij}}=\frac{t_{\mathrm{ij}}^{\mathrm{Emin}}}{t_{\mathrm{ij}}^E},K_{\mathrm{ij}}\in \left(0,1\right)$

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 are obtained.

[0080] Match the maximum completion time for each of the computing tasks of the vehicle with time required by the nodes to compute the task, where time t.sub.ij required to complete each of the tasks is computed according to an equation

[00028]$t_{\mathrm{ij}}=\frac{D_j}{v_{\mathrm{ij}}}+\frac{C_j}{f_{\mathrm{ij}}},$

and matching degrees L.sub.ij are computed according to an equation

[00029]$L_{\mathrm{ij}}=\frac{T_j^{\max }-t_{\mathrm{ij}}}{T_j^{\max }}.$

[0081] Compute matching degrees

[00030]$R_{\mathrm{ij}}=\frac{r_{\mathrm{ij}}^{\max }-r_{\mathrm{ij}}}{r_{\mathrm{ij}}^{\max }}$

with the distances r.sub.ij between the vehicle and the nodes and a maximum distance r.sub.ij.sup.max=max{r.sub.1j, r.sub.2j, r.sub.3j . . . r.sub.nj}.

[0082] In the embodiment of the present disclosure, the weights are assigned as follows:

[0083] Respectively compute a mean and a variance for each of D.sub.j, C.sub.j, T.sub.j.sup.max according to the properties T.sub.j={D.sub.j, C.sub.j, T.sub.j.sup.max}j∈M of the computing tasks, classify task demand degrees O.sub.D, O.sub.C, O.sub.T, O.sub.R, and respectively assign values to w.sub.R, w.sub.J, w.sub.K, w.sub.L according to a result.

[0084] For the data volumes D.sub.j of the computing tasks and the numbers C.sub.j of CPU cycles required by the computing tasks, the D.sub.j and C.sub.j each have a demand degree O.sub.D, O.sub.C of 3 if being greater than a sum of a mean and a variance thereof; the D.sub.j and C.sub.j each have a demand degree O.sub.D, O.sub.C of 2 if being between the sum of the mean and the variance thereof and a difference between the mean and the variance thereof; and the D.sub.j and C.sub.j each have a demand degree O.sub.D, O.sub.C of 1 if being less than the difference between the mean and the variance thereof.

[0085] For the maximum time T.sub.j.sup.max required to complete the tasks, the T.sub.j.sup.max has a demand degree O.sub.T of 3 if being less than a difference between a mean and a variance thereof; the T.sub.j.sup.max has a demand degree O.sub.T of 2 if being between a sum of the mean and the variance thereof and the difference between the mean and the variance thereof; and the T.sub.j.sup.max has a demand degree O.sub.T of 1 if being greater than the sum of the mean and the variance thereof.

[0086] D.sub.j, C.sub.j, T.sub.j.sup.max respectively correspond to a transmission speed demand, an execution speed demand and a task completion time demand, with corresponding matching degrees of J.sub.ij, K.sub.ij, L.sub.ij; and after the demand degrees O.sub.D, O.sub.C, O.sub.T, O.sub.R are obtained, weights w.sub.R, w.sub.J, w.sub.K, w.sub.L are computed.

[0087] In the embodiment of the present disclosure, the matching degrees are compared as follows:

[0088] Match each of the computing tasks of the vehicle with multiple edge computing nodes, assign values to weights of different matching degrees, and compute multiple comprehensive matching degrees Z.sub.ij=R.sub.ijw.sub.R+J.sub.ijw.sub.J+K.sub.ijw.sub.K+L.sub.ijw.sub.L.

[0089] The optimal edge computing node is selected by comparing computation results:

[0090] (1) When the comprehensive matching degrees Z.sub.ij are compared, if only one maximum value is present among the comprehensive matching degrees Z.sub.ij for the computing task of the vehicle j, a node where the value is located is selected as an optimal edge computing node for the computing task of the vehicle j.

[0091] For example, after matching with the edge computing nodes, the computing task of the vehicle j has the comprehensive matching degree Z.sub.i,j=max{Z.sub.1j, Z.sub.2j, Z.sub.3j . . . Z.sub.nj}, j∈M, and then the edge computing node i.sub.1 is selected to execute the computing task of the vehicle j.

[0092] (2) If two or more same maximum values are present among the computed comprehensive matching degrees Z.sub.ij, nodes where the maximum values of the matching degrees are located are further compared for selection, namely, a comparison sequence for the matching degrees J.sub.ij, K.sub.ij, L.sub.ij, R.sub.ij is determined according to the weights w.sub.R, w.sub.J, w.sub.K, w.sub.L, a matching degree having a larger weight is compared first, and a node having a largest matching degree is selected to execute the computing task.

[0093] For example, the computing task of the vehicle j is matched with the nodes to obtain the computation result Z.sub.i.sub.1.sub.j=Z.sub.i.sub.2.sub.j=max{Z.sub.1j, Z.sub.2j . . . Z.sub.nj}, j∈M, and then i.sub.1 and i.sub.2 are further compared. If w.sub.J=max{w.sub.R, w.sub.J, w.sub.K, w.sub.L}, the matching degrees J.sub.i.sub.1.sub.j, J.sub.i.sub.2.sub.j are compared, and the node where the maximum value of the i is located is selected to execute the computing task of the vehicle j.

Specific Embodiment

[0094] The embodiment of the present disclosure provides a method for selecting an optimal edge computing node in an IoV environment. In actual applications, base stations of the edge computing nodes have the overlapped coverages, and different computing nodes are interfered with each other, thus reducing the transmission rate. Each of the edge computing nodes is provided with one base station. Base stations of the different nodes are connected in a wired manner. The set for the edge computing nodes is represented by N={1 2 3 . . . n}, while the set for the computing tasks of the vehicle is represented by M={1,2,3 . . . m}.

[0095] The computing task of the vehicle j has a property of T.sub.j={D.sub.j, C.sub.j, T.sub.j.sup.max}, where D.sub.j represents a data volume of the computing task, C.sub.j represents a number of CPU cycles required by a server in a base station to compute the task, and T.sub.j.sup.max represents maximum time required to complete the task.

[0096] The matching degree J.sub.ij between the data volume of the task and the transmission speed of the node is:

[0097] The data volume D.sub.j of the computing task is matched with the transmission speed v.sub.ij of the connected edge computing node j to obtain the matching degree J.sub.ij.

[0098] Each edge computing node is provided with a server. After accessed to the base station, the vehicle can offload the computing task to the server of the edge computing node for computation. The vehicle communicates with the base stations through time division multiple address (TDMA). Each vehicle uploads data with a time slot allocated by the base station, where b.sub.ij represents a percentage of the time slot of the vehicle j in unit time after the vehicle is accessed to the base station i, and therefore, 0<b.sub.ij<1 i∈N, j∈M.

[0099] Supposing that the base station has a bandwidth of B, the total transmission rate of the base station is:

[00031]$\begin{array}{cc}v=B{\log }_2\left(1+\frac{S}{N}\right)& \left(1\right)\end{array}$

[0100] Where, S is an average signal power, N is an average noise power, and

[00032]$\frac{S}{N}$

is an SNR.

[0101] When the vehicle j is accessed to the base station i, the transmission rate between the vehicle and the accessed base station is:

[00033]$\begin{array}{cc}{v}_{\mathrm{ij}}=b_{\mathrm{ij}}{v}_j=b_{\mathrm{ij}}{B}_j{\log }_2\left(1+\frac{S}{N}\right),i\in N,j\in M& \left(2\right)\end{array}$

[0102] The transmission time t.sub.ij.sup.s is:

[00034]$\begin{array}{cc}{t}_{\mathrm{ij}}^S=\frac{D_j}{v_{\mathrm{ij}}},i\in N,j\in M& \left(3\right)\end{array}$

[0103] Transmission time of all base stations for the data volume of the computing task of the vehicle j is computed to obtain minimum transmission time t.sub.ij.sup.S min for the computing task of the vehicle j, t.sub.ijS min=min {t.sub.1j.sup.S, t.sub.2j.sup.S, t.sub.3j.sup.S . . . t.sub.nj.sup.S}. Therefore, the matching degree J.sub.ij between the data volume of the task and the transmission speed of the node is obtained:

[00035]$\begin{array}{cc}{J}_{\mathrm{ij}}=\frac{t_{\mathrm{ij}}^{\mathrm{Smin}}}{t_{\mathrm{ij}}^S},J_{\mathrm{ij}}\in \left(0,1\right)& \left(4\right)\end{array}$

[0104] In the embodiment of the present disclosure, the matching degree K.sub.ij between the number of CPU cycles of the computing task and the computing resource allocated by the node is obtained with the following specific steps:

[0105] The computing resource of the server of the edge computing node is generally balanced by the CPU frequency; and the server allocates different virtual machines to different vehicles to implement the resource allocation for the CPU frequency. The computing resource of the server is represented by F={F.sub.1, F.sub.2, F.sub.3 . . . F.sub.n}, where F.sub.i represents the computing resource at the base station i, and f.sub.ij represents the CPU frequency allocated by the server of the base station i to the vehicle j; and thus the execution time of the computing task is:

[00036]$\begin{array}{cc}{t}_{\mathrm{ij}}^E=\frac{C_j}{f_{\mathrm{ij}}},\underset{j=1}{\overset{m}{.Math.}}{f}_{\mathrm{ij}}\le F_i& \left(5\right)\end{array}$

[0106] Execution time of all base stations for the data volume of the computing task of the vehicle j is computed to obtain minimum transmission time t.sub.ij.sup.E min for the computing task of the vehicle j, t.sub.ij.sup.E min=min{t.sub.1j.sup.E, t.sub.2j.sup.E, t.sub.3j.sup.E . . . t.sub.nj.sup.E}. to Therefore, the matching degree K.sub.ij between the number of CPU cycles of the computing task and the computing resource allocated by the node is obtained:

[00037]$\begin{array}{cc}{K}_{\mathrm{ij}}=\frac{t_{\mathrm{ij}}^{\mathrm{Emin}}}{t_{\mathrm{ij}}^E},K_{\mathrm{ij}}\in \left(0,1\right)& \left(6\right)\end{array}$

[0107] In the embodiment of the present disclosure, the matching degree L.sub.ij between the maximum completion time of the task and the time required by the node to compute the task is obtained with the following specific steps:

[0108] The time t.sub.ij required by the node to compute the task can be obtained through the matching degrees J.sub.ij, K.sub.ij:

[00038]$\begin{array}{cc}{t}_{\mathrm{ij}}=\frac{D_j}{v_{\mathrm{ij}}}+\frac{C_j}{f_{\mathrm{ij}}}& \left(7\right)\end{array}$

[0109] The matching degree L.sub.ij between the time t.sub.ij required by the node i to compute the task of the vehicle j and the maximum task completion time T.sub.j.sup.max can be obtained:

[00039]$\begin{array}{cc}{L}_{\mathrm{ij}}=\frac{T_j^{\max }-t_{\mathrm{ij}}}{T_j^{\max }},T_j^{\max }\ge t_{\mathrm{ij}},L_{\mathrm{ij}}\in \left(0,1\right)& \left(8\right)\end{array}$

[0110] In the embodiment of the present disclosure, the distance matching degree R.sub.ij between the vehicle and node is obtained with the following specific steps:

[0111] As the distance between the base station of the node and the vehicle affects the connecting node of the vehicle, the matching degree R.sub.ij is computed with the distance r.sub.ij (km) between the vehicle and the node and the maximum distance r.sub.ij.sup.max=max{r.sub.1j, r.sub.2j, r.sub.3j . . . r.sub.nj}

[00040]$\begin{array}{cc}{R}_{\mathrm{ij}}=\frac{r_{\mathrm{ij}}^{\max }-r_{\mathrm{ij}}}{r_{\mathrm{ij}}^{\max }},R_{\mathrm{ij}}\in \left(0,1\right)& \left(9\right)\end{array}$

[0112] In the present disclosure, the demand degrees and weights of the computing tasks of the vehicle are computed with the following specific steps:

[0113] D.sub.j, C.sub.j, T.sub.j.sup.max respectively correspond to a transmission speed demand, an execution speed demand and a task completion time demand, with corresponding matching degrees J.sub.ij, K.sub.ij, L.sub.ij, a mean and a variance for each of the D.sub.j, C.sub.j, T.sub.j.sup.max are computed, the task demand degrees O.sub.D, O.sub.C, O.sub.T, O.sub.R are classified, and values are assigned to w.sub.R, w.sub.J, w.sub.K, w.sub.L according to the result, specifically:

[0114] For the data volume D.sub.j of the computing task and the number C.sub.j of CPU cycles required by the computing task, the D.sub.j and C.sub.j each have a demand degree O.sub.D, O.sub.C of 3 if being greater than a sum of a mean and a variance thereof; the D.sub.j and C.sub.j each have a demand degree O.sub.D, O.sub.C of 2 if being between the sum of the mean and the variance thereof and a difference between the mean and the variance thereof; and the D.sub.j and C.sub.j each have a demand degree O.sub.D, O.sub.C of 1 if being less than the difference between the mean and the variance thereof.

[0115] For the maximum time T.sub.j.sup.max required to complete the task, the T.sub.j.sup.max has a demand degree O.sub.T of 3 if being less than a difference between a mean and a variance thereof; has a demand degree O.sub.T of 2 if being between a sum of the mean and the variance thereof and the difference between the mean and the variance thereof; and has a demand degree O.sub.T of 1 if being greater than the sum of the mean and the variance thereof.

[0116] The distance toward the base station of the edge computing node for the computing task has a demand degree O.sub.R of 2.

[0117] After the demand degrees O.sub.D, O.sub.C, O.sub.T, O.sub.R are obtained, weights w.sub.R, w.sub.J, w.sub.K, w.sub.L are computed:

[00041]$\begin{array}{cc}{w}_J=\frac{O_D}{O_D+O_C+O_T+O_R}& \left(10\right)\end{array}$$\begin{array}{cc}{w}_K=\frac{O_C}{O_D+O_C+O_T+O_R}& \left(11\right)\end{array}$$\begin{array}{cc}{w}_L=\frac{O_T}{O_D+O_C+O_T+O_R}& \left(12\right)\end{array}$$\begin{array}{cc}{w}_R=\frac{O_R}{O_D+O_C+O_T+O_R}& \left(13\right)\end{array}$

[0118] In the embodiment of the present disclosure, the optimal edge computing node is selected as follows:

[0119] Each computing task of the vehicle is matched with multiple edge computing nodes, values are assigned to different matching degrees, and multiple comprehensive matching degrees Z.sub.ij are computed.

Z.sub.ij=R.sub.ijw.sub.R+J.sub.ijw.sub.J+K.sub.ijw.sub.K+L.sub.ijw.sub.L,Z.sub.ij∈(0,1)  (14)

[0120] The optimal edge computing node is selected by comparing the computation results:

[0121] (1) When the comprehensive matching degrees Z.sub.ij are compared, if only one maximum value is present among the comprehensive matching degrees Z.sub.ij for the computing task of the vehicle j, a node where the value is located is selected as an optimal edge computing node for the computing task of the vehicle j.

[0122] For example, after matching with the edge computing nodes, the computing task of the vehicle j has the comprehensive matching degree Z.sub.i.sub.1.sub.j=max{Z.sub.1j, Z.sub.2j, Z.sub.3j . . . Z.sub.nj}, j∈M, and then the edge computing node i.sub.1 is selected to execute the computing task of the vehicle j.

[0123] (2) If two or more same maximum values are present among the computed comprehensive matching degrees Z.sub.ij, nodes where the maximum values of the matching degrees are located are further compared for selection, namely, a comparison sequence for the matching degrees J.sub.ij, K.sub.ij, L.sub.ij, R.sub.ij is determined according to the weights w.sub.R, w.sub.J, w.sub.K, w.sub.L, a matching degree having a larger weight is compared first, and a node having a largest matching degree is selected to execute the computing task.

[0124] For example, the computing task of the vehicle j is matched with the nodes to obtain the computation result Z.sub.i.sub.1.sub.j=Z.sub.i.sub.2.sub.j=max{Z.sub.1j, Z.sub.2j . . . Z.sub.nj}, j∈M; and then i.sub.1 and i.sub.2 are further compared. If w.sub.J=max{w.sub.R, w.sub.J, w.sub.K, w.sub.L}, the matching degrees J.sub.i.sub.1.sub.j, J.sub.i.sub.2.sub.j are compared, and the node where the maximum value of the is located is selected to execute the computing task of the vehicle j.

[0125] The method can quickly select the optimal edge computing node for the computing task of the vehicle according to different computing demands and matching results, improve the computing efficiency, meet the computing requirements and save the computing resources of the nodes.

[0126] To sum up, the present disclosure provides the method for selecting an optimal edge computing node in an IoV environment, including the following steps: step 1: analyzing properties of different computing tasks and edge computing nodes, including but not limited to data volumes of the computing tasks, numbers of CPU cycles and computing time required by the computing tasks, and bandwidths and computing resources of the edge computing nodes; step 2: computing matching degrees of different properties, and quantizing matching degrees of different computing demands through the properties of the computing tasks of the vehicles and the properties of the computing nodes: distance matching between the vehicle and base stations of the nodes; matching between computation burdens of the computing tasks and transmission speeds of the nodes; matching between computing resources required by the computing tasks and computing resources allocated by base stations of the nodes to the tasks (the number of CPU cycles); and matching between time demands of the computing tasks and time of the nodes to compute the tasks; and step 3: determining different demand degrees of the computing tasks through different properties of the computing tasks, assigning different weights to different matching degrees, obtaining sums of comprehensive matching degrees, and selecting an edge computing node having a largest matching degree as an optimal edge computing node. The present disclosure can quickly match the properties of the computing tasks of the vehicle with the properties of the nodes in the IoV environment, quickly select the optimal edge computing node for the computing task of the vehicle according to different computing demands and matching results, improve the computing efficiency, meet the computing requirements and save the computing resources of the nodes.

[0127] The above embodiments are provided merely for an objective of describing the present disclosure and are not intended to limit the scope of the present disclosure. The scope of the present disclosure is defined by the appended claims. Various equivalent replacements and modifications made without departing from the spirit and scope of the present disclosure should all fall within the scope of the present disclosure.