By Topic

A Biased Modified Binary Query Tree Protocol for RFID Tag Collision Resolution

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
$31 $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)
Xinqing Yan ; Sch. of Inf. Eng., North China Univ. of Water Resources & Electr. Power, Zhengzhou, China ; Yan Xu ; Bin Li

The last few years have witnessed the emergence of RFID system in a lot of application fields. However, a key issue that affects the universal deployments of the RFID system is the the tag collisions, which are caused by that multiple tags tries to transmit their digital identifiers through the air interface simultaneously. In this paper, a biased query tree protocol to resolve the collision occurred in the multiple access channel is proposed, and the performance of this protocol is well analyzed. Based on the discussion, a biased bi-slot binary query tree protocol for the efficient and complete resolution of memoryless RFID tags is presented. Numeric evaluations verify that this protocol performs a little better than the binary query tree and modified query tree protocols.

Published in:

Trust, Security and Privacy in Computing and Communications (TrustCom), 2011 IEEE 10th International Conference on

Date of Conference:

16-18 Nov. 2011