Research On High Efficiency RFID Anti-collision Algorithm

With the widely used of the Internet technology,as the critical core of this technology,the Radio Frequency Identification technology(RFID)has been developed rapidly.RFID is a long-distance wireless automatic identification technology which can identify the object and transfer information by the way of electromagnetic wave transmission in the air.However,multi-targets recognition will lead to a collision problem when transmit data at the same time.So it is necessary to come up with a good anti-collision mechanism to reduce collision which is great significance for improving the performance of RFID systems.In RFID system,the collision will occur while a reader attempts to identify multiple tags at the same time,the anti-collision algorithm is necessary.For tag-collision problem of radio frequency identification system,a stable and efficient anti-collision protocol is very significant.In this paper,a new Bit-Conversion anti-collision Algorithm based on Slotted Binary Tree for RFID is proposed.First,we converted the original ID of the tag.Then,based on the different number of bits in different slots,the tag will respond to reader's request.By using Manchester code,the sent information of all the tags will be identified in much shorter time.Comparing with this other search algorithms,Mathematics analysis and simulation results show that the algorithm reduce the times of the reader's request and significantly improve recognition efficiency.The mainly innovation points of this paper are as:(1)In order to reduce the query times of reader,a new Bit-Conversion anti-collision Algorithm based on Slotted Binary Tree for RFID is proposed.The algorithm reduce the times of the reader's request and significantly improve recognition efficiency and the electronic of tag.The stack is introduced and the electronic tags which put the failing bit competition in stack.This algorithm can not only reduce the redundancy but also reduce the delay of transmission.In the process of improving efficiency of recognition and and system throughput,the label is set to respond in a certain time slot,the efficiency of the system can be improved double.This can effectively reduce the number of sending bits,so as to improve the efficiency of recognition and greatly increase the throughput of the system.A Bit-conversion Grouping Matching Algorithm is proposed,in which stack is used to store the collision information.Through this algorithm,we can reduce the total number of time slots and empty slots.Then,the query time is reduced,and also greatly improve the efficiency of the system.