Browse > Article

An Anti Collision Algorithm using Parity Mechanism in RFID Systems  

Kim, Sung-Soo (경북대학교 컴퓨터공학과)
Kim, Yong-Hwan (경북대학교 컴퓨터공학과)
Ahn, Kwang-Seon (경북대학교 컴퓨터공학과)
Publication Information
Journal of KIISE:Information Networking / v.36, no.5, 2009 , pp. 389-396 More about this Journal
Abstract
In RFID systems, identifying the tag attached to the subject begins with the request from a reader. When the reader sends a request, multiple tags in the reader's interrogation zone simultaneously respond to it, resulting in collision. The reader needs the anti collision algorithm which can quickly identify all the tags in the interrogation zone. We propose the Anti Collision Algorithm using Parity Mechanism(ACPM). In ACPM, a collision can be prevented because the tags which match with the prefix of the reader's request respond as followings; the group of tags with an even number of 1's in the bits to the prefix + 2nd bits responds in slot '0', while the group of tags with an odd number of 1's responds in slot '1'. The ACPM generates the request prefix so that the only existing tags according to the response in the corresponding slot. If there are two collided bits in tags, then reader identify tags by the parity mechanism. That is, it decreases the tag identification time by reducing the overall number of requests.
Keywords
RFID; Anti Collision; Slot; Parity Mechanism;
Citations & Related Records
연도 인용수 순위
  • Reference
1 P. H. Cole, "Fundamentals in RFID partl," Korean RFID course, 2006, Available: http://autoidlab. eleceng-.adelaide. edu. aul educa tion/FundamentalsIn RfidPartl.pdf
2 D. Shih, P.L. Sun, D.C.Yen and S. M.Huang, "Taxonomy and Survey of RFID Anti-collision protocols," Computer and communicatios, vol.29, pp.2150-2166, 2006   DOI   ScienceOn
3 S. Kim, Y. Kim, S. Lee, and KAhn, "An Improved Anti Collision Algorithm using Parity Bit in RFID System," Seventh IEEE Intemntional Symposium on Network Computing and Applications(NCA), pp.224-227, 2008
4 C. Law, K. Lee, and K. Y. Siu, "Efficient Memoryless protocol for Tag Identification," In Proceedings of the 4th intemntional workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM'OO), ACM, pp.75-84, 2000
5 T. Wang, "Enhanced binary search with cutthrough operation for anticollision in RFID systems," IEEE Commun. Lett., vol.10, no.4, pp. 236-238, Apr. 2006   DOI   ScienceOn
6 H. C. Kim, C. P. Hong, "RFlD/USN 기술 분석 및 전망," Joumnl of KICS, vol.21, no.6, pp.665-678, Jun. 2004. (in Korea)
7 D. W. Jang, P. D. Cho, "Analysis of Technical Regulations for Radio Frequency Identification," 전자통신동향분석, vol.18, no.6, Dec., 2003. (in Korea)
8 S. Kim and P. Park, "An efficient tree-based Tag Anti-collision protocol for RFID systems," IEEE Commun. Lett, vol.11, pp.449-451, May. 2007   DOI   ScienceOn
9 J. Eom, T. Lee, R. Rietman, and A. Yener, "An efficient framed-slotted ALOHA algorithm with pilot frame and binary selection for anti -collision of RFID tags," IEEE Commun. Lett., vol.l2, no.11, pp.861-863, Nov. 2008   DOI   ScienceOn
10 H. Lee, J. Kim, "QT-CBP: A New RFID Tag Anti-collision Algorithm Using Collision Bit Positioning," Emerging Directions in Embedded and Ubiquitous Computing(EUG'), LNCS, Springer vol.4097, pp.591-600, August, 2006   DOI
11 EPCglobai, EPCglobai Tag Data Standards Version 1.4, [Online]. Available: http://www.epcglobalinc. org /standards/tds/tds_1_4-standard-20080611.pdf
12 K. Finkenzeller, RFID Hand Book: Fundamentals and Applications in Contactless Smart Card and Identification, Second Edition, John Wiley & Sons Ltd, 2003