Implementation of RFID HF Reader for Detecting of Multi–Tag Reader Using Anti-collision Algorithm Based on Binary Tree

The development of modern technology like today, everything is demanded to be practical and fast. The Internet of Things can help identify, locate, track, monitor objects and trigger related events automatically and in real time. Radio Frequency Identification (RFID) implementation is the best choice for document/goods identifiers. The problem that arises is that the High Frequency (HF) RFID type is only able to identify one tag. In this paper, it is proposed to implement an algorithm to identify more than one tag. The proposed method is an anti-collision algorithm. The type of anti-collision used in this study is Binary Tree. The binary search algorithm works by checking the number of conflicting bits, and if there are many conflicting bits, the reader cannot accurately determine all the tags without communicating with them. The distance radius for identifying tags in the implementation of the anti-collision algorithm is also proposed to be increased in terms of the number of tags detected and the sensor reading distance but has some limitations. The results obtained, a lot of data that can be identified is 2 tags with a maximum distance of 2 cm without aluminum foil. Second, the maximum distance that can be achieved by the RFID HF Reader with the addition of aluminum foil is 7.5 cm, it can detect 2 tags at once.