A Fast Algorithm for Anti-Collision in RFID System

Abstract:

This paper proposes a fast query tree-based (FQT) algorithm for anti-collision in RFID system. Tags to be identified would be grouped by a reader randomly at beginning, and the reader identifies a group of tags and records the quantity of tags. Then reckons the number of all tags and carries out optimized group again. In identification process, the prefix of queries would add two bits in odd rounds, and one bit in even rounds. The results of analysis and simulation show that FQT algorithm can obtain the better performance than QT algorithm.

• Periodical: Advanced Materials Research (Volumes 791-793)
• Pages: 1149-1152
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.791-793.1149
• Online since: September 2013
• Authors: Chun Yu Di, Zhi Hong Qian, Mo Lin Wang, Qian Li, Shuang Zhu
• Keywords: Even, FAST, Group, Odd, Query

References

[1] M. A. Bonuccelli, F. martelli and S. Pelagatti, Tree slotted aloha: a new protocol for tag identification in RFID networks [A], in 2006 International Symposium on a World of Wireless Mobile and Multimedia Networks, 2006, pp.603-608.

DOI: 10.1109/wowmom.2006.112

[2] Li Meng, Qian Zhi-hong, et al. Slot-predicting based ALOHA algorithm for RFID anti-collision [J], Journal on Communications. 2011, pp.43-50.

[3] Wang Xue, Qian Zhi-hong, et al, Research on RFID anti-collision algorithms based on binary tree [J], Journal on Communications, 2010, pp.49-57.

[4] C. Law, K. Lee and K.Y. Siu, Efficient memory-less protocol for tag identification, in Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Boston, Massachusetts, USA, 2000, pp.75-84.

DOI: 10.1145/345848.345865

[5] Peng jiahou and Tang Minghao, Research of anti-collision algorithm for radio frequency identification technology, Electronic measurement technology, 2011, pp.43-47.