Algorithm 3 Switching leader–follower connection.

for$i=1$ to $N_L$ do    for $j=1$ to N do      $x\leftarrow$ random number $x\in (0,1)$      if $x>l$ then         $temp\left(j\right)\leftarrow 1$      else         $temp\left(j\right)\leftarrow 0$      end if    end for    $LF\_con(i,:)\leftarrow temp$ end for