ScholarLens Back to search
2010•Unpublished venueRequires access

An enhanced dynamic binary anti-collision algorithm

Zhang Chen, Minghong Liao

Open publisher page 1 citations

Abstract

On the base of dynamic binary search algorithm(DBS), an enhanced dynamic binary anti-collision algorithm for radio frequency identification(RFID) is presented in this paper. With the method of recording collision positions and setting collision bits'value in the responded identification code of tags, the proposed algorithm can improve identification efficiency significantly. Compared with the binary-tree search algorithm(BS) and dynamic binary search algorithm, the proposed algorithm is superior to the previous two algorithms when simultaneously treated multiple RFID tags. With the proposed algorithm, reader requires Inquirer N/2 +1 times and the average number of queries is one when identifies of N tags. And use mathematical induction to prove.

About this research paper

What this paper is about

On the base of dynamic binary search algorithm(DBS), an enhanced dynamic binary anti-collision algorithm for radio frequency identification(RFID) is presented in this paper. With the method of recording collision positions and setting collision bits'value in the responded identification code of tags, the proposed algorithm can improve identification efficiency significantly. Compared with the binary-tree search algorithm(BS) and dynamic binary search algorithm, the proposed algorithm is superior to the previous two algorithms when simultaneously treated multiple RFID tags. With the proposed algorithm, reader requires Inquirer N/2 +1 times and the average number of queries is one when identifies of N tags. And use mathematical induction to prove.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

On the base of dynamic binary search algorithm(DBS), an enhanced dynamic binary anti-collision algorithm for radio frequency identification(RFID) is presented in this paper. With the method of recording collision positions and setting collision bits'value in the responded identification code of tags, the proposed algorithm can improve identification efficiency significantly. Compared with the binary-tree search algorithm(BS) and dynamic binary search algorithm, the proposed algorithm is superior to the previous two algorithms when simultaneously treated multiple RFID tags. With the proposed algorithm, reader requires Inquirer N/2 +1 times and the average number of queries is one when identifies of N tags. And use mathematical induction to prove.

Key concepts: Binary search algorithm, Algorithm, Binary number, Collision, Computer science, Binary tree, Identification (biology), Code (set theory)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
An enhanced dynamic binary anti-collision algorithm — Research Paper | ScholarLens