Smart Trend-Traversal Protocol with Shortcutting for Memory-less RFID Tag Collision Resolution

Efficient resolution of the collisions caused by a large number of electronic tags is a key for the universal adoption of the RFID systems. Recently, the STT (Smart Transversal Tree) protocol is proposed as a new binary query tree based protocol for efficient tag collision resolution. This paper suggests that when combined with shortcutting to skip the query which is determined to result in collision and avoiding the protocol moving in the bottom level of the binary query tree, a lot of queries needed in the STT protocol can still be saved, and the performance of the STT protocol can be further improved. Performance evaluations are also performed and it is verified that combined with shortcutting, the average number of queries needed and the amount of data broadcasted by the reader for the identification of a tag using the STT protocol, can be reduced significantly.