基于分组机制的位仲裁查询树防碰撞算法

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

提出了一种基于分组机制的位仲裁查询树(GBAQT,bit arbitration query tree based on grouping mechanism)算法。该算法根据标签ID自身特征分组,采用3位仲裁位来取代传统1位仲裁识别标签的方式,通过碰撞位信息得到传输数据,从而能避免一些空闲时隙。算法的性能分析和仿真结果表明,GBAQT防碰撞算法具有较少的总时隙数,系统效率和时隙利用率也明显优于其他算法。

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 results 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.