An Efficient Tree-Based Tag Anti-Collision Protocol for RFID Systems

This paper proposes an efficient tree-based anti-collision protocol for passive tags used in ultra high frequency (UHF) band. To simultaneously achieve the minimization of the time complexity and of the power consumption, this paper first employs the depth-first search (DFS) algorithm as a basic search criterion of this protocol, and then implements the DFS algorithm through a height-oriented method of using an encoded binary number corresponding to the height of the vertex at which the tag collision most recently occurred