Anti-Collision Algorithm for RFID Based on Dynamic Packet Query Tree

Article Preview

Abstract:

Based on the analysis of typical binary and dynamic binary search anti-collision algorithm in RFID system, this article proposes a fast and efficient anti-collision algorithm, that is, conduct dynamic packet on tags and adjust query instruction. The performance analysis and experiments show: this algorithm greatly reduces the tag identification time, and increases the identification efficiency of RFID system. At the same time, it reduces information exposure of tags when reader communicates with tags, and effectively decreases the collision probability of tags.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

550-555

Citation:

Online since:

December 2010

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Dj.M. Maric, P.F. Meier and S.K. Estreicher: Mater. Sci. Forum Vol. 83-87 (1992), p.119.

Google Scholar

[2] M.A. Green: High Efficiency Silicon Solar Cells (Trans Tech Publications, Switzerland 1987).

Google Scholar

[3] Y. Mishing, in: Diffusion Processes in Advanced Technological Materials, edtied by D. Gupta Noyes Publications/William Andrew Publising, Norwich, NY (2004), in press.

Google Scholar

[4] G. Henkelman, G. Johannesson and H. Jónsson, in: Theoretical Methods in Condencsed Phase Chemistry, edited by S.D. Schwartz, volume 5 of Progress in Theoretical Chemistry and Physics, chapter, 10, Kluwer Academic Publishers (2000).

Google Scholar

[5] R.J. Ong, J.T. Dawley and P.G. Clem: submitted to Journal of Materials Research (2003).

Google Scholar

[6] P.G. Clem, M. Rodriguez, J.A. Voigt and C.S. Ashley, U.S. Patent 6, 231, 666. (2001).

Google Scholar

[7] Information on http: /www. weld. labs. gov. cn.

Google Scholar