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

Authors: Sree Kalyan Ravilla, Ajay Ogirala, Archana Murari, Peter J. Hawrylak, Marlin H. Mickle

Addresses: University of Pittsburgh, Pittsburgh, PA 15261, USA. ' University of Pittsburgh, Pittsburgh, PA 15261, USA. ' University of Pittsburgh, Pittsburgh, PA 15261, USA. ' University of Pittsburgh, Pittsburgh, PA 15261, USA. ' University of Pittsburgh, Pittsburgh, PA 15261, USA

Abstract: 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-1 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 N 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.

Keywords: radio frequency identification; passive RFID; anti-collision policy; fast predict tags; estimation errors; throughput; identify tags; RFID tags; collision avoidance.

DOI: 10.1504/IJRFITA.2011.040995

International Journal of Radio Frequency Identification Technology and Applications, 2011 Vol.3 No.3, pp.215 - 228

Received: 06 Dec 2010
Accepted: 28 Jan 2011

Published online: 18 Mar 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article