Average time delay is a key factor to affect identification performance in RFID anti-collision algorithm,which mainly depends on the average bits for identification of each tag.A new binary-tree searching algorithm is proposed based on binary searching anti-collision algorithm.The average bits for identification of each tag is significantly reduced in thisalgorithm,when the reader have reached the bottom level of the tree,the next request signal from superior layer of the binary-tree can be acquired by the reader,and then all tags can be identified continuously.The paper performs simulation and analyze of this algorithm at the last part of this paper,proved the significantly improvement in performance.%在RFID防碰撞算法中,平均时延是影响识别性能的关键因素。平均时延主要取决于识别每个标签所需的平均比特数。在二进制搜索防碰撞算法的基础上,提出了一种新的二叉树形搜索算法,该算法显著减少了识别标签的平均比特数,且当阅读器检索到树的底层时,可向二叉树的上层回溯,最终连续识别出所有的标签。对算法进行了仿真分析,证明该算法在性能上有明显提高。
展开▼
