摘要
在多标签的RFID系统中,存在标签的碰撞问题,在标签数量较多时,需要尽可能快地对所有标签进行识别。提出了一种改进的搜索树防碰撞算法,充分利用多叉树搜索和二叉树搜索的优点,根据标签的数量和碰撞位的位置对标签进行分类搜索。在首次搜索时,根据预估的标签数量确定搜索叉树,使用多叉树搜索;首次搜索以后,使用二叉树搜索。当只有一个碰撞位时,直接识别两个标签。仿真结果表明,新算法提高了RFID系统的性能,减少了总时隙数,提高了吞吐率。
In multi-tags RFID system, there is a problem of tag-collision. When there are a large number of tags, all tags need to be identified as soon as possible. An improved searching tree anti-collision algorithm is proposed, which makes full use of the advantages of multi-tree search and binary tree search, and classifies the tags according to the number of tags and the location of the collision-bits. In the first search, the number of searching tree branches is determined according to the estimated number of tags, using a multi-tree search, and after the first search, using a binary tree search. When there is only one collision bit, two tags are directly identified. The simulation results show that the new algorithm improves the performance of the RFID system, reduces the total timeslots and improves the throughput.
作者
莫崇江
Mo Chongjiang(Science and Technology on Electromagnetic Scattering Laboratory,Beijing 100854,China)
出处
《电子测量技术》
2018年第21期59-62,共4页
Electronic Measurement Technology
作者简介
莫崇江,1976年出生,工学学士、高级工程师,主要研究方向为电磁测量技术、应用电子技术等。E-mail:aqqqttt@163.com
