Improving RFID Anti-Collision Algorithms with Multi-Packet Reception 


Vol. 31,  No. 11, pp. 1130-1137, Nov.  2006


PDF Full-Text
  Abstract

One of the important performance issues in large-scale RFID systems is to resolve collisions among responses from RFID tags. Considering two de facto anti-collision solutions, namely the binary-tree splitting algorithm and the Slotted-Aloha algorithm, we propose to use multi-packet reception (MPR) capability to enhance the RFID tag reading rate (i.e., throughput). MPR allows an RFID reader to receive multiple responses transmitted by tags at the same time. We analyze the effect of MPR capability in the above anti-collision algorithms, which is also validated by simulation. The analysis and simulation results show that RFID reader antenna design and signal separation techniques play an important role in improving RFID system performance with MPR capability.

  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, T. Kwon, Y. Choi, K. Kim, "Improving RFID Anti-Collision Algorithms with Multi-Packet Reception," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 11, pp. 1130-1137, 2006. DOI: .

[ACM Style]

Jeongkeun Lee, Taekyoung Kwon, Yanghee Choi, and Kyung-ah Kim. 2006. Improving RFID Anti-Collision Algorithms with Multi-Packet Reception. The Journal of Korean Institute of Communications and Information Sciences, 31, 11, (2006), 1130-1137. DOI: .

[KICS Style]

Jeongkeun Lee, Taekyoung Kwon, Yanghee Choi, Kyung-ah Kim, "Improving RFID Anti-Collision Algorithms with Multi-Packet Reception," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 11, pp. 1130-1137, 11. 2006.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880