Wireless Communication

M. Katheeja Parveen ¹, P. Sheik Abdul Khader ², M. Munir Ahamed Rabbani ³

Affiliations
1 Department of Computer Applications, B.S. Abdur Rahman University, Vandalur, Chennai – 48, IN
2 Department of Computer Applications, B.S. Abdur Rahman University, Chennai, IN
3 Department of Computer Applications, B.S. Abdur Rahman University, Chennai – 48, IN

Abstract

RFID unlike barcodes enables simultaneous detection of multiple distant and non-line of sight objects. 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 power consumption. In general conventional protocols, utilisation of time slots are in rise, when the tag population increases exponentially. The protocols suggested in recent years follow a “win one – loose other agreement”. Though BT, QT, variants of QT, AQS and ABS who show superiority in minimizing collision, identification delay and transmitting bits, they are no longer memoryless. Cluster Adaptive Memoryless Protocol (CAMP) proposed in this paper takes account of all requirements of a good collision protocol. The grouping procedure and tree construction adopted makes the algorithm to stand apart.

Keywords

Anti Collision, RFID, Passive Tag Identification, Tree Based Algorithm.

Full Text