Improved Binary Tree Search Anti-Collision Algorithm

Article Preview

Abstract:

According to the issue of tag collision in the radio frequency identification technology, this paper proposes a binary tree search anti-collision algorithm, which takes different processing methods according to how many continuous collision. Compared with the dynamic binary tree search algorithm, the improved algorithm reduces the query information send by the reader. At the same time,the algorithm in the process of identifying tags reduces the query information, the query number and tag response times, so as to shorten the recognition time, further improve the search performance.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2012-2018

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Want R. IEEE Pervasive Computing Vol. 5(2006), pp.25-33.

Google Scholar

[2] Yue Guo, Ligang Hou,: An improved anti-collision algorithm for RFID system(Wireless Communications, Networking and Mo-bile Computing, 2008).

DOI: 10.1109/wicom.2008.697

Google Scholar

[3] EOM J, LEE T. IEEE Communications Letters Vol. 14(2010), pp.60-62.

Google Scholar

[4] Chen Jiang, Libo Huang. Computer and digital engineering Vol. 39(2011), pp.29-32, in china.

Google Scholar

[5] Guo Z M, Hu B J. Anti-Counter feiting Security Identification, Vol. 9(2007), p.457.

Google Scholar

[6] Sungsoo Kim, YongHwan kim, Seongjoon Lee,: An Improved Anti-collision Algorithm using parity Bit in RFID System(Seventh IEEE International Symposium on Network Computing and Applications, 2008).

DOI: 10.1109/nca.2008.9

Google Scholar

[7] Yu, S., Y. Zhan, Z. Wang, and Z. Computer Engineering Vol. 31(2005), pp.19-20.

Google Scholar

[8] Ju, W. -C and C. -F. Yu. Journal of Fudan University Vol. 44(2005), pp.46-50.

Google Scholar

[9] Shi, X., X. -W. Shi, Q. Huang, and F. Wei. Progress In Electromagnetics Research B, Vol. 4(2008), pp.263-271.

Google Scholar