A Novel RFID Anti-Collision Algorithm based on Binary Tree

Abstract

The method to deal with the tag collision in RFID system can be directly called “Multiple Access”. According to the ideas of these different anti-collision algorithms, they can be divided into two categories. One is the binary tree algorithm based on deterministic; the other is the statistical-based ALOHA algorithm. Overall, however, there is still room for improvement on anti-collision algorithm path optimization and communication complexity,. This paper focuses on binary tree algorithm. After analysis of the basic binary tree algorithm, dynamic binary tree algorithm, Trajan binary tree algorithm, paper propose a novel binary tree algorithm based on the dichotomy. Simulation performance shows that there have upgraded path optimization and communication efficiency