By Topic

OPT: Optimal Protocol Tree for Efficient Tag Identification in Dense RFID Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Girish Khandelwal ; Wireless Communications and Networking Laboratory, Electrical Engineering Department, The Pennsylvania State University, University Park, PA 16802. guk109@psu.edu ; Aylin Yener ; Min Chen

We propose a novel collision resolution scheme termed the Optimal Protocol Tree (OPT), which is based on the tree search algorithm for RFID systems. The basic principle of OPT relies on taking advantage of the similarities in the identification strings of different tags, having the reader prompt the tags to send only the mutually exclusive sub-portion of their identification strings. The aim of OPT is to significantly reduce the total identification time, in order to render the deployment of dense RFID systems feasible. Simulation results are presented to demonstrate the performance of OPT, and the considerable improvement it provides with respect to the existing tree search protocols.

Published in:

2006 IEEE International Conference on Communications  (Volume:1 )

Date of Conference:

June 2006