An Improved Algorithm for Multi-Tag Anti-Collision in RFID System
Yan Ru Zhao, Wei Li Miao
Abstract
Yan Ru Zhao, Wei Li Miao
Abstract
With the development of Radio Frequency Identification (RFID) technology, it also exposed some problems in practical applications. Especially in multi-tag anti-collision problem, how to quickly identify multiple tags in the scope of the reader has become the key to solve the problem. On the basis of the Binary Search Algorithm (BSA) and Dynamic Binary Search Algorithm (DBSA), the paper proposed an Improved Dynamic Binary Search Algorithm. The simulation result proves that the improved method in multi-tag anti-collision is more efficiency than the previous two, which is a good solution to the shortcomings of the first two algorithms.
OpenAlex reports 1 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.
With the development of Radio Frequency Identification (RFID) technology, it also exposed some problems in practical applications. Especially in multi-tag anti-collision problem, how to quickly identify multiple tags in the scope of the reader has become the key to solve the problem. On the basis of the Binary Search Algorithm (BSA) and Dynamic Binary Search Algorithm (DBSA), the paper proposed an Improved Dynamic Binary Search Algorithm. The simulation result proves that the improved method in multi-tag anti-collision is more efficiency than the previous two, which is a good solution to the shortcomings of the first two algorithms.
Key concepts: Key (lock), Radio-frequency identification, Computer science, Binary number, Collision, Scope (computer science), Binary search algorithm, Identification (biology)