摘要： 针对现有基于树的防碰撞算法碰撞时隙多、识别效率低等问题,提出一种基于信息位分组的标签防碰撞算法。按照标签信息位中比特“1”的数目将标签分组,发生碰撞时若有多个标签满足标签预测识别条件,则可直接全部识别,否则根据碰撞位还原机制跳过无效碰撞时隙,确定新的搜索前缀。仿真结果表明,相对查询树、自调整混合树及改进的多比特识别算法,该算法能降低阅读器的搜索次数和系统的通信复杂度,有效提高系统识别效率,且随着标签数量增大其优势更明显。

关键词: 射频识别, 标签碰撞, 信息位分组, 通信复杂度, 识别效率

Abstract: Aiming at the problem that the existing anti-collision algorithms based on tree have too many collision slots and low recognition efficiency,an anti-collision algorithm based on Information Bit Grouping (IBG) is proposed.The tags is grouped according to the number of bit “1” in tag information bits.When the collision occurs,if multiple tags meet the prediction recognition condition,those tags can be fully identified,otherwise the invalid collision slots will be skipped and new query prefixes will be generated according to the collision recovery mechanism.The simulation results show that the proposed algorithm can reduce the reader’s search times and the communication complexity of the system,effectively improve the recognition efficiency of system compared with Query Tree(QT) algorithm,Adjustive Hybird Tree(AHT) algorithm and Enhanced Multi-Bit Identification(EnMBI) algorithm,especially with the increase of the number of tags,the advantage is more obvious.

Key words: Radio Frequency Identification(RFID), tag collision, Information Bit Grouping(IBG), communication complexity, recognition efficiency

中图分类号: 

• TP301.6