A comparative performance evaluation study of the basic binary tree and aloha based anti-collision protocols for passive RFID system

RFID (Radio Frequency Identification) technology is one of the most important branches of the automatic identification technology which achieves the identification of targets by contactless communications. One of the major challenges for RFID systems is to avoid or solve collisions due to interference that might occur between tags which decrease the efficiency of RFID system. This paper focused on a detailed comparative performance evaluation study and an adoption of certain algorithms of anti-collision for passive RFID system, for the two families of solving collision: deterministic (according to the: QTA, CTTA, BS-QTA, BS-CTTA) and stochastic (ALOHA, SLOTTED ALOHA, np-CSMA). The simulation results for the two families that we get with protocols evaluation are based on their own proper evaluation parameters. Thus, for evaluating the simulation of the stochastic family, we have proposed a new performance metric which judges and correctly evaluates this anti-collision protocol; which is: the number of identified tags versus to the time. This metric provides a direct measure of the time taken to read a group of tags.