Study on request times of the IEDFSA algorithm in Matlab engine environment in RFID system

There are two kinds of collision. They are reader collision and tagcollision. The way to solve the collision called the anti-collision algorithm. Comparing with the reader collision, the tag collision take place in a higher probability and the problem of tag anti-collision is considered to be an important issue to resolve. When more than one tag in the reader area and send datum to the reader at the same time, the signal of the tags will interferes each other and the tags will not be able to be identified. We call it tag collision. It belongs to the mufti-target identification problems. At present probability algorithms used to solve tag collision are all based on the ALOHA algorithm for research and 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 IEDFSA (Improved Enhanced Dynamic Frame Slotted ALOHA) based on DFSA and combining with multiplying factor and grouping mind. The IEDFSA algorithm is easy to carry out and the simulation results show that IEDFSA has better performance.