RFID Multi-tags Anti-collision Algorithm With Adaptive Q Leading To the Maximum Throughput
Multi-tags anti-collision is a hard-nut problem in RFID application system. By analyzing the random time-slot algorithm and the required parameters and commands, we conclude that the number of time slots is determined by the value of Q. The more the number of time slots is, the less the collision occurs, but the longer the time is needed for identifying the tags. So choosing an appropriate value of Q can achieve a trade-off between identification time and the number of time slots. After analyzing the shortcomings of the random time-slot algorithm, an algorithm with adaptive Q leading to the maximum throughput is proposed which optimizes the relationship between the number of tags and the number of time slots and makes the throughput approach the maximum value of 0.368. The simulation shows that when the number of tags reaches 1,000, the number of time slots reduces by 61.0％.
Multi-tags RFID time slots anti-collisions adaptive algorithm maximum throughput
Huifang Deng Jinqiao Liu Chunhui Deng Xinyan Tang
School of Computer Science and Engineering South China University of Technology University Town, 510 School of Software Engineering South China University of Technology University Town, 510006 Guangzho Department of Computer Engineering Guangzhou Auto College South China University of Technology No.1
国际会议
桂林
英文
166-169
2010-11-17（万方平台首次上网日期，不代表论文的发表时间）