Table - PMC

Skip to main content

View full-text article in PMC

. 2022 Feb 25;22(5):1835. doi: 10.3390/s22051835

Algorithm 1 Aurora Algorithm Pseudocode.

1:
$d \leftarrow c a l c u l a t e D i s t a n c e (| S |, \bar{| APRES |})$
2:
$n x t H o p \leftarrow s_{0}$
3:
$i \leftarrow 0$
4:
$S_{h} \leftarrow {s_{0}}$
5:
while $i < d$ do
6:
Send APREQ to node $n x t H o p$
7:
$P \leftarrow$ APRES from $n x t H o p$
8:
Update α according to the amount of unique nodes in P
9:
if $α = λ$ then
10:
break
11:
$S_{h} \leftarrow S_{h} \cup P$
12:
$n x t H o p \leftarrow$ random node not already contacted from $S_{h}$
13:
$z \leftarrow 1 - α / λ$
14:
return $(z, n x t H o p)$