RFID Anti-collision Alorithms Research Base On Binary-tree

RFID Radio Frequency Identification has become the most useful Non Touching automatic identifying technique,which implement signal transmission and identification with RF signal and magnetic-coupling principle.In addition,It can be used to recognize and trace objects which need to cobtain RFID tag.RFID technology has been widely used in all kinds of field and obtained the remarkable results,but as a new application technology,there are still a number of shortcomings in RFID's applications,such as recognition accuracy is not high and RFID's standardization process is slow,One of the most important issues in RFID system is tag collision which affect tag recognition rates,so It is importment to design a correct and high-efficient algorithm,which has a vital role in the development of RFID's technology.In this paper,the principle of RFID technology,advantages and disadvantages of RFID technology and the RFID standards are introduced.Especially,This paper have done an in-depth research on the tag collision.The tag collision occurs when the Work areas of reader exists several tags in RFID SYStem,which can lead to tags cannot be identified.In order to resolve the tag collision problem,we need to use multiple access protocol.such as TDMA,FDMA,SDMA,and CDMA.At present,the most commonly used is TDMA in RFID Anti-collision Algorithms.The Binary tree algorithm and ALOHA algorithm are implemented based on TDMA,This paper analyzes its characteristics and shortcomings.This paper presents two anti collisi algorithms which are implemented based on TDMA.One is Improved Binary-tree Anti-collision Algorithm.The algorithm can reduce the searching range or reduce the number of tags which meet the requirement through optimizing tag search conditions,Based on this,we can reduce number of requests between reader and tag,and solve the problem of long time delay in Binary-tree Anti-collision Algorithm.The other is Bit Completed Algorithm which indify the tags through Boolean OR operation for bit-bi-bit priority competition.By comparison with Binary-tree Anti-collision Algorithm,this algorithm can reduce the number of tag collision,and reduce the number of requests from reader.The two algorithms are evaluated by simulation,and gives the corresponding experimental data.The experiment results shows that this two algorithms can effectively reduce the number of collisions,requests and the total amount of data reader.