Robust and Dynamic Bin Slotted anti-collision algorithms in RFID system

In this paper, we present the Dynamic Bin Slotted memoryless anti-collision algorithm (DBS) and the Robust Dynamic Bin Slotted memoryless anti-collision algorithm (RDBS) (which is a countermeasure to the strong and weak tag problems). They are based upon a bin slot tree algorithm. Both algorithms combine deterministic and probabilistic approaches to improve performance. We suggest a simple estimator to estimate the number of tags in an interrogation zone that is optimized for bin-slot tree algorithms. Our performance evaluation shows that DBS and RDBS surpass other existing bin slotted algorithms. According to our simulation results, the total identification time of the DBS algorithm for all tags is reduced by 57.28% for 300 tags compared to the conventional Bin Slotted Algorithm (BSA). Moreover, under the strong-weak tag problem, the RDBS algorithm reduces over 29.59% of the total number of PingID commands and 3.51% of the identification time for maximum 300 tags over the Bin-slotted Hybrid Search Algorithm, which is the best reported variation of BSA.