Fast Anti-Collision Algorithm Using Pre-distributed Random Address 


Vol. 30,  No. 3, pp. 184-194, Mar.  2005


PDF
  Abstract

One of the most important factors that decide the overall performance of RFID system is anti-collision algorithm. By enhancing the anti-collision algorithm, we can increase the number of RFID tags that can be processed in unit time. Two anti-collision algorithms are most widely prevailed: one is ALOHA-based protocol and the other is a binary tree walking method, but these are still under research. In this paper, we suggest an anti-collision algorithm named AAC(Address Allocating and Calling) using pre-distributed random address, which is much faster and more efficient than existing ones. Finally, we evaluate our scheme using mathematical analysis and computer simulation.

  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. i. Kang, J. s. Park, D. h. Nyang, "Fast Anti-Collision Algorithm Using Pre-distributed Random Address," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 3, pp. 184-194, 2005. DOI: .

[ACM Style]

Jeon il Kang, Ju sung Park, and Dae hun Nyang. 2005. Fast Anti-Collision Algorithm Using Pre-distributed Random Address. The Journal of Korean Institute of Communications and Information Sciences, 30, 3, (2005), 184-194. DOI: .

[KICS Style]

Jeon il Kang, Ju sung Park, Dae hun Nyang, "Fast Anti-Collision Algorithm Using Pre-distributed Random Address," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 3, pp. 184-194, 3. 2005.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880