. 2010 Feb 26;10(3):1447–1472. doi: 10.3390/s100301447

Algorithm 1.

IRL - Routing at Source Node.

1:	prev_hop ← ∅; next_hop ←∅;
2:	ifM(t_F) ≠ ∅ then
3:	next_hop(k) = Rand(M (t_F));
4:	else
5:	ifM(t_{B_r}) ∪ M(t_{B_l}) ≠ ∅ then
6:	next_hop(k) = Rand(M (t_{B_r}) ∪ M (t_{B_l}));
7:	else ifM(t_{B_m} ≠ ∅ then
8:	next_hop(k) = Rand(M (t_{B_m}));
9:	else
10:	Drop packet and Exit;
11:	end if
12:	end if
13:	Set prev_hop = my_id;
14:	Form pkt p = {prev_hop; next_hop; seqID; payload};
15:	Create Signature and save in buffer;
16:	Forward packet to next_hop;
17:	Set timer $Δ t = \frac{D}{d_{{next}_{hop}}} \times p_{t};$
18:	while Δt = truedo
19:	Signature remains in buffer;
20:	end while
21:	Signature removed from buffer;