Performance Analysis of Enhanced Q-ary Tree Anti-Collision Protocols

No Thumbnail Available
File version
Author(s)
Pupunwiwat, Prapassara
Stantic, Bela
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)

Patricia Anthony, Tan Yew Seng & Dickson Lukose

Date
2009
Size
File type(s)
Location

Kulala Lumpur, Malaysia

License
Abstract

Radio Frequency Identification (RFID) is a contactless automatic identification technology that uses radio-frequency (RF) waves to identify objects. The fast capturing of large number of RFID tags by readers produce errors in data streams, especially /textit{Missed reads}, caused by simultaneous reads of multiple tags. This problem can be solved by using /textit{anti-collision} techniques to prevent two or more tags from communicating to a reader at the same time. The current /textit{Tree-based} approaches are hindered from too long /textit{Identification delay} due to large memory required during the identification process. In this paper, we propose the ``Enhanced Q-ary Tree Anti-Collision Protocols'' and show the results of that performance analysis. The results demonstrate that our approach requires less memory per complete identification round than an existing approaches, which ensures more efficient identification time.

Journal Title
Conference Title

Proceedings of the First Malaysian Joint Conference on Artificial Intelligence (MJCAI 2009)

Book Title
Edition
Volume
Issue
Thesis Type
Degree Program
School
DOI
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject

Database Management

Persistent link to this record
Citation