• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

A Simple and Fast Anti-collision Protocol for Large-scale RFID Tags Identification

Vol. 14, No. 4, April 30, 2020
10.3837/tiis.2020.04.004, Download Paper (Free):

Abstract

This paper proposes a novel anti-collision protocol for large-scale RFID tags identification, named Bi-response Collision Tree Protocol (BCT). In BCT, two group of tags answer the reader’s same query in two response-cycles respectively and independently according to the bi-response pattern. BCT improves the RFID tag identification performance significantly by decreasing the query cycles and the bits transmitted by the reader and tags during the identification. Computation and simulation results indicate that BCT improves the RFID tag identification performance effectively, e.g. the tag identification speed is improved more than 13.0%, 16.9%, and 22.9% compared to that of Collision Tree Protocol (CT), M-ary Collision Tree Protocol (MCT), and Dual Prefix Probe Scheme (DPPS) respectively when tags IDs are distributed uniformly.


Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
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]
X. Jia, Y. Feng and Y. Gu, "A Simple and Fast Anti-collision Protocol for Large-scale RFID Tags Identification," KSII Transactions on Internet and Information Systems, vol. 14, no. 4, pp. 1460-1478, 2020. DOI: 10.3837/tiis.2020.04.004.

[ACM Style]
Xiaolin Jia, Yuhao Feng, and Yajun Gu. 2020. A Simple and Fast Anti-collision Protocol for Large-scale RFID Tags Identification. KSII Transactions on Internet and Information Systems, 14, 4, (2020), 1460-1478. DOI: 10.3837/tiis.2020.04.004.