Abstract
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 language | English |
|---|---|
| Article number | 5545645 |
| Pages (from-to) | 713-715 |
| Number of pages | 3 |
| Journal | IEEE Communications Letters |
| Volume | 14 |
| Issue number | 8 |
| DOIs | |
| Publication status | Published - 2010 Aug 1 |
Keywords
- RFID
- RFID tag anti-collision
- collision arbitration
ASJC Scopus subject areas
- Modelling and Simulation
- Computer Science Applications
- Electrical and Electronic Engineering
Fingerprint 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
Choi, J., Lee, I., Du, D. Z., & Lee, W. (2010). FTTP: A fast tree traversal protocol for efficient tag identification in RFID networks. IEEE Communications Letters, 14(8), 713-715. [5545645]. https://doi.org/10.1109/LCOMM.2010.08.100539