An efficient anti-collision protocol for RFID tag identification

Authors:
Xiaolin Jia;Quanyuan Feng;Chengzhen Ma
Affiliations:
School of Information Science and Technology, Southwest Jiaotong University, Sichuan, China and School of Computer Science and Technology, Southwest University of Science and Technology, Sichuan, ...;School of Information Science and Technology, Southwest Jiaotong University, Sichuan, China;School of Information Science and Technology, Southwest Jiaotong University, Sichuan, China
Venue:
IEEE Communications Letters
Year:
2010

Citing 4
Cited 1

Efficient memoryless protocol for tag identification (extended abstract)

DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification

RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification
Tag-Splitting: Adaptive Collision Arbitration Protocols for RFID Tag Identification

IEEE Transactions on Parallel and Distributed Systems
Instant collision resolution for tag identification in RFID networks

Ad Hoc Networks

Enhanced ALOHA algorithm for chirp spread spectrum positioning

ICPCA/SWS'12 Proceedings of the 2012 international conference on Pervasive Computing and the Networked World

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, an efficient anti-collision protocol, named collision tree protocol (CT), is proposed, and a collision tree is put forward to capture the complete communications between the reader and tags in an execution of CT. The main novelty of CT is that both the generating of prefixes and the splitting of tag group are according to the collided bit directly. Both the properties of collision tree and the results of experiments show that the proposed protocol improves the efficiency of tags identification up to 50% and achieves the best performance of the tree-based tags identification protocols.