Collision-resilient multi-state query tree protocol for fast RFID tag identification

Jae Min Seol, Seong Whan Kim

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

11 Scopus citations

Abstract

RFID (radio frequency identification) is a RF based identification system, where RF reader reads (and writes) data from each entity (RF tag). Upon request from reader, tags in reader's accessible RF range will respond, and if the number of tags is larger than 2, the reader cannot identify tags (collision). To avoid the collision, there are two previous approaches: ALOHA based and binary tree algorithm. However, they are essentially collision avoidance algorithms, and require much overhead in retransmission time. In this paper, we present collision recovery scheme for RFID system. It uses 20 symbols, and each symbol is 16-bit vectors derived from (16, 4, 1)-BIBD (balanced Incomplete Block design) which is resilient to collision. Although our scheme can decrease the total number of support users, it shows good performance even with low SNR region.

Original languageEnglish
Title of host publication2006 International Conference on Computational Intelligence and Security, ICCIAS 2006
PublisherIEEE Computer Society
Pages1159-1162
Number of pages4
ISBN (Print)1424406056, 9781424406050
DOIs
StatePublished - 2006
Event2006 International Conference on Computational Intelligence and Security, ICCIAS 2006 - Guangzhou, China
Duration: 3 Oct 20066 Oct 2006

Publication series

Name2006 International Conference on Computational Intelligence and Security, ICCIAS 2006
Volume2

Conference

Conference2006 International Conference on Computational Intelligence and Security, ICCIAS 2006
Country/TerritoryChina
CityGuangzhou
Period3/10/066/10/06

Fingerprint

Dive into the research topics of 'Collision-resilient multi-state query tree protocol for fast RFID tag identification'. Together they form a unique fingerprint.

Cite this