Four-ary query tree splitting with parallel responses for RFID tag anti-collision

Ming Kuei Yeh, Jehn Ruey Jiang, Shing Tsaan Huang

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

In a radio frequency identification (RFID) system, tags can be identified by a reader when they are within the interrogation zone of the reader. Collisions occur when tags using backscatter technology report their IDs to the reader at the same carrier frequency simultaneously. The performance of tag identification is degraded by collisions, so it is important to address the tag collision problem. Several anti-collision protocols have been proposed for reducing tag collisions. They can be categorised into two classes: ALOHA-based and tree-based protocols. This paper proposes a 4-ary query tree-based anti-collision protocol, namely the parallel response query tree (PRQT) protocol, to improve the performance of tag identification. In the PRQT protocol, the tags with the ID prefix matching either the reader's request bit string or the complementary of the string are arranged to respond in two subcarriers in parallel. The PRQT protocol is analysed, simulated and compared with related ones to demonstrate its advantages.

Original languageEnglish
Pages (from-to)193-205
Number of pages13
JournalInternational Journal of Ad Hoc and Ubiquitous Computing
Volume16
Issue number3
DOIs
StatePublished - 2014

Keywords

  • Anti-collision
  • Query tree
  • Radio frequency identification
  • RFID
  • Tag identification

Fingerprint

Dive into the research topics of 'Four-ary query tree splitting with parallel responses for RFID tag anti-collision'. Together they form a unique fingerprint.

Cite this