Simplified computation in memoryless anti-collision RFID identification protocols

Abstract

A memoryless-based Collision window Tree plus (CwT+ ) protocol for simplified computation in anti-collision radio frequency identification (RFID) is proposed and presented. The CwT+ makes effective use of a threshold to accurately enhance bit-tracking and in turn lowers the identification time of the communication response. The threshold limits the bitstream of responding tags in an accurate fashion for simplified computation in the interrogation procedure. Simulation results show the outperformance of the CwT+ compared with earlier protocols.