基于信息位编码的自适应搜索RFID防碰撞算法研究

无线射频识别（RFID）技术可实现对目标物体的自动识别.为了减少对物体标签识别时间，提出一种基于信息位编码的自适应搜索的防碰撞（AS）算法.读写器充分利用碰撞位信息，要求标签返回碰撞位编码信息，进而自适应地生成有效查询前缀，对标签进行无空闲时隙识别，以减少查询次数，提高算法的性能.此外，AS算法也解决了读写器与标签通信中传输信息冗余等问题.本文通过理论分析证明了该算法的有效性，其中吞吐率的理论值与实验值的误差不超过5%，还从时间复杂度和通信复杂度对该算法进行了详细地分析.仿真结果表明：AS算法不仅提高了系统的性能，而且还降低了标签能量的消耗.特别是当标签数为1000时，该算法的吞吐率仍保持在61%左右，比查询树算法和自适应多叉树算法的系统效率分别提高了72%和20.1%左右.

Research of an Adaptive Searching Anti-collision Algorithm for RFID Based on Information-Bit Encoding

Radio frequency identification(RFID)technology has the ability to automatically identify the target object. An adaptive searching prefix(AS)anti-collision algorithm for RFID based on encoding is proposed to reduce the identified time of the object tag.The reader makes full use of the collision information to adaptively generate a valid query prefix by ask-ing the tags return the collision coded information.With no idle slots for tags to identify,AS reduces the number of queries and consumedly enhances the system efficiency.Besides,it has solved the problems of redundant data in the communication be-tween the reader and the tags and other related issues.The effectiveness of the algorithm has been proved by the theoretical a-nalysis in detail,and the error of the throughput between the values of the theory and the experiment does not exceed 5%.Sim-ulation results show that AS not only achieves much better performance of the system,but also reduces the energy consumption of the tags.It improves the system efficiency by 72%and 20. 1%respectively compared with Query Tree algorithm and Adap-tive Multi-tree Search algorithm when the number of tags is over 1000,the throughput still maintains at about 61%.