摘要
防碰撞算法是射频识别(RFID)系统中提高识别效率的关键技术。在对二进制搜索算法及其各种改进算法分析的基础上,提出了基于冲突树的标签自适应防碰撞算法(ACT)。算法首先判定标签反馈信息冲突位,然后把首个冲突位作为冲突树的新节点,也就是标签分组的依据,合理利用堆栈和后退索引技术,把首尾冲突当做进一步搜索的条件。Matlab仿真结果表明该算法的有效性。ACT算法通过去除空时隙,减少重复信息,降低了识别通信量,提高了标签识别速度,适用于标签数量多、标签信息长度较长的RFID应用环境。
Anti-collision algorithm was a key technique to improve identification efficiency in Radio Frequency IDentification（RFID） System.The elementary binary search algorithm and some improved algorithms were analyzed,and an adaptive anti-collision algorithm based on collision-tree（ACT） was proposed.In this algorithm,reader detected collision in the feedback information of tags,and then used the first collision bit as a new node of the collision tree to group the tags.Then reader made use of stack and regressive index technology,and took the beginning and the end collision bit as the parameters of next request.The Matlab simulation results show that the proposed algorithm is effective.This algorithm can wipe off empty timeslot,reduce repetitive information and the number of bits transferred for identifying,especially fit the environment which contains large quantity of tags and tags with long information in RFID system.
出处
《计算机应用》
CSCD
北大核心
2010年第7期1728-1730,1735,共4页
journal of Computer Applications
关键词
射频识别
防碰撞
冲突树
自适应
堆栈
Radio Frequency IDentification（RFID）
anti-collision
collision-tree
adaptive
stack
