Novel Dynamic Framed-Slotted ALOHA Using Litmus Slots in RFID Systems

Dynamic Framed Slotted ALOHA (DFSA) is one of the most popular protocols to resolve tag collisions in RFID systems. In DFSA, it is widely known that the optimal performance is achieved when the frame size is equal to the number of tags. So, a reader dynamically adjusts the next frame size according to the current number of tags. Thus it is important to estimate the number of tags exactly. In this paper, we propose a novel tag estimation and identification method using litmus (test) slots for DFSA. We compare the performance of the proposed method with those of existing methods by analysis. We conduct simulations and show that our scheme improves the speed of tag identification.

[1]  F. Schoute,et al.  Dynamic Frame Length ALOHA , 1983, IEEE Trans. Commun..

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

[3]  Yuping Zhao,et al.  A Novel Anti-Collision Algorithm with Dynamic Tag Number Estimation for RFID Systems , 2006, 2006 International Conference on Communication Technology.

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

[5]  Bob Metcalfe,et al.  Steady-state analysis of a slotted and controlled Aloha system with blocking , 1975, CCRV.

[6]  Dariush Divsalar,et al.  Some interesting observations for certain line codes with application to RFID , 2006, IEEE Transactions on Communications.

[7]  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.

[8]  F. De Flaviis,et al.  RF Identification (RFID) Reader Front Ends With Active Blocker Rejection , 2009, IEEE Transactions on Microwave Theory and Techniques.

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

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

[11]  Yanghee Choi,et al.  A Hybrid Query Tree Protocol for Tag Collision Arbitration in RFID systems , 2007, 2007 IEEE International Conference on Communications.

[12]  Jae-Hyun Kim,et al.  Novel Anti-collision Algorithms for Fast Object Identification in RFID System , 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).

[13]  Wonjun Lee,et al.  An Adaptive Memoryless Tag Anti-Collision Protocol for RFID Networks * , 2005 .

[14]  Roy Want,et al.  An introduction to RFID technology , 2006, IEEE Pervasive Computing.

[15]  Doug Young Suh,et al.  Improved Anti-collision Scheme for High Speed Identification in RFID System , 2006, First International Conference on Innovative Computing, Information and Control - Volume I (ICICIC'06).

[16]  Kwan-Wu Chin,et al.  An Investigation into thie Energy Eficiency of Pure and Slotted Aloha Based REID Anti-Collision Protocols , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[17]  Harald Vogt,et al.  Efficient Object Identification with Passive RFID Tags , 2002, Pervasive.

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

[19]  Hyoung-Nam Kim,et al.  Collision Arbitration Based on Different Slot Times for Slotted-Aloha RFID Systems , 2008, IEICE Trans. Commun..