## 7 Data Packet Delivery (DPD)-TANVEF  
Any sensor and actor nodes want to begin the transmission; firstly, they check the remaining energy values '_Re_' of the corresponding nodes and calculate the angle for flooding data packets. '_PACK_' is already defined in such a way that the data packet is only sent when the next forwarder nodes are available to receive the data as well as sends the proper acknowledgments. The angle calculation is based on three attempts as the horizontal with the same layer nodes, vertical for the upper layer and diagonal to support horizontal and vertical communication. The nearest vector is only calculated in order to respond to the tri-angle strategy in such a way that which path is best for forwarding the data packet throughout the sonobuoys. The adjustments of layers are made during packet acknowledgment via Equation (2) and the shortest path without considering the empty regions of Equation (3) play our role. If the forwarder layer does not receive acknowledgment due to empty regions, the path change mechanism will be applying according to Equation (6) in which the path will only be changed when '_E_' is present with the neighboring node where the data are being received by the sonobuoys. Another reason for path change is also described if the next forwarder node is not available for another node, then it automatically considers the packet to be discarded. Algorithm 2 describes the data packet forwarding towards the sonobuoys via the nearest vector-based node's availability. In this algorithm the node '_n_' want to send the packet node '_n_' with the distance '_Dij_' from '_l1 to 12_' without considering the '_E_', the total frequency of nodes '_fn_' is basically from source to sonobuoys is, '_Tfn_ = \(D(n_{i},l_{1})*D(n_{j},l_{2})-P\) (_E_')', where '_Sn_' is the total number of nodes available in each layer to find the closest next forwarding nodes with short distance as defined in Equation (5). In order to define the flooding zone, we are assuming that by using the basic linear formula '_0_ = 90 \(\pm\) 10 \(K\)' the nodes have the capability of computing the angle. Here, '_K_' is a variable and has a finite set of values, '_K_ [1, 2, 3]'. ```
1.Procedure ACOQUIRE ANGLE FOR NEXT NODE (Source\({}_{\text{ni}}\), Sn (P\({}_{\text{ACK}}\))
2.For\(Re\in Ni\)do
3.\(T_{H}=D(n_{i},l_{1})*D(n_{j},l_{2})-P\) (Er)then
4.\(\theta=A\) (x, y, z)
5. Adjust angle for corresponding nodes \(ni\to nj\)
6.EndFor
7.\(n\gets 1\)
8.\(j\gets 1\)
9.\(\textit{While}\ \theta=90\pm 3K\)do
10.\(Pack\ \leftrightarrow\) Sn \(\cup\) Sn = \(Nv*A\) (\(xyz\)) \(\cup\) \(Nv\
exists Er\ \gets P\) Ack
11.If\(Pack\ \
exists\) Ni and D (Sn) = (N (I\({}_{\text{n}}\)-I\({}_{1}\)) \(\rightarrow\)\(\varphi\) (\(fn\cap\)\(Tn\))then
12.\(\text{P}_{\text{CHG}}=\sum_{n}^{0}minNv*f(Nv*(1-Tn\ \ \
ot\in_{i=0}^{n}fn(Er\ \
exists*(A\ (x,\ y,\ z))\)
13.For\(\text{Ni}\gets ni-D\) (Sn)
14.\(\text{Nj}\gets nj-D\) (Sn)
15.EndWhile
16.EndFor
17.Else
18.\(\textbf{Modify}\ \theta=A\ (x,y,z)\ \leftrightarrow\)\(P_{CHG}\)\(\to 0<\theta<\pi\)
19.Endif
20.For\(Er\)do
21.forRe (Ni \(\to Nj\))then
22. Compute distance for nearest neighbor vector node then
23.ifNv:\(\forall T_{H}=D(n_{i},l_{1})*D(n_{j},l_{2})-P\) (Er)do
24. Dissemination of data packet delivery until \(\text{Er}\leftrightarrow\text{P}_{\text{CHG}}\)
25.endif
26.endfor
27.EndFor
28.Endif
29.EndProcedure
```  
**Algorithm 2**Angle Based-Data Packet delivery. After this, if there is no outcome in terms of packet receiving the source node this will increase the value of '\(K\)', as the value of '\(K\)' is increased the flooding zone is also increased under the angle condition that is (\(0<\theta<\pi\)). The value of '\(K\)' is helpful to control the amount of energy consumption of the said node and end-to-end delay. The nodes movement directly depends on the base of the decided value of '\(K\)'. In the case of multiple nodes inside the zone, all nodes will calculate their priorities and send '\(HP\)' to the source node, and the data are forwarded by highest priority node.