Collision-Resilient Multi-State Query Tree Protocol for Fast RFID Tag Identification
暂无分享,去创建一个
[1] Charles J. Colbourn,et al. The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.
[2] 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).
[3] Jessica Staddon,et al. Combinatorial properties of frameproof and traceability codes , 2001, IEEE Trans. Inf. Theory.
[4] C. Colbourn,et al. The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.
[5] Douglas R. Stinson,et al. Secure frameproof codes, key distribution patterns, group testing algorithms and related structures , 2000 .
[6] Feng Zhou,et al. Evaluating and optimizing power consumption of anti-collision protocols for applications in RFID systems , 2004, Proceedings of the 2004 International Symposium on Low Power Electronics and Design (IEEE Cat. No.04TH8758).
[7] G. Clark,et al. Reference , 2008 .
[8] Harald Vogt,et al. Multiple object identification with passive RFID tags , 2002, IEEE International Conference on Systems, Man and Cybernetics.
[9] Wonjun Lee,et al. An Adaptive Memoryless Tag Anti-Collision Protocol for RFID Networks * , 2005 .
[10] Klaus Finkenzeller,et al. Book Reviews: RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification, 2nd ed. , 2004, ACM Queue.
[11] Wonjun Lee,et al. An Adaptive Memoryless Protocol for RFID Tag Collision Arbitration , 2006, IEEE Transactions on Multimedia.