| In Radio Frequency Identification (RFID) system, one of the problems that have to be solved is the collision between tags which lowers the efficiency of the RFID system. There are different proposed algorithms to solve this problem. One of the popular anti-collision algorithms is ALOHA-type algorithms, which are simple and show good performance when the number of tags to read is small. However, they generally require exponentially increasing number of slots to identify the tags as the number of tag increases. In this thesis, we propose a new anti-collision algorithm based on Dynamic Framed Slotted Aloha (DFSA) called Threshold base DFSA (THDFSA), which adjusts the number of slots in the frame based on the number of remaining tags to be identified to give the optimal total number of slots required to identify all the tags. As a result, in the proposed method, the number of slots to read the tags increases linearly as the number of tags does. Simulation results show that the proposed algorithm reduces the total number of slots to identify the tags in comparison to the conventional algorithms for various numbers of tags. |
