Algorithm 2: Validate Neighbours for BC Network

function:safeNodeBC output:Validated Neighbours procedure:  fori in$n_{*}$,$n_{*}ϵN$∀∗=1, …, n do    adj.n∗[i].node={}← create empty sorted list of adjacency nodes   forj in$n_{*}$,$n_{*}ϵN$∀∗=1, …, n and j ≠ ido     $t_{\left(i, j\right)}^{p_1}$← Calculatefirst point of time for communication    if$t_{\left(i, j\right)}^p$==$t_{\left(i, j\right)}^{p_{max}}and{T}_{e{x}_{}^i}^i$==$T_{e{x}_{}^j}^j$do      $P_{\left(i, j\right) }^A\left(t\right)=1$     adj.n∗[i].node ← j       $P_{\sigma i}^C\left(t, N\right)=P_{\sigma i}^C\left(t, N\left\{j\right\}\right)$       $T_{i, j}^A=T_{i-1, j-1}^A \backslash \left\{\left\{i,j\right\}; \forall i\ne j\right\}$     else       $P_{\left(i, j\right) }^A\left(t\right)=0$       $P_{\sigma i}^C\left(t, N\right)=P_{\sigma i}^C\left(t, N\right)$      $T_{i, j}^A=T_{i-1, j-1}^A$    return adj.n∗