科研之友
微信
新浪微博
Facebook
分享链接
摘要
Deterministic tree-based algorithms are mostly used to guarantee that all the tags in the reader field are successfully identified, and to achieve the best performance. Through an analysis of the deficiencies of existing tree-based algorithms, a Q-ary search algorithm was proposed. The Q-ary search (QAS) algorithm introduced a bit encoding mechanism of tag ID by which the multi-bit collision arbitration was implemented. According to the encoding mechanism, the collision cycle was reduced. The theoretical analysis and simulation results showed that the proposed MS algorithm overcame the shortcoming of existing tree-based algorithms and exhibited good performance during identification.
