An Anticollision Protocol of Adaptive Tree Slot Without Tag Estimation

摘要

In order to improve the throughput of tags identification in the system of radio frequency identification (RFID), the anticollision protocol of adaptive tree slot is proposed, and that is a tag anticollision algorithm in view of the Q algorithm. In this protocol, the rest of the tags will be waiting until those that are in the first collision slot are decomposed with the method of the binary tree. Besides, the tags in the rest of the collision slots will be resolved by the tree slot. The advantage of the proposed protocol lies in the fact that it does not need the prior information about tags, which can reduce the complexity of the system; furthermore, the system with high identification efficiency can be kept, and the change of the tag quantity cannot influence it. It indicates in our simulations that the identification efficiency of the system does not fluctuate much when the number of tags is between 40 and 500; moreover, when the tag quantity does not approach to the original frame length, the identification efficiency of the system is higher than the tree slotted ALOHA (TSA) algorithm and fast k-slot selection (FKSS) protocol.