A novel approach for ID distribution problem in Tree-based tag anti-collision protocols of RFID systems

Tag collision is one of the most important issues in RFID systems and many tag anti-collision protocols were proposed in literature. But some kind of these protocols like Tree-based protocols (specifically Query tree) which its performance depends on tag ID length and construction, have some issues like ID distribution. In this paper we discuss about Query tree protocol which may influenced by ID distribution. Then we propose a novel type of this protocol called Informatics Query tree to solve it. Then we evaluate the performance of presented protocol to approve its benefits.