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.
Publisher
Trans Tech Publications, Ltd.
Reference9 articles.
1. Want R. IEEE Pervasive Computing Vol. 5(2006), pp.25-33.
2. Yue Guo, Ligang Hou,: An improved anti-collision algorithm for RFID system(Wireless Communications, Networking and Mo-bile Computing, 2008).
3. EOM J, LEE T. IEEE Communications Letters Vol. 14(2010), pp.60-62.
4. Chen Jiang, Libo Huang. Computer and digital engineering Vol. 39(2011), pp.29-32, in china.
5. Guo Z M, Hu B J. Anti-Counter feiting Security Identification, Vol. 9(2007), p.457.