Algorithm 2 CC-link establishment

1:  $f$: the failed node; $N_f$: the 1-hop neighbors of node $f$

2:  $M_f$: the node connectivity materiality

3:  $u$: the source node; $d$: the destination node

4:  $\mathrm{A}=\left\{N_1,N_2,\dots ,N_m\right\}$ includes all the neighbor nodes of $u$; $m$: the total number of neighbors of $u$

5:  $H_{\left(u\right)}$: the helper set of source node $u$; $\phi$: the cooperation set

6:  $H_{\left(u\right)}\leftarrow \varphi ,\phi \leftarrow u,k\leftarrow 0$

7:  while ${\sum }_{i\in \phi }{P}_i^c{\left(d_{id}\right)}^{-\partial }<\tau$ and $k<m$ do

8:   $k\leftarrow k+1;H_{\left(u\right)}\leftarrow H_{\left(u\right)}\cup N_k;\phi \leftarrow \phi \cup H_{\left(u\right)}$

9:  end while

10: if $k=m$ then

11:   if ${\sum }_{i\in \phi }{P}_i^c{\left(d_{id}\right)}^{-\partial }\ge \tau$ then

12:    Return $H_{\left(u\right)}$, ${\sum }_{i\in \phi }{P}_i\left(d\right)$

13:   else

14:     Announce the failure of CC-link establishment

15:   end if

16: else

17:   if ${\sum }_{i\in \phi }{P}_i\left(d\right)<{\sum }_{i\in \phi \cup N_{k+1}}{P}_i\left(d\right)$ then

18:    Return $H_{\left(u\right)}$, ${\sum }_{i\in \phi }{P}_i\left(d\right)$

19:   else

20:    $k\leftarrow k+1;H_{\left(u\right)}\leftarrow H_{\left(u\right)}\cup N_k;\phi \leftarrow \phi \cup H_{\left(u\right)}$

21:   end if

22: end if

23: the source and destination nodes will interchange and establish the CC-link again in reverse