A Variable-Slotted Tree Based Anti-Collision Algorithm Using Bit Change Sensing in RFID Systems 


Vol. 16,  No. 4, pp. 289-298, Aug.  2009
10.3745/KIPSTA.2009.16.4.289


PDF
  Abstract

Generally, RFID systems are composed of one reader and several passive tags, and share the single wireless channel. For this reason, collisions occurwhen more than two tags simultaneously respond to the reader's inquiry. To achieve this problem, many papers, such as QT[8], HCT[10], BSCTTA[2], and QT-BCS[9], have been proposed. In this paper, we propose the tree-based anti-collision algorithm using a bit change sensing unit (TABCS) based on BSCTTA algorithm. The proposed algorithm can identify bits returned from tags through bit change sensing unit, even if multi collisions occur. So, it rapidly generates the unique prefix to indentify each tag, and reduce the total of bits. As the result, the cost of identifying all tag IDs is relatively reduced as compared with existing algorithms. It is verified through simulations that the proposed algorithm surpass other existing algorithms.

  Statistics
  Cite this article

[IEEE Style]

W. T. Kim, K. S. Ahn, S. J. Lee, "A Variable-Slotted Tree Based Anti-Collision Algorithm Using Bit Change Sensing in RFID Systems," The KIPS Transactions:PartA, vol. 16, no. 4, pp. 289-298, 2009. DOI: 10.3745/KIPSTA.2009.16.4.289.

[ACM Style]

Won Tae Kim, Kwang Seon Ahn, and Seong Joon Lee. 2009. A Variable-Slotted Tree Based Anti-Collision Algorithm Using Bit Change Sensing in RFID Systems. The KIPS Transactions:PartA, 16, 4, (2009), 289-298. DOI: 10.3745/KIPSTA.2009.16.4.289.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals