A collision resolution algorithm for RFID using modified dynamic tree with Bayesian tag estimation
- Publication Type:
- Journal Article
- IEEE Communications Letters, 2018, 22 (11), pp. 2238 - 2241
- Issue Date:
Files in This Item:
|08438533 A Collision Resolution Algorithm for RFID using Modified.pdf||Published Version||445.22 kB|
Copyright Clearance Process
- Recently Added
- In Progress
- Open Access
This item is currently unavailable due to the publisher's embargo.
The embargo period expires on 1 Sep 2020
© 1997-2012 IEEE. A new tree-based anti-collision protocol for radio-frequency identification systems is proposed to achieve a very high tag identification efficiency. The proposed algorithm works in two phases. In the first phase, the number of competing tags is estimated through the proposed Bayesian estimation technique, while in the second phase, tags are identified using our modified dynamic tree algorithm. The system efficiency is mathematically derived and verified through simulation. Numerical results show that the proposed algorithm achieves a tag identification system efficiency of 45% and a time system efficiency of 78.5%, thus outperforming any existing collision resolution algorithms.
Please use this identifier to cite or link to this item: