Algorithm 2: Data Delivery Using PA-ROBINA.

B: Beacon message having next node   Dn: Number of Dead Nodes   Sn: Set of Nodes   Ns: Set of Neighboring nodes   Adj Ni: Adjacent Nodes Procedure Area of Path Adjustment (A) IF |Dn| = 0 then   Forward data packets ()   Else    Dn $\leftarrow$ takes the next forwarder node (n)     If |Dn| = 0 then       for A (AdjNi) = Ns − Dn do       Forward data $\leftarrow S$     Else       Re-schedule of next forwarder node       Proposed_scheme ()     end if        end for End IF   End Procedure