| 史露强,何怡刚,罗旗舞,李兵,邓芳明.改进的混合查寻树RFID防碰撞算法[J].电子测量与仪器学报,2017,31(8):1281-1288 |
| 改进的混合查寻树RFID防碰撞算法 |
| Improved hybrid query tree anti collision algorithm of RFID |
| |
| DOI：10.13382/j.jemi.2017.08.017 |
| 中文关键词: 无线射频识别 防碰撞算法 查寻树 分支预测 |
| 英文关键词:RFID anti collision algorithm query tree branch prediction |
| 基金项目:国家自然科学基金（51577046）、国家自然科学基金重点项目（51637004）、国家重点研发计划“重大科学仪器设备开发”项目（2016YFF0102200）、安徽省科技计划重点项目（1301022036）、江西省科技支撑项目 (20161BBE50076）、合肥工业大学博士专项科研基金（JZ2016HGBZ1030）资助项目 |
|
|
| Author | Institution |
| Shi Luqiang | School of Electrical Engineering and Automation, Hefei University of Technology, Hefei 230009，China |
| He Yigang | School of Electrical Engineering and Automation, Hefei University of Technology, Hefei 230009，China |
| Luo Qiwu | School of Electrical Engineering and Automation, Hefei University of Technology, Hefei 230009，China |
| Li Bing | School of Electrical Engineering and Automation, Hefei University of Technology, Hefei 230009，China |
| Deng Fangming | 1. School of Electrical Engineering and Automation, Hefei University of Technology, Hefei 230009，China;
2. School of Electrical and Automation Engineering, East China Jiaotong University, Nanchang 330013, China |
|
| 摘要点击次数: 3300 |
| 全文下载次数: 15043 |
| 中文摘要: |
| 无线射频识别（RFID）系统采用的防碰撞算法直接决定了系统的工作效率。在查寻树（QT）算法的基础上提出了一种改进的混合查询树（IHQT）标签防碰撞算法。标签产生碰撞时，碰撞节点会裂分为多个子节点。为了避免空闲时隙的产生，IHQT算法在阅读器查询碰撞标签之前增加一个分支预测阶段，提出的分支预测方法可以准确地预测查询树中空闲时隙的位置，阅读器产生新的查询前缀时，不产生访问空闲时隙的查询前缀，从而完全避免了空闲时隙的产生。算法的性能分析和仿真结果表明，IHQT算法在阅读器开销少量增加（分支预测位n≤2）甚至明显减少（分支预测位n≥3）的前提下，时隙数、吞吐率有了显著的改进，优于已有的查寻树防碰撞算法。 |
| 英文摘要: |
| The anti collision algorithm determines the operating efficiency of RFID systems. An improved hybrid query tree (IHQT) anti collision algorithm is presented in this paper, which is based on the query tree algorithm. When collision occurs, the collided node will split into some child nodes. IHQT addes a branch prediction stage before the reader query collided tags to avoid the idle slots. The branch prediction method presented in this paper can predict the location of idle slots accurately. When the reader generates new query prefixes, those query prefixes which visit the idle slots will be avoided successfully. The performance analysis of algorithm and simulation results show that under the premise of a small increase even significant decrease in the query times of reader, the number of timeslots and throughput of IHQT algorithm are significantly better than the existing query tree anti collision algorithms. |
| 查看全文 查看/发表评论 下载PDF阅读器 |
