A Biased Modified Binary Query Tree Protocol for RFID Tag Collision Resolution

The last few years have witnessed the emergence of RFID system in a lot of application fields. However, a key issue that affects the universal deployments of the RFID system is the the tag collisions, which are caused by that multiple tags tries to transmit their digital identifiers through the air interface simultaneously. In this paper, a biased query tree protocol to resolve the collision occurred in the multiple access channel is proposed, and the performance of this protocol is well analyzed. Based on the discussion, a biased bi-slot binary query tree protocol for the efficient and complete resolution of memoryless RFID tags is presented. Numeric evaluations verify that this protocol performs a little better than the binary query tree and modified query tree protocols.