基于映射序列码的自适应查询树防碰撞算法  

Self-adaptive Query Tree Anti-Collision Algorithm Based on Mapping Sequence Code

作　　者：薛伟莲 陈杰 李雪娇 沈阳 XUE Wei-lian;CHEN Jie;LI Xue-jiao;SHEN Yang(School of Government,Liaoning Normal University,Dalian 116029,China)

机构地区：[1]辽宁师范大学政府管理学院,辽宁大连116029

出　　处：《软件导刊》2022年第2期68-72,共5页Software Guide

基　　金：国家自然科学基金项目(61772251)。

摘　　要：针对射频识别(RFID)中的标签碰撞问题,提出一种基于映射序列码的自适应查询树(MAQT)算法。该算法根据最高碰撞位为首的连续3个比特位的特征,并结合唯一的映射关系,准确地推断出当前查询时隙存在的查询前缀,达到消除空闲时隙、减少碰撞时隙的目的。仿真结果表明,当待识别标签数量达到1 000时,MAQT算法相比GBAQT算法能够减少10.8%总时隙数,吞吐率可维持在0.61左右。该算法能够减少总时隙数,提高系统效率。Aiming at solving the problem of tag collision in radio frequency identification(RFID)system,proposed an adaptive query tree anti-collision algorithm based on mapping sequence code(MAQT). The algorithm is based on the characteristics of the three consecutive bits headed by the highest collision bit,and combining with the unique mapping relationship,the algorithm can accurately infer the query prefix existing in the current query slot,so as to eliminate the idle slots and reduce the collision slots. Simulation results show that,When the number of tags to be identified reaches 1 000,MAQT algorithm can reduce the total slot number by 10.8% compared with GBAQT algorithm,and the throughput can be maintained at about 0.61. The algorithm can reduce the total number of time slots and improve the system efficiency.

关 键 词：射频识别 防碰撞算法 查询树 映射关系 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]