Two blocking algorithms on adaptive binary splitting: single and pair resolutions for RFID tag identification

Authors:
Yuan-Cheng Lai;Chih-Chung Lin
Affiliations:
Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan, R.O.C.;Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan, R.O.C.
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2009

Citing 6
Cited 1

Efficient Object Identification with Passive RFID Tags

Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
An Enhanced Dynamic Framed Slotted ALOHA Algorithm for RFID Tag Identification

MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
Tree Slotted Aloha: a New Protocol for Tag Identification in RFID Networks

WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
Tag-Splitting: Adaptive Collision Arbitration Protocols for RFID Tag Identification

IEEE Transactions on Parallel and Distributed Systems
An Enhanced Anti-collision Algorithm in RFID Based on Counter and Stack

ICSNC '07 Proceedings of the Second International Conference on Systems and Networks Communications
An Adaptive Memoryless Protocol for RFID Tag Collision Arbitration

IEEE Transactions on Multimedia

An RFID anti-collision algorithm with dynamic condensation and ordering binary tree

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In radio frequency identification (RFID) systems, the reader identifies tags through communication over a shared wireless channel. When multiple tags transmit their IDs simultaneously, their signals collide, increasing the identification delay. Therefore, many previous anti-collision algorithms, including an adaptive query splitting algorithm (AQS) and an adaptive binary splitting algorithm (ABS), focused on solving this problem. This paper proposes two blocking algorithms, a single resolution blocking ABS algorithm (SRB) and a pair resolution blocking ABS algorithm (PRB), based on ABS. SRB not only inherits the essence of ABS which uses the information of recognized tags obtained from the last process of tag identification, but also adopts a blocking technique which prevents recognized tags from being collided by unrecognized tags. PRB further adopts a pair resolution technique which couples recognized tags and thus only needs half time for next identifying these recognized tags. We formally analyze the performance of SRB and PRB. Finally, the analytic and simulation results show that SRB slightly outperforms ABS and PRB significantly surpasses ABS.