Algorithm 3: Empty Regions Recovery Using Binary Inter-Nodes.

1. Procedure FORWARD THE DATA PACKETS (θ) (Source, Sonobuoys) 2. IF Empty region or node = 0 then 3.   Compute the angle with A (x, y, z) 4.   Select the appropriate nodes 5.   Forward the data packets () 6. ELSE 7.      For Nv: $\forall$ Tfn = D(ni, l1) ∗ D(nj, l2) $\leftarrow$ P (Er) do 8.      Modify θ = A (x, y, z) $\leftrightarrow P$CHG $\to$ 0 < θ < π 9.     If $Pack \leftrightarrow \mathrm{Sn} \cup Sn=Nv\ast A \left(xyz\right) \cup Nv \nexists Er \leftarrow P Ack$ 10.    $then$ 11.    Re-schedule angle and forwards the data packets () 12.    Proposed mechanism () 13. END IF 14.      End For 15.     End If 16. End Procedure