An Anti-collision Algorithm of Similar-Binary-Search-Tree in RFID System and Its Practice
Bo Chen
Abstract
Bo Chen
Abstract
In order to relax the precisely synchronization between reader and tags and simple the RFID system design, this article introduces an anti-collision algorithm of Similar-Binary-Search-Tree based on Binary-Search-Tree. Moreover, the performance analysis shows that it satisfy actual application. Finally, it is put into software realization.
A significance statement is not available in the OpenAlex record.
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 order to relax the precisely synchronization between reader and tags and simple the RFID system design, this article introduces an anti-collision algorithm of Similar-Binary-Search-Tree based on Binary-Search-Tree. Moreover, the performance analysis shows that it satisfy actual application. Finally, it is put into software realization.
Key concepts: Binary tree, Binary search algorithm, Binary search tree, Computer science, Realization (probability), Synchronization (alternating current), Binary number, Tree (set theory)