ABSTRACT

This chapter introduces tree-based tag anticollision protocols and adaptive splitting protocols, an adaptive query splitting (AQS) protocol and an adaptive binary splitting (ABS) protocol, which are enhanced versions of tree-based protocols by suppressing the occurrence of tag collisions and shortening tag identification delay. By restraining the occurrence of collisions, AQS and ABS have shorter delay than the binary tree protocol and the query tree protocol. Tree-based tag anticollision protocols perform tag identification in units of reading cycle. In tree-based protocols, the reader recognizes all the tags within its reading range during an identification frame, which consists of several reading cycles. In a tree of an identification frame, only a node of a collision cycle has two child nodes because a set is split into two subsets in the collision cycle. Resolution of tag collisions consumes the tag’s limited energy and causes additional identification delay.