Improvement on RFID-based Binary Anti-collision Algorithm

This paper presents an enhanced jumping and dynamic searching anti-collision algorithm based on dynamic binary anti-collision algorithm and backtracking binary-tree search anti-collision algorithm in order to solve the problem of multi-tag collision in RFID systems. This algorithm also introduces three states for RFID tag to reduce the unnecessary tag response such as sleep, inactive, and active. By simulation, the enhanced jumping and dynamic algorithm has greatly improved the numbers of inquiries and communication traffic, thereby extends the life cycle of the RFID tag.