Anti-Collision Algorithm Based on Binary Tree in RFID
Teng Pei-jun · Communications technology · 2009
It is one of the key problems in RFID that how to identify multi-tags quickly and efficiently,that is,the anti-collision problem. Based on study of Query Tree Algorithm and its performance,this paper proposes an improved Query Tree Algorithm—Collision Tracking Tree Algorithm. Finally,experimented example and analysis indicate that the proposed algorithm improves the performance both in time complexity and communication complexity.