Algorithm 1: EDADA-RPL parent selection

Input: DIO, DAO, DAO-ACK, DIO_RER

Output: Optimal Parent

1:For preferred_ParentNodeparentNode-list do

2: compute RER

$\mathrm{RER}\left(\mathrm{Ni}\right)=\frac{{\mathrm{E}}_{\mathrm{Initial}}-{\mathrm{E}}_{\mathrm{Depleted}}}{{\mathrm{E}}_{\mathrm{Initial}}}$

3:compute the Rank(N)

$\mathrm{Rank}\left(\mathrm{x}\right)=\mathrm{Rank}\left(\mathrm{parentNode}\left(\mathrm{x}\right)\right)+\mathrm{Rank}\_\mathrm{Increase}\_\mathrm{Value}$

4:Calculate the Rank_Increase_Value

$\mathrm{Rank}\_\mathrm{Increase}\_\mathrm{value}=\mathrm{RER}+\mathrm{MinHop}\_\mathrm{RankIncrease}$

5:IfBest_ParentNode>= Preferred_ParentNodeThen

Best_ParentNode=Preferred_ParentNode

6:End

7:Whilepreferred_ParentNode==Best_ParentNodedo

SourceNode=Preferred_ParentNode

8:End

9:End

10:Return Optimal Parent