For RFID tags, a Novel Tag Anti-collision Algorithm with Grouping (TAAG) is proposed. It divides tags into groups and adopts a deterministic method to identify tags within group. TAAG estimates the total number of tag...For RFID tags, a Novel Tag Anti-collision Algorithm with Grouping (TAAG) is proposed. It divides tags into groups and adopts a deterministic method to identify tags within group. TAAG estimates the total number of tags in systems from group identifying result and then adjusts the grouping method accordingly. The performance of the proposed TAAG algorithm is compared with the conventional tag anti-collision algorithms by simulation experiments. According to both the analysis and simulation result, the proposed algorithm shows better performance in terms of throughput, total slots used to identify and total cycles.展开更多
提出了一种基于分组机制的位仲裁查询树(GBAQT,bit arbitration query tree based on grouping mechanism)算法。该算法根据标签ID自身特征分组,采用3位仲裁位来取代传统1位仲裁识别标签的方式,通过碰撞位信息得到传输数据,从而能避免...提出了一种基于分组机制的位仲裁查询树(GBAQT,bit arbitration query tree based on grouping mechanism)算法。该算法根据标签ID自身特征分组,采用3位仲裁位来取代传统1位仲裁识别标签的方式,通过碰撞位信息得到传输数据,从而能避免一些空闲时隙。算法的性能分析和仿真结果表明,GBAQT防碰撞算法具有较少的总时隙数,系统效率和时隙利用率也明显优于其他算法。展开更多
文摘For RFID tags, a Novel Tag Anti-collision Algorithm with Grouping (TAAG) is proposed. It divides tags into groups and adopts a deterministic method to identify tags within group. TAAG estimates the total number of tags in systems from group identifying result and then adjusts the grouping method accordingly. The performance of the proposed TAAG algorithm is compared with the conventional tag anti-collision algorithms by simulation experiments. According to both the analysis and simulation result, the proposed algorithm shows better performance in terms of throughput, total slots used to identify and total cycles.
文摘提出了一种基于分组机制的位仲裁查询树(GBAQT,bit arbitration query tree based on grouping mechanism)算法。该算法根据标签ID自身特征分组,采用3位仲裁位来取代传统1位仲裁识别标签的方式,通过碰撞位信息得到传输数据,从而能避免一些空闲时隙。算法的性能分析和仿真结果表明,GBAQT防碰撞算法具有较少的总时隙数,系统效率和时隙利用率也明显优于其他算法。
