Algorithm 1 Least cost path recommendation algorithm.

INPUT: $G=\{C,L\}$, $C_i$

OUTPUT: The next node $C_{next}$ to visit

Initialize: O –> current location = $C_i$, O–>request = 1, $min\leftarrow \infty$, next hop $C_{next}=\varnothing$

Repeat

for all $C_j\in$ neighbor tables of $C_i$ do

Calculate: $f_{ij}$

if $f_{ij}<min$ then

$min=f_{ij}$

update: $C_{next}=C_j$

end if

end for

return $C_{next}$