Optimized Binary Search with Multiple Collision Bits Resolution Anti-Collision Algorithm for Efficient RFID Tag Identification
Summary :
In this paper, we analyze two representative tree-based RFID anti-collision algorithms: the Query Tree protocol and the Binary Search algorithm. Based on the advantages and disadvantages of the two algorithms, we propose and evaluate two optimized anti-collision algorithms: the Optimized Binary Search, which performs better than the Query Tree Protocol with the same tag-side overhead, and the Optimized Binary Search with Multiple Collision Bits Resolution algorithm, which performs the best with an acceptable increase in tag-side processing overhead.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E99-A No.7 pp.1494-1498
- Publication Date
- 2016/07/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E99.A.1494
- Type of Manuscript
- LETTER
- Category
- Communication Theory and Signals
Authors
Younghwan JUNG
Korea University
Daehee KIM
Korea University
Sunshin AN
Korea University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Younghwan JUNG, Daehee KIM, Sunshin AN, "Optimized Binary Search with Multiple Collision Bits Resolution Anti-Collision Algorithm for Efficient RFID Tag Identification" in IEICE TRANSACTIONS on Fundamentals,
vol. E99-A, no. 7, pp. 1494-1498, July 2016, doi: 10.1587/transfun.E99.A.1494.
Abstract: In this paper, we analyze two representative tree-based RFID anti-collision algorithms: the Query Tree protocol and the Binary Search algorithm. Based on the advantages and disadvantages of the two algorithms, we propose and evaluate two optimized anti-collision algorithms: the Optimized Binary Search, which performs better than the Query Tree Protocol with the same tag-side overhead, and the Optimized Binary Search with Multiple Collision Bits Resolution algorithm, which performs the best with an acceptable increase in tag-side processing overhead.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E99.A.1494/_p
Copy
@ARTICLE{e99-a_7_1494,
author={Younghwan JUNG, Daehee KIM, Sunshin AN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Optimized Binary Search with Multiple Collision Bits Resolution Anti-Collision Algorithm for Efficient RFID Tag Identification},
year={2016},
volume={E99-A},
number={7},
pages={1494-1498},
abstract={In this paper, we analyze two representative tree-based RFID anti-collision algorithms: the Query Tree protocol and the Binary Search algorithm. Based on the advantages and disadvantages of the two algorithms, we propose and evaluate two optimized anti-collision algorithms: the Optimized Binary Search, which performs better than the Query Tree Protocol with the same tag-side overhead, and the Optimized Binary Search with Multiple Collision Bits Resolution algorithm, which performs the best with an acceptable increase in tag-side processing overhead.},
keywords={},
doi={10.1587/transfun.E99.A.1494},
ISSN={1745-1337},
month={July},}
Copy
TY - JOUR
TI - Optimized Binary Search with Multiple Collision Bits Resolution Anti-Collision Algorithm for Efficient RFID Tag Identification
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1494
EP - 1498
AU - Younghwan JUNG
AU - Daehee KIM
AU - Sunshin AN
PY - 2016
DO - 10.1587/transfun.E99.A.1494
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E99-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2016
AB - In this paper, we analyze two representative tree-based RFID anti-collision algorithms: the Query Tree protocol and the Binary Search algorithm. Based on the advantages and disadvantages of the two algorithms, we propose and evaluate two optimized anti-collision algorithms: the Optimized Binary Search, which performs better than the Query Tree Protocol with the same tag-side overhead, and the Optimized Binary Search with Multiple Collision Bits Resolution algorithm, which performs the best with an acceptable increase in tag-side processing overhead.
ER -
English
