Improved bit-by-bit binary tree algorithm in ubiquitous ID system

Authors:
Ho-Seung Choi;Jae-Ryong Cha;Jae-Hyun Kim
Affiliations:
School of Electrical and Computer Engineering, AJOU University, Suwon, Korea;School of Electrical and Computer Engineering, AJOU University, Suwon, Korea;School of Electrical and Computer Engineering, AJOU University, Suwon, Korea
Venue:
PCM'04 Proceedings of the 5th Pacific Rim Conference on Advances in Multimedia Information Processing - Volume Part II
Year:
2004

Citing 1
Cited 3

Efficient Object Identification with Passive RFID Tags

Pervasive '02 Proceedings of the First International Conference on Pervasive Computing

Anticipative Wrap-Around Inquiry Method towards Efficient RFID Tag Identification

UIC '09 Proceedings of the 6th International Conference on Ubiquitous Intelligence and Computing
Threshold jumping and wrap-around scan techniques toward efficient tag identification in high density RFID systems

Information Systems Frontiers
A novel tag identification algorithm for RFID system using UHF

EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose and analyze the fast wireless anti-collision algorithm(Improved Bit-by-bit Binary-Tree algorithm(IBBT)) in Ubiquitous ID system. We mathematically compare the performance of the proposed algorithm with that of Binary Search algorithm(BS), Slotted Binary-Tree algorithm(SBT) using time slot, and Bit-by-bit Binary-Tree algorithm(BBT). We also validated analytic results using simulation. According to the analytical result, comparing IBBT with BBT which is the best of existing algorithms, the performance of IBBT is about 304% higher when the number of the tags is 20, and 839% higher for 200 tags.