Tree-based backoff protocol for fast RFID tag identification

This paper proposes a tree-based backoff (TBB) protocol that reduces the number of iterations implemented in the procedure of tag collision arbitration in radio frequency identification (RFID) systems. This is achieved by employing the following mechanisms: one is send the request command iteratively to all tags in the interrogation zone until a single tag is identified. The other is backward to the parent node instead of root node to obtain the request parameters and send the request command again until all tags are identified. Compared with the traditional tree-based protocol, on average, simulated results show that the TBB protocol reduces the number of the iterations by 72.3% and the identification delay by 58.6% and achieves the goal of fast tag identification.