FTTP: A fast tree traversal protocol for efficient tag identification in RFID networks

Jihoon Choi, Inkyu Lee, Ding Zhu Du, Wonjun Lee

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)


This letter presents an efficient tag collision arbitration protocol, viz., the Fast Tree Traversal Protocol (FTTP). It estimates the number of tags using maximum likelihood estimation and adjusts the splitting factor to reduce the identification delay. We show that our protocol effectively reduces the identification delay via the performance analysis and simulation results.

Original languageEnglish
Article number5545645
Pages (from-to)713-715
Number of pages3
JournalIEEE Communications Letters
Issue number8
Publication statusPublished - 2010 Aug

Bibliographical note

Funding Information:
Manuscript received April 4, 2010. The associate editor coordinating the review of this letter and approving it for publication was C.-F. Chiasserini. This research was jointly supported by MEST, Korea, under WCU (R33-2008-000-10044-0), a KOSEF Grant funded by the Korean Government (MEST) (No. R01-2007-000-11203-0), a KRF Grant (KRF-2008-314-D00354), and MKE, Korea under ITRC NIPA-2010-(C1090-1021-0008). W. Lee (corresponding author) and J. Choi are with the Dept. of Computer Science and Engineering, Korea University, Seoul, Korea (e-mail: wlee@korea.ac.kr). I. Lee is with the School of Electrical Engineering, Korea University, Seoul, Korea. D.-Z. Du is with the Dept. of Computer Science, University of Texas at Dallas, Richardson, TX, USA. Digital Object Identifier 10.1109/LCOMM.2010.08.100539


  • RFID
  • RFID tag anti-collision
  • collision arbitration

ASJC Scopus subject areas

  • Modelling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering


Dive into the research topics of 'FTTP: A fast tree traversal protocol for efficient tag identification in RFID networks'. Together they form a unique fingerprint.

Cite this