Optimized binary search with multiple collision bits resolution anti-collision algorithm for efficient RFID tag identification

Younghwan Jung, Daehee Kim, Sun-Shin An

Research output: Contribution to journalArticle

2 Citations (Scopus)

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 al-gorithms, 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.

Original languageEnglish
Pages (from-to)1494-1498
Number of pages5
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE99A
Issue number7
DOIs
Publication statusPublished - 2016 Jul 1

Fingerprint

Binary search
Radio Frequency Identification
Radio frequency identification (RFID)
Identification (control systems)
Collision
Query
Search Algorithm
Trees (mathematics)
Evaluate
Processing

Keywords

  • Anti-collision
  • Binary search
  • RFID
  • Tag identification

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics
  • Signal Processing

Cite this

@article{31641461c8a346369255da456f4b98c4,
title = "Optimized binary search with multiple collision bits resolution anti-collision algorithm for efficient RFID tag identification",
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 al-gorithms, 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 = "Anti-collision, Binary search, RFID, Tag identification",
author = "Younghwan Jung and Daehee Kim and Sun-Shin An",
year = "2016",
month = "7",
day = "1",
doi = "10.1587/transfun.E99.A.1494",
language = "English",
volume = "E99A",
pages = "1494--1498",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "7",

}

TY - JOUR

T1 - Optimized binary search with multiple collision bits resolution anti-collision algorithm for efficient RFID tag identification

AU - Jung, Younghwan

AU - Kim, Daehee

AU - An, Sun-Shin

PY - 2016/7/1

Y1 - 2016/7/1

N2 - 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 al-gorithms, 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.

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 al-gorithms, 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.

KW - Anti-collision

KW - Binary search

KW - RFID

KW - Tag identification

UR - http://www.scopus.com/inward/record.url?scp=84976875225&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84976875225&partnerID=8YFLogxK

U2 - 10.1587/transfun.E99.A.1494

DO - 10.1587/transfun.E99.A.1494

M3 - Article

AN - SCOPUS:84976875225

VL - E99A

SP - 1494

EP - 1498

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 7

ER -