Algorithm 1 Simulation algorithm for CF process

1:Initialize $R_{cov}$, $N_{ch}$, N, $L=$ 100,000, $consumedEnergyCF\left(\right)$, $collisionCount$, $trOne=0$, $numSuccessSlots=0$, $A_{obs}$; 2:deploySensors(), deploys N sensors with uniform random distribution; 3:for$l=0$ to $l<L$ do 4: Define $k=0$, $\sigma =0.1$, $\tau =0.1$, $successfulNode=0$, $N=N_{new}$, $N_{col}$,$nodoId=\left[\right]$, $nodoCH$; 5: Program event $objectType[0,1]=“slot”$; 6: if $successfulNode<N_{new}$ then 7:  Delete first event $objectType.splice\left[0\right]$; 8:  if $objectType\left[0\right]==slot$" then 9:   Program next event $objectType.push\left[0\right]$; 10:   $tr=0$, $trOne=0$; 11:   for $j=0$ to $j<N_{new}$ do 12:    $u=random\left(1e^6\right)/1e^6$ 13:    if $u<\sigma$ then 14:     $tr++$ 15:    end if 16:   end for 17:   for $i=0$ to $tr$ do 18:    Choose 1 from N: $nodoId\left[i\right]=random(0,N)$ 19:    for $j=0$ to $successfulNode\left[j\right]$ do 20:     if $nodoId\left[i\right]==successfulNode\left[j\right]$ then 21:      repeat if $succesfulNode\left[i\right]$ is already successful: $i=i-1$ 22:     end if 23:    end for 24:    $consumedEnergyCF\left(\right)$; 25:   end for 26:   if $tr==1$ then 27:    $trOne=1$; 28:   end if 29:   $collisionCount=0$; 30:   for $j=0$ to $j<N_{col}$ do 31:    $u=random\left(1e^6\right)/1e^6$ 32:    if $u<\tau$ then 33:     $tr++$, $collisionCount++$; 34:    end if 35:   end for 36:   if $tr==1$ then 37:    $numSuccessSlots++$; 38:    $N_{col}=N_{col}-collisionCount$; 39:    $N_{new}=N_{new}+collisionCount$; 40:    $successfulNode\left[i\right]=nodoId\left[0\right]$; 41:    $k=k+1$; 42:   end if 43:   if $tr>=2$ then 44:    $N_{col}=N_{col}+trOne$; 45:    $N_{new}=N_{new}-trOne$; 46:   end if 47:   if $succesfullNode\left[i\right].length>=N_n$ then 48:    $k=0$; 49:   end if 50:   for $j=0$ to $j<N_{ch}$ do 51:    $k=0$; 52:    $nodoCH\left[j\right]=successfulNode\left[j\right]$; 53:    and the rest are CMs 54:   end for 55:  end if 56: end if 57:end for