Journal on Communications ›› 2016, Vol. 37 ›› Issue (1): 123-129.doi: 10.11959/j.issn.1000-436x.2016014

• Academic paper • Previous Articles     Next Articles

Bit arbitration query tree anti-collision algorithm based on grouping mechanism

Yu FU1,hong QIANZhi1,Chao CHENG2,hui LIUXiao1   

  1. 1 College of Communication Engineering, Jilin University ngchun 130012, China
    2 School of Computer Science & Engineering, Changchun University of Technology, Changchun 130012, China
  • Online:2016-01-25 Published:2016-01-27
  • Supported by:
    The National Natural Science Foundation of China;Research Project of Science and Technology Department of Jilin Province

Abstract:

A bit arbitration query tree anti-collision algorithm based on grouping mechanism was proposed. GBAQT divided tags into two groups according to the tag ID's feature and used three arbitration bits to identify tags instead of using one bit in traditional methods. The reader can obtain the transmit data based on information of collision bits and thus avoid some idle timeslots. The algorithm performance analysis and simulation resu show that GBAQT anti-collision algorithm has fewer total number of timeslots. Timeslot utilization and system efficiency of GBAQT algorithm are significantly better than the other algorithms.

Key words: RFID, tag anti-collision, query tree, grouping mechanism

No Suggested Reading articles found!