Efficient memoryless protocol for tag identification (extended abstract)
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
An RFID anti-collision algorithm with dynamic condensation and ordering binary tree
Computer Communications
Hi-index | 0.00 |
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.