Adaptive couple-resolution blocking protocol for repeated tag identification in RFID systems

RFID applications such as monitoring an object for a long time need to identify tags repeatedly within the scope of the reader. Re-identification process can be improved using the information obtained from the previous tag identification process. Couple-resolution blocking (CRB) protocol utilizes the blocking technique that prevents staying tags from being collided by newly arriving tags. Staying tags can be efficiently re-identified by utilizing the retained information. After staying tags are separately all identified, arriving tags are identified. In this paper, we argue that CRB may work more poorly than other protocols which do not consider the repeated tag identification, such as query tree (QT) and collision tree (CT) protocol, when only few tags stay. To tackle the problem, we propose an adaptive CRB (ACRB) protocol. In ACRB, the reader estimates the tag staying ratio during the re-identification process for staying tags. If the estimated ratio is lower than a certain threshold, the blocking technique is immediately abandoned. Instead, staying tags and arriving tags are identified together without considering the retained information. In addition, we propose to improve CRB further using CT protocol, instead of QT protocol. Through computer simulation, we show that ACRB improves the identification efficiency of CRB, especially when the tag staying ratio is low.

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

[2]  R. H. Myers,et al.  Probability and Statistics for Engineers and Scientists , 1978 .

[3]  Wonjun Lee,et al.  An Adaptive Memoryless Protocol for RFID Tag Collision Arbitration , 2006, IEEE Transactions on Multimedia.

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

[5]  Yvonne Schuhmacher,et al.  Rfid Handbook Fundamentals And Applications In Contactless Smart Cards And Identification , 2016 .

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

[7]  Jung-Shian Li,et al.  Hybrid Blocking Algorithm for Identification of Overlapping Staying Tags Between Multiple Neighboring Readers in RFID Systems , 2015, IEEE Sensors Journal.

[8]  D. R. Hush,et al.  Analysis of tree algorithms for RFID arbitration , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

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

[10]  Quanyuan Feng,et al.  Stability Analysis of an Efficient Anti-Collision Protocol for RFID Tag Identification , 2012, IEEE Transactions on Communications.

[11]  Chae-Woo Lee,et al.  An enhanced dynamic framed slotted ALOHA algorithm for RFID tag identification , 2005, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services.

[12]  Jaideep Srivastava,et al.  Adaptive binary splitting for efficient RFID tag anti-collision , 2006, IEEE Communications Letters.

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

[14]  Chih-Chung Lin,et al.  Two Couple-Resolution Blocking Protocols on Adaptive Query Splitting for RFID Tag Identification , 2012, IEEE Transactions on Mobile Computing.

[15]  Chih-Chung Lin,et al.  Two Blocking Algorithms on Adaptive Binary Splitting: Single and Pair Resolutions for RFID Tag Identification , 2009, IEEE/ACM Transactions on Networking.