Algorithm 4. Pseudo-code for identification operation

input: $T$ with the bit-collision cases and their actions in each internal node output: the identified tag IDs 1. $K\leftarrow$ $T_{\pi }$; $Q\leftarrow \varnothing$ 2. while $K\ne$ empty do 3.   $n$ $\leftarrow$ pop the top node of $K$ 4.    if ($n$ is not leaf node) then 5.    broadcast concatenated $S_n$ except if $n=$ $T_{\pi }$ then broadcast “INITIALIZATION” 6.    $b$ ← tags’ response 7.    switch b 8.      no signal: no tag                      //idle slot// 9.      no “X”: identify tag ID=b                //readable slot// 10.     having “X”:                           //collision slot// 11.       find (d, $Y_{n,i}$, a) in $Ac{t}_n$ where $Y_{n,i}=b$  //find a matched entry// 12.       while finding any new entry 13.        switch a 14.          “READ”: identify d 15.          “ABSENCE”: d disappears 16.          “COPUING”: insert $d$ into $Q$ 17.          “SPLIT”: push $n_r$ and $n_l$ into $K$; break while 18.        end switch                     //switch a// 19.       end while 20.    end switch                              //switch b// 21. end while