Efficient RFID anti-collision scheme with multi-collision reflected frame request

Authors:
Sangho Seo;Sin-Chong Park
Affiliations:
Bit Engineering Laboratory at the System Integration Technology Institute, Information and Communications University, Daejeon, Korea;Bit Engineering Laboratory at the System Integration Technology Institute, Information and Communications University, Daejeon, Korea
Venue:
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Year:
2009

Citing 1
Cited 0

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

Quantified Score

Hi-index	0.01

Visualization

Abstract

To reduce the searching time of the whole transponders in the interrogator's operation range, this paper uses a tree-based searching scheme with multi-collision reflected frame request and multi-responding tag scheduling scheme. This scheme enables efficient burst UID receptions of the transponders, and eliminates unnecessary frame overhead. To show the feasibility of this scheme, total searching time is simulated as a parameter of UID length and tag density. The results are compared with that of the basic tree-based anti-collision scheme, and the better performance is reported. Especially for the same UID length, the proposed scheme can reduces the searching time up to 50%.