A New EPC-C1G2 Based Anti-Collision Algorithm to Address Tag's Starvation in RFID Systems

In this paper, we present a new EPC-C1G2 standard based anti-collision algorithm to solve the problem of tags’ starvation in RFID systems. Non deterministic identification of tags in the collisions lots, leads to tags’ starvation phenomenon. In this paper, to address this problem, we use the position of the first different value bits that are the first different bits in the tags’ 16-bit random number (or RN16).In fact, the reader in facing with collision slots, earns the position of the first different-value bit in RN16 and uses it to deterministic identification of tags. Unlike recent anti-collision algorithms, which in them it is assumed that tags send information synchronous or asynchronous, in the proposed anti-collision algorithm in order to obtain the position of the first different-value bit there is not any assumption on synchronous or asynchronous sending information by tags. Based on simulation which is done, the average time of identification for 200 to 2000tags in the proposed anti-collision algorithm relative to average time of identification in EPC-C1G2, BIS and ERN2 anti-collision algorithms is less than 0.92, 0.71, and 0.42 second, respectively.