| RFID二进制树型折半搜索防碰撞算法 |
| |
| 引用本文： | 廖剑锋,刘宇航. RFID二进制树型折半搜索防碰撞算法[J]. 计算机系统应用, 2013, 22(11): 159-164 |
| |
| 作者姓名： | 廖剑锋 刘宇航 |
| |
| 作者单位： | 华中科技大学 文华学院, 武汉 430074;华中科技大学 文华学院, 武汉 430074 |
| |
| 基金项目： | 华中科技大学文华学院培育基金(2013py04) |
| |
| 摘 要： | 为提高RFID系统中多标签读取的工作效率，分析了二进制树型搜索防碰撞算法，提出一种改进型的二进制树型折半搜索算法．通过构建哈夫曼树，使用自定义编码，采用堆栈操作确定碰撞位，用折半查找方式减少重复路径访问量，并最终确定最短路径长度．数据分析及实验结果表明，二进制树型折半搜索防碰撞算法可以明显降低搜索深度，显著提高RFID多标签读取的工作效率。
|
| 关 键 词： | 射频识别 防碰撞 二进制树 路径长度 堆栈 折半搜索 |
| 收稿时间： | 2013-04-22 |
| 修稿时间： | 2013-05-27 |
RFID Anti-Collision Algorithm Based on Binary Tree Half Search |
| |
| LIAO Jian-Feng and LIU Yu-Hang. RFID Anti-Collision Algorithm Based on Binary Tree Half Search[J]. Computer Systems& Applications, 2013, 22(11): 159-164 |
| |
| Authors: | LIAO Jian-Feng and LIU Yu-Hang |
| |
| Affiliation: | School of Wenhua, Huazhong University of Science & Technology, Wuhan 430074, China;School of Wenhua, Huazhong University of Science & Technology, Wuhan 430074, China |
| |
| Abstract: | Aiming at improving multiple tags reading efficiency in RFID, it analyses the binary search anti-collision algorithm, and puts forward an improved binary tree half search algorithm. By constructing a Huffman tree, using a custom code, using the stack operation to determine the collision bit, with a half search method to reduce duplication of path, ultimately determines the shortest path length. Data analysis and experimental results show that, the binary tree half search anti-collision algorithm can significantly reduce the search depth, and improve the work efficiency of RFID tag reading. |
| |
| Keywords: | RFID anti-collision binary tree path length stack half search |
| 本文献已被 维普 等数据库收录！ |
| 点击此处可从《计算机系统应用》浏览原始摘要信息 |
|
点击此处可从《计算机系统应用》下载全文 |
|
