An Effective 16-bit Random Number Aided Query Tree Algorithm for RFID Tag Anti-Collision

A tag-collision problem (or missed reads) in RFID system is the event that a reader cannot identify the tag if many tags respond to a reader at the same time. Recently, Choi et al. proposed a 16-bit random number query tree algorithm (RN16QTA) for RFID tag anti-collision by using a RN16 as the tags temporary ID. RN16QTA successfully reduce the time consumption for tag identification than the present identification implemented in EPC Class 1 Gen. 2. However, simulation results and the theoretical estimation imply that the length of RN16 is actually not enough in real environments to successfully identify tags. In this letter, we propose an effective RN16QTA (ERN16QTA) to really solve the tag collision in tags identification. Moreover, our new algorithm saves the responded bits.