A Stack Bit-by-Bit Algorithm for RFID Multi-Tag Identification 


Vol. 32,  No. 8, pp. 847-857, Aug.  2007


PDF
  Abstract

For the implementation of a RFID system, an anti-collision algorithm is required to identify multiple tags within the range of a RFID Reader. A Bit-by-Bit algorithm is defined by Auto ID Class 0. In this paper, we propose a SBBB(Stack Bit-by-Bit) algorithm. The SBBB algorithm save the collision position and makes a query using the saved data. SBBB improve the efficiency of collision resolution. We show the performance of the SBBB algorithm by simulation. The performance of the proposed algorithm is higher than that of BBB algorithm. Especially, the more each tag bit streams are the duplicate, the higher performance is.

  Statistics
Cumulative Counts from November, 2022
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

[IEEE Style]

J. Lee, D. Yoo, S. s. Choi, "A Stack Bit-by-Bit Algorithm for RFID Multi-Tag Identification," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 8, pp. 847-857, 2007. DOI: .

[ACM Style]

Jae-ku Lee, Dae-suk Yoo, and Seung sik Choi. 2007. A Stack Bit-by-Bit Algorithm for RFID Multi-Tag Identification. The Journal of Korean Institute of Communications and Information Sciences, 32, 8, (2007), 847-857. DOI: .

[KICS Style]

Jae-ku Lee, Dae-suk Yoo, Seung sik Choi, "A Stack Bit-by-Bit Algorithm for RFID Multi-Tag Identification," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 8, pp. 847-857, 8. 2007.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880