【摘要】 针对RFID树型防碰撞算法搜索次数多、识别时延长等问题,提出了一种基于改进曼彻斯特码的三叉树搜索防碰撞算法。通过三进制改进曼彻斯特码实现碰撞位的检测,阅读器通过对碰撞位的准确解析,通过堆栈存取标签ID前缀来实现分类查询,可以实现高效的三叉树搜索,且无空闲时隙和附加查询时隙。当只有一个碰撞数据位时,可以一次识别多达3个标签。理论分析和仿真结果表明:新算法大幅度减少了搜索次数和识别时延,提高了搜索效率。更多还原

【Abstract】 Focusing on the problem of the tree-based anti-collision algorithm in RFID system such as many search times and long identification time, put forward a tri-tree searching anti-collision algorithm based on improved Manchester coding. It can detect the collision bits by the 3-ary improved Manchester coding. The reader realizes the classification query through the accurate analysis of the collision bits and the stack access tag ID prefix, and can realize the efficient tri-tree search without idle timeslots and additional query timeslots. When there is only one collision bit, up to three tags can be identified at a time. Theoretical analysis and simulation results show that the new algorithm greatly reduces the search times and identification time, and improves the search efficiency.更多还原