Algorithm 1 Algorithm for forwarding data packets

Node i receives $data\_packet$ from node j

Obtain $pre{v}_{node}\_depth$ and $cur{r}_{node}\_depth$

Calculate distance relative to $diff(SS\_RSSI,RP\_RSSI)$

Calculate $RC(sender,receiver)$ corresponding to distance and $diff(pre{v}_{node}\_depth,cur{r}_{node}\_depth)$

SWITCH $\left(packettype\right)$

CASE 1:

$NeighborRequest$

if node i is the preferable forwarder node of node j then

send ack

end if

Hold for next data packet

END CASE

CASE 2:

$Ack$

if node j is the preferable forwarder node of node i then

up-to-date entry neighbor_tablemaking use of item ($pre{v}_{node}\_depth,distance,t_{current}$)

end if

END CASE

CASE 3:

$DataPacket$

Move to the next step

END CASE

END SWITCH

if selected node i is not the preferable forwarder node of $data\_packet$ then

Upgrade $neighbor\_table$ using item ($pre{v}_{node}\_depth,t_{current},distance$)

Drop $data\_packet$

end if

if node i is the preferable forwarder node of $data\_packet$ then

Obtain source ID, packet ID from $data\_packet$

if (source ID, packet ID) within the queue then

Drop $data\_packet$

end if

if the node is within the forwarding area then

Move to the next step

else

Hold for the next $data\_packet$

end if

end if

Find the next $dept{h}_{min}$ in $neighbor\_table$

if $neighbor\_table$ is empty then

Drop $data\_packet$

end if

Upgrade the depth in $data\_packet$ with $curren{t}_{node}\_depth$

Add (source ID, packet ID) into the queue