Tree-based classification algorithm for heterogeneous unique item ID schemes

6Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

For RFID-based applications, the uniqueness of ID assigned to each RFID tag should be guaranteed. Several research/standard organizations such as EPCglobal, ISO/IEC, Ubiquitous ID Center, and so on, have developed their own Unique Item ID (UII) specifications. The existence of various UII schemes may cause interoperability problems between applications using different UII schemes when those applications are operated on future global Internet network environment. In addition, it is expected that the traffic for UII query will be increased ten-times higher than that for DNS query in the current Internet. In order to overcome these problems, this paper proposes a fast tree-based classification algorithm applicable for various UII schemes, which can make it efficient to construct global directory lookup services for RFID applications with various UII schemes. Since the proposed scheme can be operated on readers, it can not only distribute traffic loads for UII queries, but also global RFID networks. © IFIP International Federation for Information Processing 2005.

Cite

CITATION STYLE

APA

Lee, Y. H., Kim, H. J., Roh, B. H., Yoo, S. W., & Oh, Y. C. (2005). Tree-based classification algorithm for heterogeneous unique item ID schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3823 LNCS, pp. 1078–1087). https://doi.org/10.1007/11596042_110

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free