Open AccessA New RFID Anti‐collision Algorithm Based on the Q‐Ary Search Scheme
Author(s) -
Su Jian,
Wen Guangjun,
Hong Danfeng
Publication year - 2015
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2015.10.003
Subject(s) - computer science , encoding (memory) , tree (set theory) , collision , algorithm , scheme (mathematics) , arbitration , mechanism (biology) , depth first search , search algorithm , artificial intelligence , mathematics , mathematical analysis , philosophy , computer security , epistemology , political science , law
Deterministic tree‐based algorithms are mostly used to guarantee that all the tags in the reader eld are successfully identied, and to achieve the best performance. Through an analysis of the deciencies 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 identication.