A Trust-Based Adaptive Probability Marking and Storage Traceback Scheme for WSNs

. 2016 Mar 30;16(4):451. doi: 10.3390/s16040451

Algorithm 2: The adaptive logging approach

1:
For each time $t$ Do
2:
The trust of each node ${c_{1, t,} c_{2, t}, c_{3, t}, \dots, c_{m, t}}$ at time $t$ is computed by the Sink;
3:
For each node $v_{i}$ Do
4:
Case $c_{i, t}$
5:
$[0, c_{s}] : S (v_{i}) = 0;$ // $S (v_{i})$ is the logging probability of $v_{i}$
6:
$[c_{s}, c_{z}] : S (v_{i}) = φ x;$ // $φ \in (0, 1)$ is a constant
7:
$[c_{z}, 1] : S (v_{i}) = \min (ϕ x, 1)$ // $ϕ > 1$ is a constant
8:
End For;
9:
For each packet $B_{i}$ received by node $v_{i}$ Do;
10:
node $v_{i}$ logs marking tuples of packets $B_{i}$ with probability $S (v_{i})$ ;
11:
End For;
12:
$t \leftarrow t + 1;$ //next time $t$
13:
End For