Abstract-In this paper we present a new tree searchbased protocol for the anti-collision problem of RFID systems. This protocol builds a binary search tree according to the prefixes chosen randomly by tags rather than using their ID-based prefixes. Therefore, the tag identification time of the proposed protocol is no longer limited by the tag ID distribution and ID length as the conventional tree search protocol. The time complexity of the protocol is derived and shown that it can identify tags faster than the Query-Tree protocol.
In REF , a Prefix-Randomized Query Tree protocol is proposed, where tags randomly choose the prefixes rather than using their ID-based ones.
Prefix-Randomized Query-Tree Protocol for RFID Systems
2006 IEEE International Conference on Communications
2006 IEEE International Conference on Communications
Computer Science