Design of RFID Air Protocol Filtering and Probabilistic Simulation of Identification Procedure 


Vol. 34,  No. 6, pp. 585-594, Jun.  2009


PDF
  Abstract

Efficient filtering is an important factor in RFID system performance. Because of huge volume of tag data in future ubiquitous environment, if RFID readers transmit tag data without filtering to upper-layer applications, which results in a significant system performance degradation. In this paper, we provide an efficient filtering technique which operates on RFID air protocol. RFID air protocol filtering between tags and a reader has some advantages over filtering in readers and middleware, because air protocol filtering reduces the volume of filtering work before readers and middleware start filtering. Exploiting the air protocol filtering advantage, we introduce a geometrical algorithm for generating air protocol filters and verify their performance through simulation with analytical time models. Results of dense RFID reader environment show that air protocol filtering algorithms reduce almost a half of the total filtering time when compared to the results of linear search.

  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]

H. Park and J. Kim, "Design of RFID Air Protocol Filtering and Probabilistic Simulation of Identification Procedure," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 6, pp. 585-594, 2009. DOI: .

[ACM Style]

Hyun-Sung Park and Jong-Deok Kim. 2009. Design of RFID Air Protocol Filtering and Probabilistic Simulation of Identification Procedure. The Journal of Korean Institute of Communications and Information Sciences, 34, 6, (2009), 585-594. DOI: .

[KICS Style]

Hyun-Sung Park and Jong-Deok Kim, "Design of RFID Air Protocol Filtering and Probabilistic Simulation of Identification Procedure," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 6, pp. 585-594, 6. 2009.