A RFID Anti-Collision Algorithm Based on Cutting away Branches and its Analyses

Abstract:

The EPC of tags has uniqueness, different tags can be distinguished by its binary-tree structure. In the reader's processing area, there are a lot of idle nodes in the binary-tree that is composed of some tags. If the reader ignores them when searching, all tags can be identified with high efficiency. In this paper, its mathematic model of efficiency is analyzed from simplicity to complexity. First of all, the case of two tags with four bits EPC is explained, then the case of two tags with N bits EPC is generalized. Secondly, by converting complexity into simplicity, a general conclusion is obtained based on probability and induction. Its simulating result indicates that its rate of identification is 50%.

• Periodical: Applied Mechanics and Materials (Volumes 20-23)
• Pages: 259-264
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.20-23.259
• Online since: January 2010
• Authors: Song Sen Yu, Yun Peng, Gang Liu
• Keywords: Anti-Collision, Cutting Away Branches, Internet of Things (IOT), Radio Frequency Identification (RFID)

References

[1] Steve Melon, Toward a Global "Internet of Things" , www. developers. sun. com November 11, 2003 P1.

[2] Imrich chalamtac, chiara Petriol , Jason Redi Energy-Conserving Access Protocols for Identification Networks IEEE/ACM Tramsactions on Networking 1998, P1.

[3] Richard Kalinowski, Michel Latteux , David Simpwt. An adaptive anti-collision protocol for smart tags(2001) , www. lifl. fr/~simplot/recherch/articles.

[4] Yanweimin, Wuweimin Data Structure the Tsinghua University Press P118~124 (1992).

[5] Wangfubao Theory of probability and mathematical statistics the Tongji University Press P12~45.