Table - PMC

Skip to main content

View full-text article in PMC

. 2018 Aug 27;18(9):2819. doi: 10.3390/s18092819

Algorithm 1 IoB-DTN protocol.

1:
At each sensor reading period
2:
Generate a packet p with the readings
3:
if Buffer management provides a slot then
4:
Store $p \cup N^{0}$ in the buffer [ $N^{0}$ copies of p are stored]
5:
end if
6:
7:
When duty cycle is over
8:
$L \leftarrow$ the list of neighbors
9:
if a base station is in $L$ then
10:
Send all packets in buffer
11:
else
12:
for all packet $p \cup N$ in buffer do
13:
if N (number of copies) > 1 then
14:
Send $p \cup N \cup L$
15:
end if
16:
end for
17:
end if
18:
Wait for next duty cycle
19:
20:
On reception of packet $p \cup N \cup L$
21:
$p o s \leftarrow$ self position in $L$
22:
$N^{'} \leftarrow \frac{N}{2^{p o s + 1}}$
23:
if Buffer management provides a slot and $N^{'} \geq 1$ then
24:
Store $p \cup N^{'}$
25:
Send ACK for receiving $N^{'}$ copies of p
26:
else
27:
Packet is rejected, no ACK is sent
28:
end if
29:
30:
On reception of an ACK of p and $N^{'}$
31:
if sender node is a base station then
32:
Delete p from buffer
33:
else
34:
Update the number of copies of $p :$ $N^{″} \leftarrow N - N^{'}$
35:
end if