Paper Title:
Anti-Collision Algorithm for RFID Based on Dynamic Packet Query Tree
  Abstract

Based on the analysis of typical binary and dynamic binary search anti-collision algorithm in RFID system, this article proposes a fast and efficient anti-collision algorithm, that is, conduct dynamic packet on tags and adjust query instruction. The performance analysis and experiments show: this algorithm greatly reduces the tag identification time, and increases the identification efficiency of RFID system. At the same time, it reduces information exposure of tags when reader communicates with tags, and effectively decreases the collision probability of tags.

  Info
Periodical
Edited by
Dehuai Zeng
Pages
550-555
DOI
10.4028/www.scientific.net/AMR.159.550
Citation
M. S. Hu, G. N. Lv, "Anti-Collision Algorithm for RFID Based on Dynamic Packet Query Tree", Advanced Materials Research, Vol. 159, pp. 550-555, 2011
Online since
December 2010
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Rui Ping Chen, Zhong Xun Wang, Xin Qiao Yu
Abstract:Decoding algorithms with strong practical value not only have good decoding performance, but also have the computation complexity as low as...
458
Authors: Wei Rong Yang, Chang Hui Liu, Kao Shuai
Chapter 5: Electronics and Microelectronics, Embedded and Integrated Systems, Communications and Signal Processing, Power and Energy, Electric and Magnetic Systems
Abstract:In the actual operation by crane operator, there will appear situation that operator cannot make timely judgment on distance between crane...
1442