Algorithm 2: Next-hop selection procedure

Notations: $N_i$ = Source node $N{H}_i$ = Next-Hop node for $N_i$ BNC = Body Node Coordinator NT = Neighbor Table PCF = Path Cost Function Input: records in NT Process: 1. start 2. if $N_i$ is at one hop to BNC then 3. send packet directly to BNC 4. else 5. for each record in NT do 6. Calculate $PCF={\displaystyle \sum }_{ }\left[\alpha \times \frac{1}{E_{Res}}+\beta \times \frac{1}{LE}+\gamma \times HC+\delta \times d\right]$ 7. List RT $\leftarrow PCF$ value of each neighbor node in NT 8. $N{H}_i$$\leftarrow$ min(RT) 9. end for 10. end if 11. end