Table - PMC

Skip to main content

View full-text article in PMC

. 2016 Feb 26;16(3):297. doi: 10.3390/s16030297

Algorithm 1 OVAR routing algorithm.

1:
procedure ForwardPacket( $R_{i}$ , P)
2:
if forwarding timer expired then
3:
$F (R_{i}) = \emptyset$
4:
$L (R_{i}) = {n_{k} | 1 \leq k \leq c}$
5:
$G (L (R_{i})) = N e i g h G r a p h (L (R_{i}), T a b l e (R_{i}))$
6:
$F (R_{i}) = F o r w a r d i n g S e t S e l e c t (G (L (R_{i}), Φ^{*})$
7:
for $j = 1$ to r do
8:
Calculate $E E P A (F, j)$
9:
$j_{m a x} = \underset{j}{arg max} E E P A (F, j)$
10:
for all $j > j_{m a x}$ do
11:
$F (R_{i}) = F (R_{i}) - n_{j}$
12:
$P . F o r w a r d i n g L i s t \leftarrow F (R_{i})$
13:
$Forward P$
14:
else
15:
$Drop P$
16:
$end if$
17:
$end procedure$