分析了密集标签环境下几种传统的RFID标签防冲突算法的识别总耗时、系统吞吐率、读写器发送数据量和单标签发送数据量等主要性能指标,并依此提出了一种对传统ALOHA算法的改进算法,其系统吞吐率达到0.41左右,读写器发送数据量和单标签发送数据量与树形算法相比均减少了一半以上,最后指出了下一步的研究方向。
This paper firstly analyses the performances of several RFID anti-collision algorithms under the environment of dense tags. The performances discussed include total time consumed, system efficiency, total bits transmitted by the reader and average bits sent by each tag and so on. Then a novel improved algorithm based on ALOHA algorithms is present. The new algorithm has high system efficiency around 0. 41 and less amount of data transmitted which is decreased by 50 percent at least compared with tree-based algorithms. Lastly, conclusions are made and directions of further work are given.