.png){kind=icon}
返回
Idle-Slots Elimination Based Binary Splitting Anti-Collision Algorithm for RFID
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2016.2592964.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Tag collision avoidance is critical to the success of data communications in radio frequency identification (RFID) system. This letter presents an efficient idle-slots elimination based binary splitting (ISE-BS) algorithm to improve the performance of the RFID system. In ISE-BS, by introducing 1-b random number Q and 16-b random number serial identifier, which are transmitted before data exchange, tag collisions can be informed and unnecessary data exchange between reader and tags can be further eliminated. Moreover, ISE-BS exploits Q to separate conflicting tags into 0-1 subsets randomly. Specifically, the tags in subset 0 will start to transmit in the next period, where the success flag signal reflects the immediate data transmission. The tags in subset 1 will wait in the pipeline. In such a way, the idle slots introduced by conventional binary splitting anti-collision algorithms can be removed with the schedule of ISE-BS. Extensive simulation results show that ISE-BS outperforms the existing proposed algorithms.
Keyword:
RFID
anti-collision
BS
time efficiency
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
.png){kind=icon}
分享收藏 没有更多内容
没有更多内容