Improved binary search anti-collision algorithm in RFID system

Collision is a familiar problem in a Radio Frequency IDentification(RFID)system.How to solve this problem effectively is very vital to the whole RFID system.Binary search algorithm including anti-collision algorithm based on jumping and dynamic searching is a very important anti-collision algorithm to solve the collision problems.But the main disadvantage of any existing algorithm based on binary search algorithm is the rate of identifying the identification codes(IDs)of tags is low.In this paper,an improved anti-collision algorithm was proposed in order to solve this problem.By using this algorithm the number of request commands can be reduced greatly,meanwhile the message handling capacity can be improved.Simulation results show that an improvement of 29.85 percent can be achieved through this algorithm when the number of tags is 100.