A DFS-ALOHA Algorithm with Slot Congestion Rates in a RFID System


The KIPS Transactions:PartC, Vol. 16, No. 2, pp. 267-274, Apr. 2009
10.3745/KIPSTC.2009.16.2.267,   PDF Download:

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. There are two methods of anti-collision algorithms for the identification of multiple tags, conclusive algorithms based on tree and stochastic algorithms based on slotted ALOHA. In this paper, we propose a Dynamic Framed Slotted ALOHA-Slot Congestion(DFSA-SC) Algorithm. The proposed algorithm improves the efficiency of collision resolution. The performance of the proposed DFSA-SC algorithm is showed by simulation. The identification time of the proposed algorithm is shorter than that of the existing DFSA algorithm. Furthermore, when the bit duplication of the tagID is higher, the proposed algorithm is more efficient than Query Tree algorithm.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
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. K. Lee and S. S. Choi, "A DFS-ALOHA Algorithm with Slot Congestion Rates in a RFID System," The KIPS Transactions:PartC, vol. 16, no. 2, pp. 267-274, 2009. DOI: 10.3745/KIPSTC.2009.16.2.267.

[ACM Style]
Jae Ku Lee and Seung Sik Choi. 2009. A DFS-ALOHA Algorithm with Slot Congestion Rates in a RFID System. The KIPS Transactions:PartC, 16, 2, (2009), 267-274. DOI: 10.3745/KIPSTC.2009.16.2.267.