Tuesday 23rd of April 2024
 

An Optimized Query Tree Algorithm in RFID Inventory Tracking - A Case Study Evidence


Tanvi Agrawal and P.K.Biswas

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.

Keywords: Query Tree Algorithm, Inventory Tracking, Radio Frequency Identification (RFID)

Download Full-Text


ABOUT THE AUTHORS

Tanvi Agrawal
Author did B.Tech in Electronics and M.Tech in VLSI and Currently working as a research Fellow in NITIE on enrgy efficient RFID algorithms.

P.K.Biswas
Author did B.Tech and M.Tech in Electronics andoperations management and presently working as an associate proffessor at NITIE.


IJCSI Published Papers Indexed By:

 

 

 

 
+++
About IJCSI

IJCSI is a refereed open access international journal for scientific papers dealing in all areas of computer science research...

Learn more »
Join Us
FAQs

Read the most frequently asked questions about IJCSI.

Frequently Asked Questions (FAQs) »
Get in touch

Phone: +230 911 5482
Email: info@ijcsi.org

More contact details »