A Hybrid Hyper Query Tree Algorithm for RFID System


The KIPS Transactions:PartA, Vol. 15, No. 5, pp. 287-294, Oct. 2008
10.3745/KIPSTA.2008.15.5.287,   PDF Download:

Abstract

A tag collision arbitration algorithm for RFID passive tags is one of the important issues for fast tag identification, since reader and tag have a shared wireless channel in RFID system. This paper suggests Hyper-Hybrid Query Tree algorithm to prevent the tag-collisions. The suggested algorithms determine the specified point in time for tag to transfer ID to reader by using value 1 of the upper 3 bit based on Query Tree. Also, because the transferred upper 3 bits of tag is different depending on the time of transfer, it is possible to predict in the suggested Algorithm. In the performance evaluation through simulation, it shows the suggested algorithm has higher performance in the number of queries compared to other Tree-based protocols.


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]
T. H. Kim, S. J. Lee, K. S. Ahn, "A Hybrid Hyper Query Tree Algorithm for RFID System," The KIPS Transactions:PartA, vol. 15, no. 5, pp. 287-294, 2008. DOI: 10.3745/KIPSTA.2008.15.5.287.

[ACM Style]
Tae Hee Kim, Seong Joon Lee, and Kwang Seon Ahn. 2008. A Hybrid Hyper Query Tree Algorithm for RFID System. The KIPS Transactions:PartA, 15, 5, (2008), 287-294. DOI: 10.3745/KIPSTA.2008.15.5.287.