Algorithm 1 CSFR

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

2: $M_f$: the node connectivity materiality

3: if $1<M_f<\infty$ then

4: for every node j and $l$ in $N_f$, which $j\ne l$ do

5:  if the distance $d_{jl}>R_c$ and $d_{jl}$ is the shortest distance among the 1-hop neighbors then

6:   $u\leftarrow \mathrm{the}\mathrm{source}\mathrm{node}$, $d\leftarrow \mathrm{the}\mathrm{destination}\mathrm{node}$;

7:  end if

8: end for

9: Algorithm 2 CC-link establishment

10: end if