By Topic

A Novel Query Tree Protocol with Bit Tracking in RFID Tag Identification

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
$31 $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

5 Author(s)
Yuan-cheng Lai ; Dept. of Inf. Manage., Nat. Taiwan Univ. of Sci. & Technol., Taipei, Taiwan ; Ling-Yen Hsiao ; Hong-Jie Chen ; Ching-Neng Lai
more authors

Tag anticollision has long been an important issue in RFID systems. To accelerate tag identification, some researchers have recently adopted bit tracking technology that allows the reader to detect the locations of collided bits in a collision slot. However, these methods still encounter the problem of too many collisions occurring at the beginning of identification. This paper proposes an optimal query tracking tree protocol (OQTT) that tries to separate all of the tags into smaller sets to reduce collisions at the beginning of identification. Using bit tracking technology, OQTT mainly adopts three proposed approaches, bit estimation, optimal partition, and query tracking tree. Bit estimation first estimates the number of tags based on the locations of collided bits. Optimal partition then determines the optimal number of the initial sets based on this estimation. Query tracking tree splits a set of collided tags into two subsets using the first collided bit in the tag IDs. This paper analyzes the efficiency of OQTT, which represents how many tags can be identified in a slot. Results show that its efficiency is close to 0.614, the highest efficiency published to date. The simulation results further show that OQTT outperforms other existing algorithms.

Published in:

Mobile Computing, IEEE Transactions on  (Volume:12 ,  Issue: 10 )