Performance analysis of adaptive tree-based anti-collision protocol using M-ary splitting in RFID

In the large-scale RFID system involving passive tags, tag collisions are preordained, as each tag is unaware of any other tags in the system. Therefore an efficient anti-collision algorithm is a key aspect which greatly affects the identification efficiency. Adaptive Binary Splitting (ABS) has been one of the benchmark protocols in this regard. But this protocol performed binary splitting to resolve collisions, which takes a considerable number of collision cycles to identify a large number of tags. To resolve this, a modified version of ABS has been proposed, where instead of performing binary splitting, an M-ary splitting of tags has been done using the tree splitting approach. The value of M has been chosen in the range of 3 to 10 and the results are analyzed. The analysis helps to empirically determine the best value of M among all the variants of ABS at M ≥ 2. The simulation results show that the variant at M=3 gives a better result in terms of the number of collision cycles and transmitted bits overhead while pertaining a similar identification delay as the ABS protocol.