Implementation and performance evaluation of an active RFID system for fast tag collection
Computer Communications
On the energy consumption of Pure and Slotted Aloha based RFID anti-collision protocols
Computer Communications
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
A fast RFID tag identification algorithm based on counter and stack
Expert Systems with Applications: An International Journal
A Review of Tags Anti-collision and Localization Protocols in RFID Networks
Journal of Medical Systems
A power control technique for anti-collision schemes in RFID systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
This paper presents an efficient anticollision algorithm for the RFID tags communication conflict. The novelty of our algorithm is that we map a set of n tags into a corresponding IDbinary tree, and see the process of collision arbitration as a process of building the ID-binary tree. In order to efficiently construct an ID-binary tree, the reader uses a stack to store the threads of the construction information, and while the tag uses a counter to keep track of the stack position where the tag is on. Theoretic results in both the number of queries sent by the reader and the tags communication complexity are derived to demonstrate the efficiency of our algorithm.