摘要
本算法在混合查询树算法的基础上,利用最高碰撞位和最低碰撞位的组合信息,对标签进行分组。根据标签最高、最低碰撞位的组合信息,将标签放入四个矩阵中分别进行响应,减少标签碰撞。性能分析结果表明,该算法优于QT、HQT算法,减少了查询次数和系统通信量,标签识别效率明显提高。
Based on the Hybrid Query tree algorithm, this enhanced algorithm, utilizing the combined information of the highest and the lowest bit of collision, categorizes the tags. And the tags are put in four matrixes respectively to react to reduce collision. 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.
出处
《数字技术与应用》
2015年第9期103-105,107,共4页
Digital Technology & Application
基金
湖南省科技计划项目(NO:2013SK3178)
衡阳市科技计划项目(NO:2013KS70)
湖南省大学生研究性学习和创新性实验计划项目(NO:201510546007)
关键词
混合查询树算法
最高碰撞位
最低碰撞位
防碰撞算法
Hybrid Query Tree Algorithm
Highest Bit Of Collision
Lowest Bit Of CoUision
Anti-Collision Algorithm
