Abstract: Aiming at some problems of existing binary tree anti-collision algorithms in ultra high frequency radio frequency identification (RFID) systems, such as larger communication traffic and higher transmission delay, this paper proposes a novel back-off binary tree (NBBT) anti-collision algorithm by combining the jumping dynamic search (JDS) and the novel JDS (NJDS) anti-collision algorithms, and introducing a back-off paging strategy. The proposed algorithm adds a guiding bit to the reader‘s paging instruction in order that the tag can respond to the reader quickly. As a result, the proposed algorithm can reduce total communication traffic and the transmission delay. Compared with the existing JDS or NJDS algorithms, the simulated results show that the proposed algorithm is more efficient in transmission delay and communication traffic. Furthermore, the algorithm can significantly improve the communication rate between the reader and the tag.

Key words: radio frequency identification (RFID), binary tree anti-collision algorithm, back-off paging, guiding bit

摘要： 针对目前超高频射频识别（radio frequency identification，RFID）二叉树防碰撞算法通信量大和传输时延长等问题，结合跳跃式动态搜索（jumping dynamic search，JDS）和新颖跳跃式动态搜索（novel JDS，NJDS）防碰撞算法，引入后退寻呼策略，提出了一种新的后退式二叉树（novel back-off binary tree，NBBT）防碰撞算法。该算法通过在阅读器寻呼指令中加入引导位使标签以更快的速度响应阅读器，从而减少总通信量和传输时延。仿真结果表明，与现有JDS或NJDS防碰撞算法相比，该算法在传输时延和通信量方面更高效。此外，该算法能够显著提高阅读器和标签之间的通信速率。

关键词: 射频识别（RFID）, 二叉树防碰撞算法, 后退寻呼, 引导位