A Collecting Collision Tree Protocol for RFID Tag Identification with Capture Effect

Multitag identification is one of the main advantages of the radio frequency identification (RFID) system. In the RFID system, the capture effect often happens in the real environment. When the capture effect occurs, the reader will not completely identify the tags in its scope. In many RFID applications, to get the real-time number of tags, the reader identifies the tags repeatedly. In these cases, the tag in the reader's scope is a staying tag or an arriving tag. The reader already stores the IDs of all staying tags, so it can just verify the existence of these tags to rapidly identify them. As a result, the reader can spend the main time in recognizing arriving tags. To cope with the capture effect and identify staying tags rapidly, this paper presents a collecting collision tree protocol for RFID tag identification with capture effect (CCT). In CCT, a collecting mechanism is adopted and a lot of staying tags can be recognized in a slot. What is more, the reader can identify all tags in its range when the capture effect happens. Finally, various analysis and simulation results show that CCT outperforms the existing algorithms significantly.

[1]  Jaehyuk Choi,et al.  MRCT: An Efficient Tag Identification Protocol in RFID Systems with Capture Effect , 2013, KSII Trans. Internet Inf. Syst..

[2]  Bo Li,et al.  Efficient Anti-Collision Algorithm Utilizing the Capture Effect for ISO 18000-6C RFID Protocol , 2011, IEEE Communications Letters.

[3]  Klaus Finkenzeller,et al.  Rfid Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification , 2003 .

[4]  Kai-Yeung Siu,et al.  Efficient memoryless protocol for tag identification (extended abstract) , 2000, DIALM '00.

[5]  Wen-Tzu Chen,et al.  A Feasible and Easy-to-Implement Anticollision Algorithm for the EPCglobal UHF Class-1 Generation-2 RFID Protocol , 2014, IEEE Transactions on Automation Science and Engineering.

[6]  Francesco Martinelli,et al.  Mobile Robot Localization Using the Phase of Passive UHF RFID Signals , 2014, IEEE Transactions on Industrial Electronics.

[7]  Chih-Chung Lin,et al.  A Pair-Resolution Blocking Algorithm on Adaptive Binary Splitting for RFID Tag Identification , 2008, IEEE Communications Letters.

[8]  Klaus Finkenzeller,et al.  RFID Handbook: Radio-Frequency Identification Fundamentals and Applications , 2000 .

[9]  Kai-Yeung Siu,et al.  MIT-AUTOID-TR-003 Ecient Memoryless Protocol for Tag Identication , 2000 .

[10]  Roy H. Campbell,et al.  Using Generalized Query Tree to Cope with the Capture Effect in RFID Singulation , 2009, 2009 6th IEEE Consumer Communications and Networking Conference.

[11]  Jaideep Srivastava,et al.  Tag-Splitting: Adaptive Collision Arbitration Protocols for RFID Tag Identification , 2007, IEEE Transactions on Parallel and Distributed Systems.

[12]  Chenming Zhou,et al.  Accurate Phase-Based Ranging Measurements for Backscatter RFID Tags , 2012, IEEE Antennas and Wireless Propagation Letters.

[13]  Xi Yang,et al.  Capture-Aware Estimation for the Number of RFID Tags with Lower Complexity , 2013, IEEE Communications Letters.

[14]  Yuan-Cheng Lai,et al.  General binary tree protocol for coping with the capture effect in RFID tag identification , 2010, IEEE Communications Letters.

[15]  Klaus Finkenzeller,et al.  Book Reviews: RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification, 2nd ed. , 2004, ACM Queue.

[16]  Jung-Shian Li,et al.  An Efficient Time-Bound Collision Prevention Scheme for RFID Re-Entering Tags , 2013, IEEE Transactions on Mobile Computing.

[17]  Hongyi Wu,et al.  Smart Trend-Traversal Protocol for RFID Tag Arbitration , 2011, IEEE Transactions on Wireless Communications.

[18]  Quanyuan Feng,et al.  An Efficient Anti-Collision Protocol for RFID Tag Identification , 2010, IEEE Communications Letters.

[19]  Chih-Chung Lin,et al.  Two blocking algorithms on adaptive binary splitting: single and pair resolutions for RFID tag identification , 2009, TNET.