Frame Size Analysis of Optimum Dynamic Tree in RFID Systems
In RFID (Radio Frequency Identification) system, an anti-collision algorithm plays a prominent role in the tag identification process in order to reduce the tag identification delay and enhance the RFID system efficiency. In this work, we present a theoretical analysis of optimal frame size assignment for maximizing the system efficiency of a tree-based anti-collision algorithm, called optimum dynamic tree (ODT) algorithm, for RFID tag identification process. Our analysis indicates that the appropriate frame size for a given number of competing tags should not be set to the same value as the number of tags, which is commonly adopted in the literature. Instead, the frame size should be smaller roughly by a factor of 0.871 to maximize system efficiency. The closed-form for calculating system efficiency is derived and the derived simulation results are in a good agreement with the theoretical one. The exact appropriate frame sizes for the number of tags ranging from 2 to 100 are tabulated and compare the tag-identification time of conventional binary tree and ODT algorithms by using the international standard ISO 18000-6B.
Authors who publish with Engineering Journal agree to transfer all copyright rights in and to the above work to the Engineering Journal (EJ)'s Editorial Board so that EJ's Editorial Board shall have the right to publish the work for nonprofit use in any media or form. In return, authors retain: (1) all proprietary rights other than copyright; (2) re-use of all or part of the above paper in their other work; (3) right to reproduce or authorize others to reproduce the above paper for authors' personal use or for company use if the source and EJ's copyright notice is indicated, and if the reproduction is not made for the purpose of sale.