Efficient memoryless protocol for tag identification (extended abstract)
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Efficient Object Identification with Passive RFID Tags
Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification
RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification
HiQ: A Hierarchical Q-Learning Algorithm to Solve the Reader Collision Problem
SAINT-W '06 Proceedings of the International Symposium on Applications on Internet Workshops
Adaptive binary splitting: a RFID tag collision arbitration protocol for tag identification
Mobile Networks and Applications
An Improved Anti Collision Algorithm using Parity Bit in RFID System
NCA '08 Proceedings of the 2008 Seventh IEEE International Symposium on Network Computing and Applications
Short survey: Taxonomy and survey of RFID anti-collision protocols
Computer Communications
An anti-collision algorithm using two-functioned estimation for RFID tags
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Tree algorithms for packet broadcast channels
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Tags have their own unique identifiers and information, and send such information to a reader; thereby the reader identifies the ID. The proposed algorithm predicts the tag ID by using the number of collided bits and the number of 1s in tag response signal. Even if tag collision occurs in the identification process, the reader identifies the RFID tag through prediction based on information provided by the extra bits. If the number of 1s to be included in collided bits is 1 or collided bits -1, the reader identifies tags as many as the number of collided bits.