Title: Four-ary query tree splitting with parallel responses for RFID tag anti-collision

Authors: Ming-Kuei Yeh; Jehn-Ruey Jiang; Shing-Tsaan Huang

Addresses: Department of Information Management, National Taipei College of Business, No. 321, Sec. 1, Jinan Rd., Zhongzheng District, Taipei City 100, Taiwan ' Department of Computer Science and Information Engineering, National Central University, No. 300, Jhongda Rd., Jhongli City, Taoyuan 32001, Taiwan ' Department of Computer Science and Information Engineering, National Central University, No. 300, Jhongda Rd., Jhongli City, Taoyuan 32001, Taiwan

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.

Keywords: RFID tags; radio frequency identification; anti-collision; query tree; tag identification; collision avoidance; tag collision.

DOI: 10.1504/IJAHUC.2014.064423

International Journal of Ad Hoc and Ubiquitous Computing, 2014 Vol.16 No.3, pp.193 - 205

Received: 07 Nov 2012
Accepted: 21 May 2013

Published online: 25 Aug 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article