关键词: 指数索引, RFID, 反碰撞算法, 马尔可夫链

Abstract: The efficiency of stochastic ALOHA to solve tags collision is very low, and deterministic tree searching algorithm has the limitation that the number of the tags in the area doesn’t change. This algorithm gets over this disadvantage, According to the reader’s identifying result each time, the tags can modify their responsive probability in the incremental or degressive mode. Finally, its identifying efficiency can steadily attain 0.322 in the dynamic condition and a lot of tags simultaneously appearing. This article describes it by Markov chain. This article also analyses what value should be in the case that the identifying efficiency of this algorithm initially reaches the best and how much the changing range of the increase or decrease should be in the dynamic situation to make this algorithm more appropriate and efficient.

Key words: Exponential index, RFID, Anti-collision algorithm, Markov chain