An improved tree-based anticollision algorithm for RFID systems

Radio Frequency Identification RFID is increasingly used in various applications because of their high quality as well as their low costs, however there are some limitations that can hinder the proper functioning of this technology, for example, if several tags are located in the interrogation zone of the same reader, they might collide with each other during the process of identification and thus their time slots will be canceled, thereby causing a waste in slots. In this sense several algorithms have been proposed to solve the problem of collision. In this paper we propose an improved tree-based algorithm using Manchester coding. This improvement consists in building the query for searching the tags in a different way. Simulated results show that the proposed algorithm reduces the number of iterations required to identify a set of tags compared to other existing algorithms.