The Research of RFID Anti-Collision Algorithm Based on the Frame Slots of Multi-branched Tree

DOI

10.2991/icmmita-15.2015.94How to use a DOI?

Keywords

RFID;Frame Slots;Multi-branched Tree;The Prefix of Packet.

Abstract

This paper proposed a new RFID anti-collision algorithm on the basis of the frame slots of Multi-branched Tree.This new algorithm used for multi-grouped lies in the label prefix discrimination,which greatly prevents the situation that the frame length is not enough and reduces the transmission of bits effectively.Simultaneously, this algorithm reduces the Reader's search range and the probability of collisions. In the performance of decreasing the collisions slots, reducing the search depth and system delay and improving the system throughput, especially in the case of the presence of large number of tags, the new algorithm is superior to the traditional method.Numerical simulations demonstrate the efficiency of theoretical results.

Copyright

© 2015, 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  - Huai Wen
AU  - Pengcheng Wei
AU  - Li Li
AU  - Lie Lei
AU  - Weihong Wu
PY  - 2015/11
DA  - 2015/11
TI  - The Research of RFID Anti-Collision Algorithm Based on the Frame Slots of Multi-branched Tree
BT  - Proceedings of the 2015 3rd International Conference on Machinery, Materials and Information Technology Applications
PB  - Atlantis Press
SP  - 479
EP  - 484
SN  - 2352-538X
UR  - https://doi.org/10.2991/icmmita-15.2015.94
DO  - 10.2991/icmmita-15.2015.94
ID  - Wen2015/11
ER  -