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


Haejae Jung, Journal of Information Processing Systems Vol. 11, No. 1, pp. 95-103, Mar. 2015  

10.3745/JIPS.03.0010
Keywords: RFID tag identification, anti-collision protocol, Data Structure, Query Tree
Fulltext:

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(n2) 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.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.




Cite this article
[APA Style]
Haejae Jung (2015). A Memory Efficient Anti-Collision Protocol to Identify Memoryless RFID Tags. Journal of Information Processing Systems, 11(1), 95-103. DOI: 10.3745/JIPS.03.0010.

[IEEE Style]
H. Jung, "A Memory Efficient Anti-Collision Protocol to Identify Memoryless RFID Tags," Journal of Information Processing Systems, vol. 11, no. 1, pp. 95-103, 2015. DOI: 10.3745/JIPS.03.0010.

[ACM Style]
Haejae Jung. 2015. A Memory Efficient Anti-Collision Protocol to Identify Memoryless RFID Tags. Journal of Information Processing Systems, 11, 1, (2015), 95-103. DOI: 10.3745/JIPS.03.0010.