| 改进的树型结构RFID防碰撞算法 |
| |
| 引用本文： | 王 雪,钱志鸿,刘晓慧,程 超.改进的树型结构RFID防碰撞算法[J].通信学报,2015,36(7):129-137. |
| |
| 作者姓名： | 王 雪 钱志鸿 刘晓慧 程 超 |
| |
| 作者单位： | 吉林大学 通信工程学院，吉林 长春 130012 |
| |
| 基金项目： | 国家自然科学基金资助项目（61371092, 61401175）；教育部高等学校博士学科专项科研基金资助项目（20130061120062）；中国博士后科学基金资助项目（2014M551184） |
| |
| 摘 要： | 将整棵大查询树分为若干分支，在每一个分支内进行标签识别，减少碰撞发生的概率。算法分为前缀确定和分支查询2个阶段，在前缀确定阶段读取所有标签前缀，每个前缀代表一个分支，依次遍历每一分支；查询过程采用后退式搜索策略和动态搜索方式。理论分析和仿真实验表明，算法能够从查询次数、时延、吞吐率多方面改善RFID系统的整体性能。
|
| 关 键 词： | RFID 防碰撞 树型结构 前缀查询 后退式搜索 |
| 收稿时间： | 2014/8/8 0:00:00 |
Improved tree structure anti-collision algorithm of RFID |
| |
| Xue WANG,Zhi-hong QIAN,Xiao-hui LIU,Chao CHENG.Improved tree structure anti-collision algorithm of RFID[J].Journal on Communications,2015,36(7):129-137. |
| |
| Authors: | Xue WANG Zhi-hong QIAN Xiao-hui LIU Chao CHENG |
| |
| Affiliation: | School of Communication Engineering,University of Jilin,Changchun 130012,China |
| |
| Abstract: | The whole big query tree is divided into several branches, and the work of tag recognition is executed in each branch, thus reducing the probability of tag collision. The proposed algorithm can be divided into prefix determination and branch query two phases. In the prefix determination phase, the prefix of every tag is identified, and each prefix denotes a branch. Traverse each branch by turns to recognize tags; in the branch query phase, backward search strategy and dynamic search method are used. Theoretical analysis and simulation experiment show that when the improved algorithm can improved the overall performance of RFID system from the aspects of the number of queries, time delay, and throughput. |
| |
| Keywords: | RFID anti-collision tree structure prefix query backward search |
|
| 点击此处可从《通信学报》浏览原始摘要信息 |
|
点击此处可从《通信学报》下载全文 |
|
