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

Younghwan Jung; Daehee Kim; Sun-Shin An

doi:10.1587/transfun.E99.A.1494

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 journal › Article › peer-review

3 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 language	English
Pages (from-to)	1494-1498
Number of pages	5
Journal	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Volume	E99A
Issue number	7
DOIs	https://doi.org/10.1587/transfun.E99.A.1494
Publication status	Published - 2016 Jul 1

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

Access to Document

10.1587/transfun.E99.A.1494

Cite this

Optimized binary search with multiple collision bits resolution anti-collision algorithm for efficient RFID tag identification. / Jung, Younghwan; Kim, Daehee; An, Sun-Shin.
In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E99A, No. 7, 01.07.2016, p. 1494-1498.

Research output: Contribution to journal › Article › peer-review

@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 = jul,

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 - https://www.scopus.com/pages/publications/84976875225

UR - https://www.scopus.com/pages/publications/84976875225#tab=citedBy

U2 - 10.1587/transfun.E99.A.1494

DO - 10.1587/transfun.E99.A.1494

M3 - Article

AN - SCOPUS:84976875225

SN - 0916-8508

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

IS - 7

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this