摘要
针对传统树形防碰撞算法存在的查询次数多、响应时间长、通信负载大等不足,提出一种基于多进制查询树(MQT)的防碰撞算法。该算法利用映射表对标签的碰撞数据进行多比特仲裁,解决传统算法单比特仲裁的不足,减少查询周期数,根据标签识别所需的响应时间,建立分析模型,推导出最小平均响应时间的最优多进制树。理论分析和仿真结果表明,与碰撞树算法及其改进算法相比,该算法可明显降低多标签识别过程中的时间复杂度和通信负载。
Focusing on the disadvantages of the traditional tree-based algorithm such as many query cycles,long response time,and large communication overhead,a novel tag anti-collision algorithm called Multi-ary Query Tree（MQT）scheme is proposed.This algorithm uses the mapping table to make the arbitration process feasible for multiple bits,overcomes the drawbacks of traditional single-bit arbitration,and reduces the number of queries.An analytic model is developed for the response time to complete identifying all tags and derive optimal Multi-ary tree for the minimum average response time.Theoretical analysis and simulation results show that MQT outperforms other tree based protocols in terms of time complexity and communication overhead.
出处
《计算机工程》
CAS
CSCD
北大核心
2015年第8期95-99,共5页
Computer Engineering
关键词
射频识别
防碰撞
多进制查询树
碰撞位
标签识别算法
时间复杂度
Radio Frequency Identification（RFID）
anti-collision
Multi-ary Query Tree（MQT）
collision bit
tag identification algorithm
time complexity
作者简介
王心妍（1978-）,女,讲师、硕士,主研方向：射频识别技术,信号处理
杨博,讲师、博士。
