文章基本信息

标题：An Optimized Query Tree Algorithm in RFID Inventory Tracking - A Case Study Evidence
本地全文：下载
作者：Tanvi Agrawal ; P.K.Biswas
期刊名称：International Journal of Computer Science Issues
印刷版ISSN：1694-0784
电子版ISSN：1694-0814
出版年度：2012
卷号：9
期号：4
出版社：IJCSI Press
摘要：One of the challenged technical issue faced in inventory tracking applications with Radio frequency identification(RFID) implementation environment, is the collisions due to responses from multiple tags on the shared channel between reader and the tags, which consumes further the energy as well as the delay in tag identification process. To avoid collisions by some anti-collision algorithm means, may create large amount of data, adding complexity at the circuit level and also consumes energy for on-going transmissions. Therefore an optimized anti-collision algorithm can be designed to avoid the collisions with minimal amount of data transmissions for lowering the communication overhead as it is critical for wireless battery operated devices. In this paper author has proposed an optimized query tree anti-collision algorithm. It uses minimal number of bits to resolve the collision issue by making groups and solving collisions group by group by utilizing the same query sent by reader in the very first round.
关键词：Query Tree Algorithm; Inventory Tracking; Radio Frequency Identification (RFID)