The Research Of The Binary Anti-collision Algorithm Based On RFID

The Research of the binary anti-collision algorithm based on RFIDRFID is a new automatic identification technology, which uses radio frequency communication technology, complete communication between electronic tag reader device and the communication, in order to achieve the object recognition. It does not need manpower to complete information transfer between electronic tag and reader, reduce the use of human resources, reduce the error caused by human. Reduce investment, increase their profit margins. For this reason, RFID technology in industrial production is used more and more. In the electronic tag and reader communication process, because of the electronic tag collision, the reader can not read the information rightly, which increase the information flow between reader and tag, so that communication time is greatly lengthened, which is a serious impediment to the development and application of RFID. Tag anti-collision algorithm can solve the tag collision problem, increase the electronic tag reader's correct rate and reduce electronic tag's traffic, reduce communication time. RFID anti-collision algorithm can promote the development of RFID technology and promote its application in practice, it has theoretical and practical value in the development of RFID.ALOHA algorithm is a kind of algorithm based on probability, each tag immediately send data, if tags collision, electronic tag wait for some time, then send data again, it is uncertain, several ALOHA algorithm improved have not changed this situation, this shortcoming limit the use of ALOHA algorithmBinary search is different from ALOHA algorithm, it is a certain, because the binary search is widely used in RFID anti-collision algorithm. Every tag has its own unique ID. tags receive reader queries command, according to its own ID and its present state to determine whether the reader queries command to respond, reader receives response tags ID, through the IDs reader make sure the next queries command, until all the tags are recognized. Binary search has two obvious defects first reader send inquiry instruction and tags send response sent are complete label ID number, such communication will be much larger, especially when there are a lot of inquires, can make the system efficiency is low. If can only transmit a part of the ID will greatly improve the efficiency of system, reduce the time needed for communication. Secondly when no collisions occur, reader start to query from the root, wasted previously inquires the work done, if can from the front nodes record query command began inquires, rather than from the root node word, can make inquires much fewer. Aimed at the two problems, people put forward dynamic binary search and back type binary search,and Prancing dynamic tree that put the two improved algorithm together.Although based on binary search prancing dynamic tree need less communication amount and Inquires times, but transfer the ID before the highest collision bit still need a lot of work. If it can only transfer the highest collision bit and don't transfer the ID before the highest collision bit,it will reduce the communication amount and will greatly improve the efficiency of system. This article puts forward on algorithm which only need to transfer the highest collision bit.In the end of the article according to the needs of the wine production, designed a wine production system based on RFID, and completed the management system. In this system I use tags have no power. Reader can be handheld or fixed. Management is the main part of the production system, it has four parts. It has order, sales,production and warehouse four managements.Of course this article can only prove the improved binary search by simulation,whether can reduce the communication amount and inquires times more need more hard working.