Study on an Anti-Collision Algorithm of RFID Based on Binary Searching of Backtracking

Article Preview

Abstract:

The problem of anti-collision tag is a common problem of the radio frequency identification (RFID) system. ALOHA algorithm and binary search algorithm is the main algorithm to solve the collision problem. This paper analyzes the effectiveness of binary searching of backtracking algorithm in time slot number of shortening identification tags. Combining the theoretical analysis what needs to be improved in binary searching of backtracking algorithm.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1821-1824

Citation:

Online since:

January 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] W. J. Fan, S. S. Zhang and Z. H. Tian: Computer Applications and Software Vol. 29 (2012), p.191.

Google Scholar

[2] Y. Lu, Y. Zhang and J. D. Qu: Information Technology Vol. 74 (2012), p.213.

Google Scholar

[3] B. Y. Lin: New Edition of Data Structure and algorithm Course (Tsinghua University Press, China 2012).

Google Scholar

[4] S. S. Yu, Y. J. Zhan and W. D. Peng: Computer Engineering and Applications Vol. 16 (2004), p.26.

Google Scholar

[5] C. G. Shan, M. Sun: submitted to Journal of Hefei University of Technology (Natural Science) (2010).

Google Scholar

[6] W. S. Sun: Computer Application Vol. 8 (2011), p. (2052).

Google Scholar