A Fast Tag Anti-Collision Algorithm for RFID Systems

Article Preview

Abstract:

A fast tag anti-collision algorithm is proposed based on the binary search algorithm. First, the reader sends a query to make sure of what prefixes all the tags have, and the prefixes were pushed into a stack. Then queries containing the prefix information are sent to identify the tags. During the query process, the bits of data transmitted between the reader and the tags were greatly reduced; the back track strategy was adopted to reduce the reader query times. Simulation results show that the proposed algorithm achieves better performance than other algorithms by reducing query times and identification delay and increasing throughput, and is more suitable for the identification of great amounts of data in Internet of Things environment.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 791-793)

Pages:

1393-1396

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] K. Finkenzeller, RFID Handbook: Fundamentals and Applications in Contactless Smart Card and Identification, Second Edition, John Wiley & Sons Ltd, (2003).

DOI: 10.1145/1005062.1005077

Google Scholar

[2] Yi. Jiang and Ruonan. Zhang, An Adaptive Combination Query Tree Protocol for Tag Identification in RFID Systems, IEEE COMMUNICATIONS LETTERS, VOL. 16, NO. 8, AUGUST (2012).

DOI: 10.1109/lcomm.2012.060112.120345

Google Scholar

[3] L. Meng, Q. Zhi-hong, Slot-predicting based ALOHA algorithm for RFID anti-collision (inChinese), Journal on Communications. VOL. 32, NO. 8, December (2011).

Google Scholar

[4] V. Namboodiri and L. Gao, Energy- aware tag anti-collision protocols for RFID systems, IEEE Transactions on Mobile Computing, Vol. 9, No. 1, pp.44-59, January (2010).

DOI: 10.1109/tmc.2009.96

Google Scholar

[5] W. Xue, Q. Zhi-hong, Research on RFID anti-collision algorithms based on binary tree[J] (in Chinese), Journal on Communications. VOL. 31, NO. 6, December (2010).

Google Scholar

[6] YU S S, ZHAN Y J, WANG Z P, et al . Anti-collision algorithm based on jumping and dynamic searching and its analysis [J]. Computer Engineering, 2005, 31: 19-20.

Google Scholar