Performance comparison of tree-based RFID anti-collision algorithms in large scale environments

Sammanfattning: Radio Frequency Identification is taking a larger and larger place in our everyday lives. As the use of RFID and the number of RFID-enabled items increase, the technology is more prone to identification collisions, which leads to difficulties using it. A handful of algorithms to avoid these issues already exist today, but no real comparison regarding their performance in large scale collisions have been done. This report focuses on tree-based algorithms and compares them to one another with the use of an implemented benchmark. A large amount of tests were completed, with a various and diverse size of input data. It was shown that algorithms with a dynamic backtracking structure or fixed loop implementations perform far better than others and are suitable for further development and implementation in large scale environments.