Algorithm 2. Pseudo-code for bit-collision cases

input: $T$ output: $T$ with the bit-collision cases in each internal node 1.  compute $I{D}_n$ in each node $n$ $\in$ $T$ 2.  $G\left(T_{\pi }\right)$ 3.  function $G\left(n\right)$ 4.    if $n_l$ ≠ leaf node then $G\left(n_l\right)$ end if 5.    if $n_r$ ≠ leaf node then $G\left(n_r\right)$ end if 6.    if |$I{D}_n$| ≤ $\delta$ then 7.     $Z_n\leftarrow$ all combinations of n  8.     for (i=1; i ≤ |$Z_n$|, i++) do 9.      $Y_{n,i}=$ bit response of all tag IDs in $Z_{n,i}$ //the collided bit is marked as “X”// 10.         save a new case ($Z_{n,i}$, $Y_{n,i})$ into $Cas{\mathrm{e}}_n$ 11.     end for 12.    end if 13. end function