摘要
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.
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.
基金
Supported by the National Natural Science Foundation of China(No.61401407)
