Performance Analysis of Enhanced Q-ary Tree Anti-Collision Protocols

Abstract

Radio Frequency Identification (RFID) is a contactless automatic identification technology that uses radio-frequency (RF) waves to identify objects. The fast capturing of large number of RFID tags by readers produce errors in data streams, especially \textit{Missed reads}, caused by simultaneous reads of multiple tags. This problem can be solved by using \textit{anti-collision} techniques to prevent two or more tags from communicating to a reader at the same time. The current \textit{Tree-based} approaches are hindered from too long \textit{Identification delay} due to large memory required during the identification process. In this paper, we propose the ``Enhanced Q-ary Tree Anti-Collision Protocols'' and show the results of that performance analysis. The results demonstrate that our approach requires less memory per complete identification round than an existing approaches, which ensures more efficient identification time.