Journal on Communications ›› 2015, Vol. 36 ›› Issue (7): 129-137.doi: 10.11959/j.issn.1000-436x.2015161

• Academic paper • Previous Articles     Next Articles

Improved tree structure anti-collision algorithm of RFID

Xue WANG,Zhi-hong QIAN,Xiao-hui LIU,Chao CHENG   

  1. School of Communication Engineering,University of Jilin,Changchun 130012,China
  • Online:2015-07-25 Published:2015-07-25
  • Supported by:
    The National Natural Science Foundation of China;The National Natural Science Foundation of China;The Research Fund of the Doctoral Program of Higher Education of China;China Postdoctoral Science Foundation

Abstract:

The whole big query tree is divided into several branches,and the work of tag recognition is executed in each branch,thus reducing the probability of tag collision.The proposed algorithm can be divided into prefix determination and branch query two phases.In the prefix determination phase,the prefix of every tag is identified,and each prefix denotes a branch.Traverse each branch by turns to recognize tags; in the branch query phase,backward search strategy and dynamic search method are used.Theoretical analysis and simulation experiment show that when the improved algorithm can improved the overall performance of RFID system from the aspects of the number of queries,time delay,and throughput.

Key words: RFID, anti-collision, tree structure, prefix query, backward search

No Suggested Reading articles found!