Four–ary query tree splitting with parallel responses for RFID tag anti–collision. (26th August 2014)

• Record Type: Journal Article
• Authors: Yeh, Ming–Kuei; Jiang, Jehn–Ruey; Huang, Shing–Tsaan
• Is Part Of: International journal of ad hoc and ubiquitous computing. Volume 16:Number 3(2014)
• Page Start: 193
• Page End: 205
• Publication Date: 2014-08-26
• Subjects: RFID tags -- radio frequency identification -- anti–collision -- query tree -- tag identification -- collision avoidance -- tag collision; Ubiquitous computing -- Periodicals; Embedded computer systems -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; Wireless communication systems -- Periodicals; Computer architecture -- Periodicals; 004.2
• Languages: English
• ISSNs: 1743-8225

Abstract

In a radio frequency identification (RFID) system, tags can be identified by a reader when they are within the interrogation zone of the reader. Collisions occur when tags using backscatter technology report their IDs to the reader at the same carrier frequency simultaneously. The performance of tag identification is degraded by collisions, so it is important to address the tag collision problem. Several anti–collision protocols have been proposed for reducing tag collisions. They can be categorised into two classes: ALOHA–based and tree–based protocols. This paper proposes a 4–ary query tree–based anti–collision protocol, namely the parallel response query tree (PRQT) protocol, to improve the performance of tag identification. In the PRQT protocol, the tags with the ID prefix matching either the reader's request bit string or the complementary of the string are arranged to respond in two subcarriers in parallel. The PRQT protocol is analysed, simulated and compared with related ones to demonstrate its advantages.