By Topic

Parallel Response Query Tree Splitting for RFID Tag Anti-collision

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ming-Kuei Yeh ; Dept. of Inf. Manage., Nanya Inst. of Technol., Taiwan ; Jehn-Ruey Jiang ; Shing-Tsaan Huang

In an RFID system, a tag can be identified by a reader when it moves into the interrogation zone of the reader. Collisions occur when tags using backscatter technology respond 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 reduce them. Several anti-collision protocols have been proposed for reducing tag collisions. They can be categorized into two classes: ALOHA-based and tree-based protocols. In this paper, we propose a 4-ary query tree-based anti-collision protocol, namely parallel response query tree (PRQT) protocol, to improve the performance of tag identification. In PRQT protocol, the tags with the ID prefix matching the reader's request bit string or the complementary of the string are arranged to respond in two sub carriers in parallel. We also conduct simulation experiments for the proposed protocol and compare it with related ones to demonstrate its advantages.

Published in:

2011 40th International Conference on Parallel Processing Workshops

Date of Conference:

13-16 Sept. 2011