A New RFID Anti-collision Algorithm Based on the Q-Ary Search Scheme

作     者：SU Jian WEN Guangjun HONG Danfeng 

作者机构：School of Communication and Information Engineering University of Electronic Science and Technology of China College of Information Engineering Qingdao University 

出 版 物：《Chinese Journal of Electronics》 (电子学报(英文))

年 卷 期：2015年第24卷第4期

页      面：679-683页

核心收录：

学科分类：13[艺术学] 0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 1305[艺术学-设计学（可授艺术学、工学学位）] 081203[工学-计算机应用技术] 081104[工学-模式识别与智能系统] 0804[工学-仪器科学与技术] 0835[工学-软件工程] 081101[工学-控制理论与控制工程] 0701[理学-数学] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported by the National Natural Science Foundation of China(No.61371047) Research Fund for the Doctoral Program of Higher Education of China(No.20110185110014) 

主　　题：Radio frequency identification(RFID) Anti-collision Encoding Energy efficiency 

摘      要：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 multibit 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.