An Adaptive Multiple Branch Tree Algorithm in RFID

Ren Cai Zhao

doi:10.4028/www.scientific.net/AMM.543-547.2821

Paper Titles

Parallel Optimization of Geometric Correction Algorithm Based on CPU-GPU Hybrid Architecture
p.2804

A Generation Algorithm of DRR Based on GPU
p.2809

Pulse Wave Velocity System of Repeat Iterative Adaptive Algorithm for Smart Antenna
p.2813

Filtering Algorithm for Removing Image Impulse Noise
p.2817

An Adaptive Multiple Branch Tree Algorithm in RFID
p.2821

A Prediction Algorithm of Neural Network Applied in AMC Based on LTE System
p.2825

Multi-Frame Super-Resolution Reconstruction Algorithm Based on Diffusion Tensor Regularization Term
p.2828

The DSP Implementation of Algorithm for Voice Speed Changing and Pitch Shifting Based on TD-PSOLA
p.2833

Improved Adaptive α-β Filtering Algorithm
p.2838

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 543-547An Adaptive Multiple Branch Tree Algorithm in RFID

An Adaptive Multiple Branch Tree Algorithm in RFID

Abstract:

It is quite obvious that multi-branch tree search algorithm could be used for higher identification efficiency in RFID, however the branch number choosing depends on the accurate tag number estimation, which is not so easy to get and often cost much overhead. In this paper, we propose an adaptive multi-branch tree anti-collision algorithm. It begins with a simple initial tag number estimation, and then adaptively adjusts the branch groups afterwards. Simulation results indicate that the proposed algorithm can effectively correct the improper branch number and achieve much better performance than the conventional one.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 543-547)

Pages:

2821-2824

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.543-547.2821

Citation:

Cite this paper

Online since:

March 2014

Authors:

Ren Cai Zhao*

Keywords:

Anti-Collision, Multi-Branch Tree, RFID, Tag Number Estimation

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] K. Finkenzeller, RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification, 2nd ed. John wiley& Sons, March (2003).

DOI: 10.1145/1005062.1005077

Google Scholar

[2] V. Anatharam, The stability region of the finite-user slotted ALOHA protocol, IEEE Trans. Inform. Theory, vol. 37, no. 3, pp.535-540, May (1991).

DOI: 10.1109/18.79909

Google Scholar

[3] H. Vogt, Efficient object identification with passive RFID tags, in Proc. Int. Conf. Pervasive Computing, 2002, pp.98-113.

DOI: 10.1007/3-540-45866-2_9

Google Scholar

[4] F. C. Schoute, Dynamic frame length ALOHA, IEEE Trans. Commun., vol. 31, no. 4, p.565–568, Apr. (1983).

DOI: 10.1109/tcom.1983.1095854

Google Scholar

[5] Parameters for Air Interface Communications at 860 MHZ to 960 MHz Information Technology-Radio Frequency Identification for Item Management, 2005, ISO/IEC 18000-6, Part 6.

DOI: 10.3403/30165876

Google Scholar

[6] D. R. Hush and C. Wood, Analysis of tree algorithms for RFID arbitration, in Proc. IEEE Int. Symp. Information Theory, 1998, pp.107-107.

Google Scholar

[7] S.R. Lee, S.D. Joo, and C.W. Lee, An enhanced dynamic framed slotted ALOHA algorithm for RFID tag identification, in Proc. Inf. Mobile and Ubiquitous Systems: Networking and Services, 2005, pp.166-172.

DOI: 10.1109/mobiquitous.2005.13

Google Scholar

[8] M. A. Bonuccelli, F. Lonetti, and F. Martelli, Tree slotted aloha: a new protocal for tag identification in RFID networks, in Proc. Int. Symp. World of Wireless, Mobile and Multimedia Networks, 2006, pp.603-608.

DOI: 10.1109/wowmom.2006.112

Google Scholar

[9] Y. h. Cui; Y. p. Zhao, Performance Evaluation of a Multi-Branch Tree Algorithm in RFID,. IEEE Trans. on Communication, May 2010. Vol. 58, No. 5, pp.1356-1364.

DOI: 10.1109/tcomm.2010.05.080611

Google Scholar