An Efficient Query Tree protocol for RFID tag anti-collision

Ming Kuei Yeh, Yung Liang Lai, Jehn Ruey Jiang

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

1 Scopus citations

Abstract

Anti-Collision is one of the most important problems of the RFID technology. In this paper, we propose an Efficient Query Tree (EQT) protocol to improve both the Query Tree (QT) protocol and the Collision Tree (CT) protocol. The main idea of the EQT protocol is to reduce as much as possible the timeslots used to transmit bits between the reader and tags, so that the time of tag identification procedure is shortened and the energy consumption is lessened. In the EQT protocol, the timeslots structure, the query and responses between the reader and tags are carefully redesigned to allow tags to transmit fewer bits. We analyze and simulate the EQT protocol and compare it with the QT and the CT protocols. The simulation results show the EQT protocol outperforms the other two protocols in terms of the tag identification time.

Original languageEnglish
Title of host publication2014 20th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2014 - Proceedings
PublisherIEEE Computer Society
Pages926-930
Number of pages5
ISBN (Electronic)9781479976157
DOIs
StatePublished - 2014
Event20th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2014 - Hsinchu, Taiwan
Duration: 16 Dec 201419 Dec 2014

Publication series

NameProceedings of the International Conference on Parallel and Distributed Systems - ICPADS
Volume2015-April
ISSN (Print)1521-9097

Conference

Conference20th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2014
Country/TerritoryTaiwan
CityHsinchu
Period16/12/1419/12/14

Keywords

  • Collision Tree (CT) protocol
  • Query Tree (QT) protocol
  • RFID
  • tag anti-collision

Fingerprint

Dive into the research topics of 'An Efficient Query Tree protocol for RFID tag anti-collision'. Together they form a unique fingerprint.

Cite this