计算机科学
鉴定(生物学)
协议(科学)
碰撞
树(集合论)
过程(计算)
频道(广播)
射频识别
计算机网络
无线
二叉树
实时计算
计算机安全
电信
算法
医学
数学分析
替代医学
数学
病理
操作系统
植物
生物
作者
Jihoon Myung,Wonjun Lee,Jaideep Srivastava,Timothy K. Shih
出处
期刊:IEEE Transactions on Parallel and Distributed Systems
[Institute of Electrical and Electronics Engineers]
日期:2007-06-01
卷期号:18 (6): 763-775
被引量:181
标识
DOI:10.1109/tpds.2007.1098
摘要
Tag identification is an important tool in RFID systems with applications for monitoring and tracking. A RFID reader recognizes tags through communication over a shared wireless channel. When multiple tags transmit their IDs simultaneously, the tag-to-reader signals collide and this collision disturbs a reader's identification process. Therefore, tag collision arbitration for passive tags is a significant issue for fast identification. This paper presents two adaptive tag anticollision protocols: an adaptive query splitting protocol (AQS), which is an improvement on the query tree protocol, and an adaptive binary splitting protocol (ABS), which is based on the binary tree protocol and is a de facto standard for RFID anticollision protocols. To reduce collisions and identify tags efficiently, adaptive tag anticollision protocols use information obtained from the last process of tag identification. Our performance evaluation shows that AQS and ABS outperform other tree-based tag anticollision protocols
科研通智能强力驱动
Strongly Powered by AbleSci AI