基于汉明权重分组的自适应查询树算法  

Adaptive query tree algorithm based on Hamming weight grouping

作　　者：侯培国[1] 张小贺 田昊玮 HOU Pei-guo;ZHANG Xiao-he;TIAN Hao-wei(School of Electrical Engineering,Yanshan University,Qinhuangdao 066004,China)

机构地区：[1]燕山大学电气工程学院,河北秦皇岛066004

出　　处：《计算机工程与设计》2023年第1期307-313,共7页Computer Engineering and Design

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

摘　　要：为克服无线射频识别系统在识别标签时存在空闲时隙多、系统效率低的问题,提出一种基于汉明权重分组的自适应查询树算法。引入基于汉明权重分组的方法优化空闲时隙,根据标签的碰撞位特征自适应选择不同的查询机制,实现对标签前缀的准确预测。仿真结果表明,与查询树的改进算法PACT、BAT和CF-AMTS相比,该算法能够减少查询过程中产生的空闲时隙,降低消耗的总时隙数,提高系统的吞吐量,适合在大规模标签的RFID系统中应用。An adaptive query tree algorithm based on Hamming weight grouping was proposed to overcome the problems of many idle time slots and low system efficiency in RFID system.A Hamming weight grouping method was introduced to optimize the idle time slot,and different query mechanisms were adaptively selected according to the collision bit characteristics of labels,to achieve accurate prediction of label prefixes.Simulation results show that compared with PACT,BAT and CF-AMTS improved query tree algorithms,the proposed algorithm can reduce the idle time slots generated in the query process,thus reducing the total number of time slots consumed and improving the throughput of the system,which is suitable for large-scale RFID systems.

关 键 词：无线射频 防碰撞算法 查询树 自适应 汉明权重 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]