A time-efficient frame size adjustment based approach for RFID anti-collision

TL;DR

This paper introduces a fast RFID anti-collision algorithm that adaptively adjusts frame size based on slot statistics, significantly improving identification speed and efficiency.

Contribution

It proposes a novel sub-frame-based algorithm with a time-efficient frame size adjustment strategy that reduces computational complexity and enhances RFID tag identification performance.

Findings

Improved throughput and time efficiency in RFID tag identification.

Significant reduction in computational complexity using look-up tables.

Noticeable improvements over existing RFID anti-collision methods.

Abstract

Fast and efficient identify a large number of RFID tags in the region of interest is a critical issue in various RFID applications. In this paper, a novel sub-frame-based algorithm with a time-efficient frame size adjustment strategy to reduce the time complexity for EPCglobal C1 Gen2 UHF RFID standard is proposed. By observing the slot statistics in a sub-frame, the tag quantity is estimated by the reader, which afterwards efficiently calculates an optimal frame size to fit the unread tags. Only when the expected time efficiency in the oncoming frame is higher than that in the previous frame, the reader starts the new identification round with the updated frame. Moreover, the estimation of the proposed algorithm is implemented by the look-up tables, which allows dramatically reduction in the computational complexity. Simulation results show noticeable throughput, time efficiency, and identification speed improvements of the proposed solution over the existing approaches.