Performances comparison of RFID anti-collision algorithms
Mohamed Aissa Kalache, Lamya Fergani
Abstract
Mohamed Aissa Kalache, Lamya Fergani
Abstract
In RFID systems, one of the problems that we must solve is the collision between tags which lowers their efficiency. Two main approaches to tag collision are generally adopted: ALOHA and Tree algorithms. This paper reviews several existing anti-collision algorithms and compares their performances through different simulation experiments.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In RFID systems, one of the problems that we must solve is the collision between tags which lowers their efficiency. Two main approaches to tag collision are generally adopted: ALOHA and Tree algorithms. This paper reviews several existing anti-collision algorithms and compares their performances through different simulation experiments.
Key concepts: Aloha, Collision, Computer science, Algorithm, Tree (set theory), Collision detection, Collision avoidance, Throughput