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

2 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 publicationComputational Intelligence and Security - International Conference, CIS 2006, Revised Selected Papers
PublisherSpringer Verlag
Pages733-742
Number of pages10
ISBN (Print)9783540743767
DOIs
StatePublished - 2007
EventInternational Conference on Computational Intelligence and Security, CIS 2006 - Guangzhou, China
Duration: 3 Nov 20066 Nov 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4456 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on Computational Intelligence and Security, CIS 2006
Country/TerritoryChina
CityGuangzhou
Period3/11/066/11/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