计算机技术与发展Issue(2)：86-89,4.DOI:10.3969/j.issn.1673-629X.2015.02.020
一种改进的查询树RFID标签防碰撞算法
An Improved Query Tree Anti-collision Algorithm in RFID Systems
摘要
Abstract
RFID is a non-contactless automatic identification technology. With the large-scale application of RFID,tag collision problems affect the performance of RFID systems seriously,and the anti-collision algorithm is the key to solve the problem. Based on the binary-tree search algorithm which requires more times to indentify all tags,an Hybrid Query Tree ( HQT) anti-collision algorithm for RFID system is presented in this paper. The algorithm combines the advantages of binary query tree with 4-ary query tree,according to the in-formation return from label to choose different query mechanism between binary query tree and 4-ary query tree dynamically. So it can quickly identify all tags by reducing the number of query-responses,and improves the efficiency of the identification. The simulation re-sults show that throughput of the algorithm is increased to 59%. Moreover. This algorithm can improve the overall performance of the system,especially when the number of labels is large,the bit of tag ID is long.关键词
射频识别技术/防碰撞算法/混合/吞吐率/查询树Key words
RFID/anti-collision algorithm/hybrid/throughput/query tree分类
信息技术与安全科学引用本文复制引用
姜武,杨恒新,张昀..一种改进的查询树RFID标签防碰撞算法[J].计算机技术与发展,2015,(2):86-89,4.基金项目
国家自然科学基金资助项目(61302155) （61302155）
