Tree-based anti-collision algorithm with single error bit tracking for RFID systems

In this paper, we focus on the problem of collision in tags identification in RFID systems. We propose tree algorithm with single error bit tracking that utilizes Manchester coding to know the position of collision bit among the ID of the tags. The reader broadcasts the Query bit that is updated in every collision. The update is done according to the position of the collision bit that allows to reduce the idle slots. Based on the comparison results, the proposed algorithm provides improvements to the existing tree algorithms.