An RFID Anti-collision Algorithm Based on Grouped Dynamic Frame and Binary Tree Recursive Identification

This paper firstly analyzes and compares the time complexity and communication complexity of tranditional RFID(radio frequency identification) anti-collision algorithms.Their weaknesses are summarized,and a novel RFID anticollision algorithm is proposed based on the strategies of optimal group number,optimal frame size and binary tree recursive identification in each collision slot.Secondly,a system model is set up and mathematical deductions of time complexity and communication complexity are achieved.Simulations show that the simulative values of the above indexes are in good accordance with their theoretical values.Compared with traditional anti-collision algorithms,the presented algorithm exhibits excellent general performances:the system throughput is around 0.41,and the communication complexity approximates to that of EDFSA and is less than half of that of the tree-based algorithms.Moreover,the new algorithm is tolerant to the inaccuracy of initial tag estimation and the variation of tag's ID length.