An Improved RFID Anti-Collision Algorithm

Article Preview

Abstract:

The dynamic bit-locking backoff (DBLBO) anti-collision algorithm was proposed on the basis of bit-locking backoff (BLBO) anti-collision algorithm . If there is only one collision bit When the reader is searching the locked collision bit , the reader can identify directly without queries.The proposed algorithm gives full consideration to the number of queries and throughput of the system.The analysis on simulation result indicates that DBLBO performs significantly better than the existing BLBO anti-collision algorithms. It is suitable for the RFID anti-collision protocol in a greater deal.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 791-793)

Pages:

1243-1246

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] FINKENZELLER K. RFID-Handbook Fundamentals and Applications in Contact less Smart Cards and Identification (2nd Edition)[M]. New York: Wiley and Sons, (2003).

DOI: 10.1145/1005062.1005077

Google Scholar

[2] Chen Y H, Horng S J, Run R S, et al. A novel anti-collision algorithm in RFID systems for identifying passive tags[J]. Industrial Informatics, IEEE Transactions on, 2010, 6(1): 105-121.

DOI: 10.1109/tii.2009.2033050

Google Scholar

[3] Wang Xue, Qian Zhi-hong, et al, Research on RFID anti-collision algorithms based on binary tree [J], Journal on Communications, 2010, pp.49-57.

Google Scholar

[4] Chen X, Liu G, Yao Y, et al. IRBST: An improved RFID anti-collision algorithm based on regressive-style binary search tree[C]/Information Technology and Applications (IFITA), 2010 International Forum on. IEEE, 2010, 2: 403-406.

DOI: 10.1109/ifita.2010.84

Google Scholar

[5] Sun Wen-sheng, Hu Ling-min. Anti-collision algorithm for adaptive multi-branch tree based on regressive-style search [J], Journal of Computer Applications, 2011, 31(8): 2052-(2055).

Google Scholar