Group coding of RF tags

RFID, radio frequency identification, is an automatic identification technology which identifies individual physical objects according to the unique IDs recorded by the RF tags attached on these objects. On the other hand, real-space objects often form a group. With RFID, we want to not only identify individual objects but also verify the integrity of the group of objects. In existing RFID systems, this “group verification” is done by looking up the list of grouped objects after the individual identification. This method requires some network connectivity to share the list of grouped objects and cannot be applied in the off-line environment. Against this problem, this thesis proposes the “group coding” of RF tags, which can check the integrity of the group in the off-line environment with writing the group related information into the memory of grouped RF tags. In addition, when some RF tags are missing from the group, the group coding can determine the information of RF tags missing from the group, the number of missing RF tags or the unique IDs of missing RF tags. Numerical simulation reveals that the determination of the number of missing RF tags can be done against 10 RF tags out of 20 RF tags within 0.5% error rate with writing 96-bit group related information into each RF tag’s memory. It is also revealed that the determination of the unique IDs can be done against 64 missing RF tags out of 100 within 0.5% error rate with writing 840-bit group related information into each RF tag’s memory. The validity of the theory and the numerical simulation is confirmed by the experimental evaluation using the implementation of the group coding on the commercial UHF-band RFID interrogator.

[1]  Selwyn Piramuthu,et al.  On Existence Proofs for Multiple RFID Tags , 2006, 2006 ACS/IEEE International Conference on Pervasive Services.

[2]  Tenkasi V. Ramabadran,et al.  A tutorial on CRC computations , 1988, IEEE Micro.

[3]  Joong Bum Rhim,et al.  Fountain Codes , 2010 .

[4]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[5]  V. Potdar,et al.  Improving RFID Read Rate Reliability by a Systematic Error Detection Approach , 2007, 2007 1st Annual RFID Eurasia.

[6]  Chih-Chung Lin,et al.  Coexistence Proof Using Chain of Timestamps for Multiple RFID Tags , 2007, APWeb/WAIM Workshops.

[7]  Michael Mitzenmacher,et al.  A digital fountain approach to asynchronous reliable multicast , 2002, IEEE J. Sel. Areas Commun..

[8]  Ari Juels,et al.  "Yoking-proofs" for RFID tags , 2004, IEEE Annual Conference on Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second.

[9]  Kouichi Sakurai,et al.  Grouping proof for RFID tags , 2005, 19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers).

[10]  Jung-Hui Chiu,et al.  Reading order independent grouping proof for RFID tags , 2008, 2008 IEEE International Conference on Intelligence and Security Informatics.

[11]  Leonid Bolotnyy,et al.  Generalized "Yoking-Proofs" for a Group of RFID Tags , 2006, 2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services.

[12]  Sozo Inoue,et al.  Systematic error detection for RFID reliability , 2006, First International Conference on Availability, Reliability and Security (ARES'06).

[13]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..