基于分组动态帧和查询栈的射频识别反碰撞算法

在对现有RFID反碰撞算法综合分析的基础上,提出了一种基于分组动态帧和查询栈的射频识别反碰撞算法,即先分配最优分组数和帧长逐组逐个时隙识别标签,再针对发生碰撞的时隙采用查询栈算法识别碰撞标签。该算法同时具有ALOHA系列算法和树形算法的优点,具有高吞吐率、低通信负担、无遗漏识别等特点。同时,该算法还以较小的读写器额外硬件开销降低了以往算法对标签内额外硬件开销的要求,适合应用于具有大量被动标签的RFID系统中。

Abstract：

Firstly,existing representative RFID anti-collision algorithms were analyzed,and then a novel anti-collision algorithm was proposed which based on dynamic frame and query stack.The proposed algorithm has obvious advantages of high system throughput,low communication overhead and exhaustive tag identification.Furthermore,the algorithm also reduces the requirement of tag hardware at the less cost of extra reader hardware,which ensures it can be applied in RFID systems widely.

RFID Anti-collision Algorithm Based on Grouped Dynamic Frame and Query Stack

Firstly,existing representative RFID anti-collision algorithms were analyzed,and then a novel anti-collision algorithm was proposed which based on dynamic frame and query stack.The proposed algorithm has obvious advantages of high system throughput,low communication overhead and exhaustive tag identification.Furthermore,the algorithm also reduces the requirement of tag hardware at the less cost of extra reader hardware,which ensures it can be applied in RFID systems widely.