一种减少通信复杂度的RFID搜索树防碰撞算法

针对射频识别搜索树防碰撞算法中通信数据量大、识别时延长等问题,提出了一种减少通信复杂度的防碰撞算法.在标签中引入前缀长度寄存器和响应标志寄存器,在阅读器堆栈区存储前缀个数信息,阅读器通过发送前缀长度信息,对标签进行分类搜索,阅读器和标签不再发送对方已经识别的序列号,有效减少了通信数据量.仿真结果表明,与传统的二叉树搜索防碰撞算法相比,该算法可明显减少系统通信复杂度,提高标签的搜索速率.

An RFID search tree anti-collision algorithm for reducing communication complexity

For the problems in the radio frequency identification(RFID) search tree anti collision algorithm such as large amount of communication data and long identification delay,an anti collision algorithm is proposed to reduce the communication complexity.The prefix length register and response flag register are introduced in the tag.The prefix number information is stored in the reader stack.By sending the prefix length information,the reader searches the tags by category.The reader and the tags no longer send the serial number recognized by the other party,which effectively reduces the amount of communication data.Simulation results show that compared with the traditional binary tree search anti collision algorithm,the proposed algorithm can significantly reduce the communication complexity of the system and improve the search rate of tags.