数字技术与应用Issue(9)：103-105,107,4.
一种改进的混合查询树防碰撞算法研究与仿真
摘要
Abstract
Based on the Hybrid Query tree algorithm, this enhanced algorithm, utilizing the combined information of the highest and the lowest bit of colision, categorizes the tags. And the tags are put in four matrixes respectively to react to reduce colision. The analysis of function shows that this proposed algorithm is superior to QT and HQT by decreasing the number of query and the frequency of system communication. Hence, the efficiency of tag identification is greatly enhanced.关键词
混合查询树算法/最高碰撞位/最低碰撞位/防碰撞算法Key words
Hybrid Query Tree Algorithm/Highest Bit Of Colision/Lowest Bit Of Colision/Anti-Colision Algorithm分类
信息技术与安全科学引用本文复制引用
邓红卫,许航,廖瑾芸,彭丽蓉..一种改进的混合查询树防碰撞算法研究与仿真[J].数字技术与应用,2015,(9):103-105,107,4.基金项目
湖南省科技计划项目(NO:2013SK3178)、衡阳市科技计划项目(NO:2013KS70)、湖南省大学生研究性学习和创新性实验计划项目(NO:201510546007) （NO:2013SK3178）
