B- bit pooling memoryless algorithm for anti - collision resolution in passive RFID tags

Radio frequency identification is a system to identify and wirelessly transmit the identity of an object via radio waves. These characteristics make them exceptional and broaden its scope and utility of RFID systems. Signal transmissions from multiple tags result in tag collisions or confusion causing increase in identification delay, communication overhead and unnecessary energy wastage that ultimately shortens the life span of the system. Conventional protocols began their journey from being memoryless; however recent mechanisms are no longer memoryless. It is also observed that existing approaches perform better when the tag population is optimal. When the population is in rise exponentially, the utilisation of time slots and energy consumption also rises haphazardly. Though BT, QT, variants of QT, AQS and ABS show superiority in minimizing collision, identification delay and transmitting bits, they are no longer memoryless. Simulation studies have shown that idle listening and collision are the main causes for energy consumption. The proposed b-bit pooling memoryless algorithm takes account of all the requirements of a good design in an anti-collision protocol. The pooling procedure and tree construction adopted makes the proposed algorithm in this paper to stand apart.