关键词: 射频识别, 防冲突, 二进制搜索树, 堆栈

Abstract: In order to avoid the problem of the tag collision in a Radio Frequency Identification（RFID） system，this paper proposes an Improved Binary Search Tree anti-collision algorithm based on Stack（IBSTS）.The bit collision detection is adopted in this algorithm，which effectively reduces the probabilities of collision.And the stack is also used，therefore the total times of identification are further reduced and the efficiency is improved.It can accurately determine where a collision arises，and only the data from collision bit is needed，then the transferred data is reduced.The simulation result shows that the proposed algorithm can significantly reduce the times of identification and the transferred，and the effect of performance improvement is more obvious when the system has a large amount of tags.

Key words: Radio Frequency Identification（RFID）, anti-collision, binary-tree search, stack