Revisting tag collision problem in RFID systems

Lei Yang, Jinsong Han, Yong Qi, Cheng Wang, Yunhao Liu, Ying Cheng, Xiao Zhong

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

13 Citations (Scopus)

Abstract

In RFID systems, the reader is unable to discriminate concurrently reported IDs of tags from the overlapped signals, and a collision happens. Many algorithms for anticollision are proposed to improve the throughput and reduce the latency for tag identification. Existing anti-collision algorithms mainly employ CRC based collision detection functions for determining whether the collision happens. Generating CRC codes, however, requires complicated computations for both RF tags and readers, and hence incurs non-trivial time consumption, becoming the bottleneck. In this study, we design a Quick Collision Detection (QCD) scheme based on the bitwise complement function plus collision preamble, which significantly reduces the number of gates for computation and facilitates to simplify the IC design of RFID tags. The QCD scheme does not require any modification on upperlevel air protocols, so it can be seamlessly adopted by current anti-collision algorithms. Through comprehensive analysis and simulations, we show that QCD improves the identification efficiency by 40%.
Original languageEnglish
Title of host publicationProceedings - 39th International Conference on Parallel Processing, ICPP 2010
Pages178-187
Number of pages10
DOIs
Publication statusPublished - 6 Dec 2010
Externally publishedYes
Event39th International Conference on Parallel Processing, ICPP 2010 - San Diego, CA, United States
Duration: 13 Sep 201016 Sep 2010

Conference

Conference39th International Conference on Parallel Processing, ICPP 2010
CountryUnited States
CitySan Diego, CA
Period13/09/1016/09/10

Keywords

  • Bitwise complemant
  • Collision detection
  • CRC
  • RFID

ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Hardware and Architecture

Cite this