Algorithm 4: Routing Table: Calculate $Q_{i,j}$

Require: $L_{D_i}\ne Ø,\forall i\in N=(1,2,..,n)$

Ensure: $Q_{i,j}\ne Ø,\forall i,j\in N$

1: for  $i=1$ n do

2:  for  $j=1$ do n do

3:    $Q_{i,j}=j$

4:   $di{s}_{i,j}=\left|\right|L_{D_i},L_{D_j}{\left|\right|}^2$

5:  end for

6: end for

7: for  $i=1$ to n do

8:  $d=dis$

9:  $M\Leftarrow N\backslash \left(i\right)$

10:  $temp\Leftarrow i$

11:  while  $M\ne Ø$ do

12:   for  $\forall j\in M$ do

13:    if  $d_{i,temp}+d_{temp,j}<d_{i,j}$ then

14:     $d_{i,j}=d_{i,temp}+d_{temp,j}$

15:     $Q_{i,j}=temp$

16:    end if

17:  end for

18:  $find$ j $that$ $d_{i,j}=mi{n}_{k\in M}{d}_{i,k}$

19:   $M\Leftarrow M\backslash j$

20:  $temp\Leftarrow j$

21:   end while

22: end for