A RFID Anti-collision Algorithm based on Q-ary Search

DOI

10.2991/jiaet-18.2018.70How to use a DOI?

Keywords

RFID; Anti-collision; Multiple tags identification; QAS

Abstract

Multiple tags collision problem severely degrade the identification efficiency of an RFID system. As a mainstream RFID anti-collision algorithm, deterministic tree-based algorithm can guarantee that the reader correctly identify the tags within its coverage range. In order to overcome the shortcomings of the existing tree-based algorithms, a Q-ary search (QAS) algorithm with tag ID bit encoding mechanism is proposed. The QAS algorithm introduced bit encoding mechanism of tags’ ID by which the multi-bit collision arbitration can be implemented by the reader. Benefiting from the encoding mechanism, the collision slots is reduced, and the identification efficiency is improved. The theoretical analysis and simulation results show that the QAS algorithm reduces the time complexity and communication overhead during the identification process and achieves the good performance compare to the references methods.

Copyright

© 2018, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Xinyan Wang
AU  - Lijun Mao
PY  - 2018/03
DA  - 2018/03
TI  - A RFID Anti-collision Algorithm based on Q-ary Search
BT  - Proceedings of the 2018 Joint International Advanced Engineering and Technology Research Conference (JIAET 2018)
PB  - Atlantis Press
SP  - 395
EP  - 400
SN  - 2352-5401
UR  - https://doi.org/10.2991/jiaet-18.2018.70
DO  - 10.2991/jiaet-18.2018.70
ID  - Wang2018/03
ER  -