Abstract: In the RFID system, tag-to-reader communication collision occurs when more than one tag responds to a reader's interrogation at the same time. Without any coordination among the reader and the tags, the responses from the tags will become illegible to the reader. Anti-collision algorithms for passive RFID tag identification are significant for fast and correctly obtaining the tags ID. This paper presents a novel anti-collision algorithm which is called stack-based ID-binary tree anti-collision algorithm (SIBT). The novelty of the SIBT algorithm is that the algorithm maps a set of n tags into a corresponding ID-binary tree, and sees the process of collision arbitration as a process of building the ID-binary tree. In order to efficiently construct an ID-binary tree, the reader uses a stack to store the threads of the construction information while the tag uses a counter to keep track of the stack position where the tag is on. Both theoretic results and simulation performance evaluations show that the SIBT outperforms other tree based tag anti-collision algorithms.