An dynamic anti-collision algorithm based on adaptive search matrix

An dynamic anti-collision algorithm based on adaptive search matrix is presented.Since readers which are using Manchester code in the RFID system can identify the position of collision bits,the novel anti-collision algorithm can get the information of collision,construct search matrix by certain rules and be able to search tag’s EPC sequence section by section.It adopts the mechanism of collision prefix query to obtain accurate sending prefix,makes the search matrix dynamic change and uses collision stack to adjust the search path adaptively.And it can also reduce collision timeslots,avoid the generation of idle timeslots and accelerate the tag identification process.Theory analysis and computer simulations show that the novel anti-collision algorithm overcomes the disadvantages of traditional anti-collision algorithms based on binary tree search.And it improves search efficiency,increases throughput of the system and has a certain degree of practicability.