The IDFSA algorithm based on multiplying factor and grouping theory for anti-collision in RFID system

At present probability algorithms used to solve tag collision are all based on the ALOHA algorithm for research and improvement. Dynamic Frame Slotted ALOHA (DFSA) algorithm is the more common and better-performing probabilistic algorithm. The focus of this algorithm is how to estimate the number of tags within the scope of reader effecting and according to this estimated value to adjust the length of the frame dynamically to achieve maximum system efficiency. This paper presents a new algorithm IDFSA (Improved Dynamic Frame Slotted ALOHA) based on DFSA and combining with multiplying factor and grouping mind. The IDFSA algorithm is easy to carry out and the simulation results show that IDFSA has better performance.