Efficient Anti-collision Algorithm for RFID EPC Generation-2 Protocol Based on Continuous Detection

Abstract

To improve the efficiency of the identification process in RFID system, anti-collision protocol is crucial. EPC Class-1 Generation-2 standard (Gen2) employs ALOHA-based Q algorithm as anti-collision protocol. However, the same updating rate will cause unnecessary collided and idle slots. In 2010, we proposed a Fast Q algorithm (FQA) that adjusted the value of Q with different steps. Recently, we find that the Fast Q algorithm can be further improved since it did not consider the probabilities of collided/idle slots. Accordingly, this paper proposes an Enhanced Fast Q algorithm (EFQA). In EFQA, Q will be updated after two continuous collided or idle slots with different updating rates, which are calculated by synthesizing the duration time of collided/idle slots and their probabilities. We then quantitatively analyze the performance of EFQA by establishing a Discrete-Time Markov Chain (DTMC) model. Simulation results show that EFQA outperforms other protocols regardless of the number of tags.