Flood and Contain: An Optimized Repeal-Based Flooding Algorithm for Wireless Ad Hoc and Sensor Networks

. 2020 Oct 20;20(20):5914. doi: 10.3390/s20205914

Algorithm 1 F&C (S, N, D)

/*S: source node*/

/*D: Resource node set*/

/*N: node*/

1:
S initiates a slow flooding of RQ packets
2:
$N_{i}$ receives an RQ
3:
if $N_{i} \notin D$ then
4:
$N_{i}$ reads delay flooding parameter $Δ_{t}$
5:
$N_{i}$ waits $Δ_{t}$ seconds
6:
$N_{i}$ forwards the RQ packet
7:
else if $N_{i} \in D$ then
8:
if $N_{i}$ is reached after $N_{i}$ ’s repeal-flooding boundary then
9:
$N_{i}$ replies to S (unicast) using the reverse route
10:
else if $N_{i}$ is located before $N_{i}$ ’s repeal-flooding boundary then
11:
$N_{i}$ initiates a chase flooding of RP packets
12:
end if
13:
end if
14:
$N_{i}$ receives an RP packet
15:
if $N_{i}$ has previously received an RP then
16:
$N_{i}$ does not forward the RP packet
17:
end if
18:
if $N_{i}$ has already received and forwarded the RQ packet then
19:
$N_{i}$ forwards the RP packet
20:
else if $N_{i}$ has the RQ packet in its buffer then
21:
$N_{i}$ does not forward the RQ and RP packets
22:
end if