| 无源射频识别系统中前缀分段匹配ニ进制防碰撞算法 |
| |
| 引用本文： | 王新锋,谢桂海,杨会民,李浩.无源射频识别系统中前缀分段匹配ニ进制防碰撞算法[J].兵工学报,2009,30(3):313-318. |
| |
| 作者姓名： | 王新锋 谢桂海 杨会民 李浩 |
| |
| 作者单位： | 1．军械工程学院计算机工程系，河北石家庄050003；2.63880部队，河南洛阳471003 |
| |
| 摘 要： | 射频识别(RFID)防碰撞算法中，识别速度、标签平均响应次数和可靠性是衡量算法性能的重要指标。QT( Query Tree)算法以适用于低成本标签而闻名，针对QT算法识别速度慢、标签平均响应次数多的缺点，提出前缀分段匹配二进制算法：针对标签ID由几个不同含义区间段组成的特点，读写器利用历史识别的标签ID组成一个前缀库；在识别未知标签的ID时不断进行匹配，并尝试着用前缀库中存储的前缀作为标签ID的前缀。仿真实验证明，在假设某个特定读写器识别标签ID的类别有限的情况下，前缀分段匹配二进制防碰撞算法畿够将QT算法的识别速度提高约3倍、标签响应次数降低为1／4左右、系统传输通路平均吞吐率约提高3倍。
|
| 关 键 词： | 信息处理技术 射频识别 防碰撞 二叉树 前缀分段匹配 |
Prefix Matching Binary Anti-collision Algorithm in Passive Radio Frequency Identification System |
| |
| WANG Xin-feng,XIE Gui-hai,YANG Hui-min,LI Hao.Prefix Matching Binary Anti-collision Algorithm in Passive Radio Frequency Identification System[J].Acta Armamentarii,2009,30(3):313-318. |
| |
| Authors: | WANG Xin-feng XIE Gui-hai YANG Hui-min LI Hao |
| |
| Affiliation: | l. Computer Engineering Department, Ordnance Engineering College, Shijiazhuang 050003, Hebei, China;
2. Unit 63880, PLA, Luoyang 471003, Henan, China |
| |
| Abstract: | Identifying speed,average tag response times and reliability are important indexes of weighing performance of the anti-collision algorithm in passive radio frequency identification(RFID) system.A Query Tree(QT) algorithm is a famous algorithm for lowest-cost RFID tags,but its shortcoming is low identifying speed and high average tag response times.A prefix matching binary algorithm based on the QT algorithm was proposed.It is the idea of the new algorithm that based on characteristic of tag ID composed by s... |
| |
| Keywords: | information processing technique radio frequency identification anti-collision binary tree prefix matching |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《兵工学报》浏览原始摘要信息 |
|
点击此处可从《兵工学报》下载全文 |
