Memoryless Query Tree Algorithm for Identifying Tags in Passive RFID Systems
Publication Date : 20/10/2017
This paper proposes a revised query tree algorithm in RFID systems. In the proposed algorithm, the tag will send the remaining bits of their identification codes when the query string matches the first bits of their identification codes. When the reader receives all the responses of the tags, it knows which bit is collided. If the collision occurs in the last bit, the reader can identify two tags simultaneously without further query. While the tags are sending their identification codes, if the reader detects a collision bit, it will send a signal to the tags to stop sending. According to the simulation results, the proposed algorithm outperforms the QT algorithm in terms of the number of queries and the number of response bits.
No. of Downloads :