Skip to Main Content
Collision is considered as one of the most important issues to be in mind in RFID system designing. Although, there are many algorithms that all of them are aiming - at the end - to decrease collision state numbers or to process such states that help achieve an accurate identification process in an acceptable period of time. In this paper, we intend to propose an algorithm offering balanced performance in general and excellent performance in environments with low or medium tags population. It gives the ability to reduce the number of collisions, in the first stage, and to identify tags that failed to be identified due to the occurred collisions, in the next stage. For illustration, we present simulation showing our algorithm performance against some commonly used algorithms.