.png){kind=icon}
返回
A Collision Resolution Algorithm for RFID Using Modified Dynamic Tree With Bayesian Tag Estimation
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2018.2865735.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Bayesian estimation
collisionresolution
tag
tree
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容