Improvement of Dynamic Binary Search Algorithm used in RFID system

The collisions between tags is inevitable in the RFID system. How to identify the tags quickly and accurately when there are huge numbers of tags conflicting with each other is an important problem, which may affect the usage of the RFID system in the future. This paper studies several kinds of deterministic anti-collision algorithms which are widely used in today's RFID systems and analyses the drawbacks of them. Finally, it puts forward an improvement of these binary search algorithms, the Enhanced Dynamic Binary Search Algorithm. It also gives mathematical proof which shows that this algorithm works well when the system has many tags conflicting with each other.