A tree-based backoff protocol for tag collision arbitration in RFID systems

Tag collision arbitration for the multiple tags is a significant issue for fast identification. This paper proposes a tree-based backoff (TBB) protocol to reduce the number of the iterations implemented in the procedure of the tag collision arbitration. Compared with traditional tree-based protocol, simulated results show that the TBB protocol reduces the computational complexity efficiently by employing backoff mechanism and finally accelerates tags identification.