| Jin Xiaofang (靳晓芳),Liu Mengxuan,Shao Min,Jin Libiao,Huang Xianglin.[J].高技术通讯(英文),2016,22(1):107~112 |
|
| Research on the adaptive hybrid search tree anti-collision algorithm in RFID system |
| |
| DOI：10.3772/j.issn.1006-6748.2016.01.015 |
| 中文关键词: |
| 英文关键词: anti-collision, adaptive binary-tree disassembly（ABD）, hybrid search tree, discrimination |
| 基金项目: |
| Author Name | Affiliation | | Jin Xiaofang (靳晓芳) | | | Liu Mengxuan | | | Shao Min | | | Jin Libiao | | | Huang Xianglin | |
|
| Hits: 994 |
| Download times: 943 |
| 中文摘要: |
| |
| 英文摘要: |
| Due to more tag-collisions result in failed transmissions, tag anti-collision is a very vital issue in the radio frequency identification (RFID) system. However, so far decreases in communication time and increases in throughput are very limited. In order to solve these problems, this paper presents a novel tag anti-collision scheme, namely adaptive hybrid search tree (AHST), by combining two algorithms of the adaptive binary-tree disassembly (ABD) and the combination query tree (CQT), in which ABD has superior tag identification velocity and CQT has optimum performance in system throughput and search timeslots. From the theoretical analysis and numerical simulations, the proposed algorithm can colligate the advantages of above algorithms, improve the system throughput and reduce the searching timeslots dramatically. |
|
View Full Text
View/Add Comment Download reader |
| Close |
|
|
|
