Improvement and realization of anti-collision algorithm in RFID

In the RFID system,some effectual anti-collision algorithm must be used to avoid the data collision resulted from the data transaction between more tags and the reader at the same time.Aloha and binary tree algorithms is analyzed.As a result,a new anti-collision algorithm is put forward.The algorithm takes dynamic binary search algorithm and applies the obtained collision information,which reduces the data quantity and improves identification efficiency.The experimental results indicate that the anti-collision functions can be realized.