General binary tree protocol for coping with the capture effect in RFID tag identification

Authors:
Yuan-Cheng Lai;Ling-Yen Hsiao
Affiliations:
Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan;Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan
Venue:
IEEE Communications Letters
Year:
2010

Citing 3
Cited 2

Energy-Aware Tag Anti-Collision Protocols for RFID Systems

PERCOM '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications
Short survey: Taxonomy and survey of RFID anti-collision protocols

Computer Communications
Using generalized query tree to cope with the capture effect in RFID singulation

CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference

Interference cancellation-based RFID tags identification

Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
An RFID anti-collision algorithm with dynamic condensation and ordering binary tree

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.