An Adaptive Memoryless Protocol for RFID Tag Collision Arbitration
An Adaptive Memoryless Protocol for RFID Tag Collision Arbitration
复制标题
DOI：
10.1109/tmm.2006.879817
复制
发表时间：
2006-10
影响因子：
7.3
通讯作者：
Jihoon Myung;Wonjun Lee;T. Shih
中科院分区：
文献类型：
--
作者：
Jihoon Myung;Wonjun Lee;T. Shih
射频识别（RFID）读取器通过与RFID标签的无线通信来识别物体。由于在共享无线信道上的通信，无源标签的标签冲突仲裁对于快速标签识别是重要的问题。本文提出了一种自适应无记忆协议，它是对查询树协议的改进。无记忆意味着标签不需要有额外的内存，除了用于识别的ID。为了减少碰撞并迅速识别标签，我们使用从阅读器上标签识别的最后过程中获得的信息。我们的性能评估表明，自适应无记忆协议导致更少的冲突，并采取更短的延迟识别所有标签，同时保持较低的通信开销比其他基于树的标签防冲突协议
A radio frequency identification (RFID) reader recognizes objects through wireless communications with RFID tags. Tag collision arbitration for passive tags is a significant issue for fast tag identification due to communication over a shared wireless channel. This paper presents an adaptive memoryless protocol, which is an improvement on the query tree protocol. Memoryless means that tags need not have additional memory except ID for identification. To reduce collisions and identify tags promptly, we use information obtained from the last process of tag identification at a reader. Our performance evaluation shows that the adaptive memoryless protocol causes fewer collisions and takes shorter delay for recognizing all tags while preserving lower communication overhead than other tree based tag anticollision protocols