New adaptive RFID anti-collision algorithm based on collision-tree

Abstract

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.