General binary tree protocol for coping with the capture effect in RFID tag identification
General binary tree protocol for coping with the capture effect in RFID tag identification
复制标题
DOI：
10.1109/lcomm.2010.03.092208
复制
发表时间：
2010-03
期刊：
影响因子：
--
通讯作者：
Y. Lai;Ling-Yen Hsiao
中科院分区：
文献类型：
--
作者：
Y. Lai;Ling-Yen Hsiao
标签防碰撞是RFID系统中的一个重要问题，因为阅读器必须有效地识别所有的标签。在RFID无线通信系统中，标签识别会遇到捕获效应，即即使多个标签同时传输其信号，阅读器也会解码标签ID。本文提出了一种标签防碰撞算法——广义二叉树协议（GBT）。GBT将识别过程分成若干个二叉树（BT）循环，以解决捕获效应带来的问题。在BT周期中被捕获效应隐藏的未识别标签将在随后的周期中被识别。推导了GBT算法识别时延的形式化分析，仿真和分析结果表明，GBT算法明显优于其他现有算法。
Tag anti-collision is an important issue in RFID systems because the reader must recognize all tags efficiently. In RFID wireless communication systems, tag identification will encounter the capture effect, where a reader decodes a tag ID even when multiple tags simultaneously transmit their signals. This letter proposes a tag anti-collision algorithm - the generalized binary tree protocol (GBT). GBT separates the identification process into several binary tree (BT) cycles to solve the problem caused by the capture effect. Unrecognized tags, hidden by the capture effect in a BT cycle, will be identified in subsequent cycles. The formal analysis of identification delay for GBT is derived and simulation and analytical results show that GBT significantly outperforms other existing algorithms.