返回
A Time Efficient Tag Identification Algorithm Using Dual Prefix Probe Scheme (DPPS)
DOI:10.1109/LSP.2016.2516768.png)
摘要
En 中文
Tag collision severely affects the performance of radio-frequency identification (RFID) systems. Most anti-collision algorithms focus on preventing or reducing collisions but waste lots of idle slots. In this letter, we propose a time efficient anti-collision algorithm based on a query tree scheme. Specifically, the dual prefixes matching method is implemented based on the traditional query tree identification model when the reader detects the consecutive collision bits, which can significantly remove idle slots. Moreover, the proposed method can also make extensive use of collision slots to improve the identification efficiency. Both theoretical and simulation results indicate that the proposed algorithm can achieve better performance than existing tree-based algorithms.
Keyword:
Anti-collision
identification efficiency
RFID
tree-based
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
引用论文
An Adaptive Tag Anti-Collision Protocol in RFID Wireless SystemsRFID无线系统中一种自适应标签防碰撞协议
CHINA COMMUNICATIONS
IF3.1
Chloroplast DNA evidence for the evolution of Microseris (Asteraceae) in Australia and New Zealand after long‐distance dispersal from western North America叶绿体DNA证据表明,Microseris(Asteraceae)在澳大利亚和新西兰的演化是在从北美西部进行长距离传播之后发生的。
Managing the Number of Tag Bits Transmitted in a Bit-Tracking RFID Collision Resolution Protocol
SENSORS
IF3.5
Stability Analysis of an Efficient Anti-Collision Protocol for RFID Tag Identification一种高效的RFID标签识别防碰撞协议的稳定性分析
没有更多内容

