W-GPCR Routing Method for Vehicular Ad Hoc Networks

. 2020 Jun 16;20(12):3406. doi: 10.3390/s20123406

Algorithm 1 Pseudo code for W-GPCR

$l o c_{p} = g e t L o c a t i o n (c u r r e n t n o d e) = (x_{p}, y_{p})$
$\vec{v_{p}} = g e t S p e e d (c u r r e n t n o d e)$
$n e i g_{p} = g e t N e i g (c u r r e n t n o d e)$
$l o c_{d} = g e t L o c a t i o n (d e s t n o d e) = (x_{d}, y_{d})$
$D_{p d} = \sqrt{{(x_{p} - x_{d})}^{2} + {(y_{p} - y_{d})}^{2}}$
$\vec{l_{p d}} = l o c_{d} - l o c_{p} = (x_{d} - x_{p}, y_{d} - y_{p})$
$S = π r^{2}$
$G = g_{2} \cos (\vec{v_{p}}, \vec{l_{p d}}) + g_{3} \frac{n e i g_{p}}{S}$
$n e x t n o d e = c u r r e n t n o d e$
for all neighbors of $c u r r e n t n o d e$ do
$l o c_{i} = g e t L o c a t i o n (n_{i}) = (x_{i}, y_{i})$
$\vec{v_{i}} = g e t S p e e d (n_{i})$
$D_{i}_{d} = \sqrt{{(x_{i} - x_{d})}^{2} + {(y_{i} - y_{d})}^{2}}$
$\vec{l_{i}_{d}} = l o c_{d} - l o c_{i} = (x_{d} - x_{i}, y_{d} - y_{i})$
$n e i g_{i} = g e t N e i g (n_{i})$
$G_{i} = g_{1} (1 - \frac{D_{i d}}{D_{p d}}) + g_{2} \cos (\vec{v_{i}}, \vec{l_{i d}}) + g_{3} \frac{n e i g_{i}}{S}$
$If G_{i} > G then$
$G = G_{i}$
$n e x t n o d e = n_{i}$
end if
end for
$if . n e x t n o d e \neq c u r r e n t n o d e . then$
$forward the packet to n e x t n o d e$
$else carry the packet with c u r r e n t n o d e$
end if