By Topic

General binary tree protocol for coping with the capture effect 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

2 Author(s)
Yuan-Cheng Lai ; Dept. of Inf. Manage., Nat. Taiwan Univ. of Sci. & Technol., Taipei, Taiwan ; Ling-Yen Hsiao

Tag anti-collision is an important issue in RFID systems because the reader must recognize all tags efficiently. In RFID wireless communication systems, tag identification will encounter the capture effect, where a reader decodes a tag ID even when multiple tags simultaneously transmit their signals. This letter proposes a tag anti-collision algorithm - the generalized binary tree protocol (GBT). GBT separates the identification process into several binary tree (BT) cycles to solve the problem caused by the capture effect. Unrecognized tags, hidden by the capture effect in a BT cycle, will be identified in subsequent cycles. The formal analysis of identification delay for GBT is derived and simulation and analytical results show that GBT significantly outperforms other existing algorithms.

Published in:

Communications Letters, IEEE  (Volume:14 ,  Issue: 3 )