Brief Paper: Simplified Tag Identification Algorithm by Modifying Tag Collection Command in Active RFID System

Abstract

In this paper, we propose a simplified tag collection algorithm to improve the performance of ISO / IEC 18000-7, the standard of active RFID systems. In the proposed algorithm, the collection command is modified to include the result of the listening period response from the previous round. The tag, which has received the collection command, checks whether the slot to which it has responded is collided, transmits additional data to its data slot without a point-to-point read command and sleep command, and transitions to the sleep mode. The collection round in the standard consists of a series of collection commands, collection responses, read commands, read responses, and sleep commands. On the other hand, in the proposed tag collection algorithm, one collection round consists only of a collection command and a collection response. As a result of performance analysis, it can be seen that the proposed technique shows superior performance compared to the standard.

Research on the RFID Anticollision Strategy Based on Decision Tree

“…Only one query needs to be sent in the query process, because the tag ID has the principle of binary certainty. If there are only two tags in the collision cycle (time slot) and there is only one bit collision, the rest of the IDs of the two tags are exactly the same except the collision bits [12]. The tag ID is composed of "0" and "1," so the two tags can be identified by using only one query request in a query cycle.…”