To conquer the shortcomings of general binary anti-collision algorithms, such as more interactive times and communication data, proposed an improved binary anti-collision algorithm. When tags were identified the IDs information firstly and then in the whole process only the collision bits were dealt with. It constructed the identification tree from tags leaves and could identified the tags directly on leaves' father level . No matter whether the tags' collision bits were consecutive or not, the algorithm was always effective. On interactive times, communication data and identification efficiency, the new algorithm had obvious superiority, especially when there were many tags within the scope of reader and collision bits were less than the length of tags. The algorithm is proved feasible, practical and effective by simulation, theory analysis and testing instance.%为了克服普通二进制算法交互次数多、通信数据量大的缺点,提出了一种改进二进制防碰撞算法.新算法首先进行信息预处理,识别过程中只处理冲突位,并以待识别标签为叶子节点反向构建识别树,在叶子节点的父层实现标签识别.其在碰撞位连续或间断情况下均可有效认读标签.尤其当冲突标签数量较多而碰撞位明显小于标签长度时,其在交互次数、通信数据量和识别效率上均表现出较明显的优势.模拟仿真、理论分析和算法实例验证了新算法的可行性、实用性和高效性.
展开▼
