基于ALOHA和多叉树的混合型RFID防碰撞算法

Research on Hybrid of ALOHA and Multi-fork Tree Anti-collision Algorithm for RFID

为解决物联网中射频识别(RFID)系统多标签碰撞问题,在分析二进树算法和ALOHA算法的基础上,提出了一种ALOHA和多叉树的混合型(HAMT)算法。该算法首先采用动态帧时隙ALOHA(DFSA)算法进行标签识别,然后根据未识别标签数目动态选择多叉树算法进行标签识别,从而保证了标签100%被识别,提高吞吐率和缩短了识别时间。仿真结果表明,当待识别标签总数达到1000时,HAMT算法的吞吐率可以保持在0.72左右。因此HAMT算法可以解决RFID系统中多标签碰撞问题,在物联网系统中具有良好的应用前景。

Based on the analysis of the binary tree algorithm and the ALOHA algorithm,a Hybrid of ALOHA and multi-fork Tree(HAMT)anti-collision algorithm is presented to solve the multi-tag collision problem of RFID systems in the Internet of Things.The algorithm first uses the dynamic frame slotted ALOHA(DFSA)algorithm for tag identification,and then dynamically selects the multi-fork tree algorithm for tag identification based on the number of unidentified tags.The algorithm ensures that the tags are 100%identified,which improves the throughput rate and shortens the recognition time.The results of the simulation show that when the number of tags is about 1000,the throughput ratio of the HAMT algorithm can be maintained at around 0.72.So the HAMT algorithm can solve the multi-tag collision problem in RFID systems and has a good application prospect in the Internet of Things system.