【摘要】 针对目前的二叉树算法传输时延大、冗余数据多等问题,提出了一种基于单次索引的SI算法.该算法阅读器寻呼时只发送单个碰撞位的索引值,标签接收到这个索引值后进行译码得出碰撞位的位置.仿真实验表明,SI算法在传输时延和数据冗余方面的性能要优于其他二叉树算法,更适用于标签数量较多的场合.更多还原

【Abstract】 At present,the binary tree algorithm has more time delay and more redundant data.A kind of single index based on SI algorithm was presented.The algorithm sends only one collision bit index value when the reader pages.The label received the index value after decoding and obtained collision location.The simulation results showed that SI anti-collision algorithm is better than other binary tree algorithm in transmission delay and data redundancy,and more suitable for the number of label more occasions.更多还原