| 高效的RFID混合询问树防碰撞算法 |
| |
| 引用本文： | 孙文胜,陈安辉.高效的RFID混合询问树防碰撞算法[J].计算机应用研究,2011,28(10):3717-3179. |
| |
| 作者姓名： | 孙文胜 陈安辉 |
| |
| 作者单位： | 杭州电子科技大学通信工程学院,杭州,310018 |
| |
| 摘 要： | 在RFID系统中，一种有效的标签防碰撞算法是实现标签快速识别的重要方法。提出了一种高效的混合询问树算法来实现标签快速有效的识别。该算法在QT的基础上，结合时隙补偿机制，利用三位连续比特位中“1”的个数来确定标签的传输时隙，并结合动态二进制算法来减小传输时延。仿真表明，对于随机产生的标签与顺序产生的标签，该算法的识别效率分别提高了44.8%与84.7%。
|
| 关 键 词： | 防碰撞 询问树 混合询问树 标签识别 |
Efficient hybrid query tree anti collision algorithm in RFID system |
| |
| SUN Wen sheng,CHEN An hui.Efficient hybrid query tree anti collision algorithm in RFID system[J].Application Research of Computers,2011,28(10):3717-3179. |
| |
| Authors: | SUN Wen sheng CHEN An hui |
| |
| Affiliation: | (School of Communication Engineering, Hangzhou Dianzi University, Hangzhou 310018, China) |
| |
| Abstract: | An effective tag anti-collision algorithm is an important way for tag fast identification in RFID system.This paper presented an efficient hybrid query tree algorithm to achieve rapid and effective identification tags.The algorithm was based on the QT,combined with a slotted backoff mechanism,using the number of value 1 of the three consecutive bits to determine the transmission time slots of tags,and combined with the dynamic binary algorithm,reducing the transmission delay.Through simulation,this algorith... |
| |
| Keywords: | anti-collision query tree(QT) hybrid query tree(HQT) tag identification |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
|
