A bit-locking binary tree algorithm based on odd-even zone

DOI

10.2991/icmii-15.2015.76How to use a DOI?

Keywords

radio frequency identification; odd-even zone; bit-locking; anti-collision; binary tree.

Abstract

Along with the constant development and maturity of internet of things (IoT), radio frequency identification (RFID) technology has been widely used, anti-collision technology is the core of the RFID technology.This paper presents a new tree based anti-collision algorithm for RFID. The proposed algorithm combines odd-even zone with bit-locking back off anti-collision algorithm. The dividing odd-even zone improves the efficiency of searching, because the number of rounds between reader and tags is reduced, while the bit-locking back off anti-collision algorithm reduces transmission delay, beacause the number of transmitted bits decreases. Both theoretical and simulation results show the effectiveness and superiority of the algorithm.

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  - Hongbin Tang
AU  - Shangbo Zhou
AU  - Karim Awudu
PY  - 2015/10
DA  - 2015/10
TI  - A bit-locking binary tree algorithm based on odd-even zone
BT  - Proceedings of the 3rd International Conference on Mechatronics and Industrial Informatics
PB  - Atlantis Press
SP  - 437
EP  - 443
SN  - 2352-538X
UR  - https://doi.org/10.2991/icmii-15.2015.76
DO  - 10.2991/icmii-15.2015.76
ID  - Tang2015/10
ER  -