Research on the adaptive hybrid search tree anti-collision algorithm in RFID system |
| |
Affiliation: | Information Engineering, Communication University of China, Beijing 100024, P.R.China |
| |
Abstract: | 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 al-gorithms 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 pro-posed algorithm can colligate the advantages of above algorithms, improve the system throughput and reduce the searching timeslots dramatically. |
| |
Keywords: | anti-collision adaptive binary-tree disassembly(ABD) hybrid search tree dis-crimination |
本文献已被 CNKI 万方数据 等数据库收录! |
|