A Memory Efficient Anti-Collision Protocol to Identify Memoryless RFID Tags

Abstract

This paper presents a memory efficient tree based anti-collision protocol to identify memoryless RFID (Radio Frequency Identification) tags that may be attached to products. The proposed deterministic scheme utilizes two bit arrays instead of stack or queue and requires only ϴ(n) space, which is better than the earlier schemes that use at least O(n 2 ) space, where n is the length of a tag ID in a bit. Also, the size n of each bit array is independent of the number of tags to identify. Our simulation results show that our bit array scheme consumes much less memory space than the earlier schemes utilizing queue or stack.

Randomized Scheme for Cognizing Tags in RFID Networks and Its Optimization

“…In the last decade, many efforts have been made to cognize a tag while arbitrating a packet collision [3][4][5]. The efforts resulted in numerous tag cognizance schemes, which are categorized into two tribes; one is a tribe of the schemes rooted in framed and slotted ALOHA [6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24] and the other is a tribe of the schemes rooted in m-ary tree scheme [25][26][27][28][29][30][31][32][33]. Usually, a tag cognizance scheme, which belongs to the tribe rooted in framed and slotted ALOHA, employs a time structure in which time is divided into frames and each frame contains a prescribed number of slots.…”