Anti-collision policy for RFID systems: fast predict tags in field algorithm

摘要

Passive radio frequency identification (RFID) technology is developed and designed to identify many items that are 'tagged' within range as quickly as possible. To explain the identification process briefly, the interrogator issues a command that it is ready to listen and allots T time slots for tags to respond in. The tags that received the command pick a time slot between 0 to T- and respond in that time slot. Considering this one frame of communication; the entire identification process usually requires multiple frames to complete identifying all tags in field. Assuming a fairly random distribution of the time slots selected by all the tags in the field (N), the value of T should be ideally equal to N to complete identification of all N tags in minimum time while minimising idle and collision slots and maximising single reply slots. Establishing a value of T not knowing A' is a challenge. The research documented in this article describes the conception of a new fast predict tags in field algorithm (FPTFA), the hardware complexity and processor overhead involved in its implementation and compares it with popular anti-collision algorithms that are in practice.