Algorithm 1.

input:

T: The sample period;

sd : The destination station

begin

Set the weight parameters $\alpha ,\beta \mathrm{and} \gamma ;$

Construct all values of di,j and qi,j according to the distances among stations;

Tc$\leftarrow$current time; Tl$\leftarrow$Tc;

while conditions are satisfied do

if (Tc- Tl$\ge$T) then

Construct all values of vi,j and ri,j which are obtained from cloud servers;

Construct the weight W using Equations (3) and (4);

Get the next station snext;

Obtain and report the shortest path from snext to sd using Dijkstra’s algorithm;

Tc$\leftarrow$current time; Tl$\leftarrow$Tc

else

Tc$\leftarrow$current time;

endif

endwhile

end.