Table - PMC

Skip to main content

View full-text article in PMC

. 2016 Apr 7;16(4):487. doi: 10.3390/s16040487

Algorithm 2:: Route establishment in EEBET

1:
$Q_{p}$ ← Query packet
2:
$d_{t h}$ ← Depth threshold
3:
$D_{s e n}$ ← Depth of sender node
4:
$D_{r e c}$ ← Depth of receiver node
5:
$D_{d i f f}$ ← Depth difference b/w sender and receiver node
6:
$R N T$ ← Relay Node Table
7:
Upon receiving $Q_{p}$
8:
if $D_{r e c} < D_{s e n}$ then
9:
if $D_{d i f f} > d_{t h}$ then
10:
Compute $N_{j}$ according to Equation eq:e8
11:
if $N_{j} = m i n (N_{j})$ then
12:
Add node ID in $R N T$
13:
else
14:
drop $Q_{p}$
15:
end if
16:
end if
17:
end if