ScholarLens Back to search
2018•Unpublished venueRequires access

A Low Complexity Anti-Collision Algorithm for RFID Using Query Tree

Fan Yang, Yong Yang, Hu Chen, Shougang Ren, Lei Zhao

Open publisher page 1 citations

Abstract

In order to further decrease the probability of the collision and reduce communication complexity, a new low complexity anti-collision algorithm for RFID is proposed using Query Tree. The proposed algorithm can reduce the probability of collision and the traffic of data communication by tag grouping and setting rules, respectively. The simulation results show that the proposed scheme consumes fewer slots and has lower communication complexity.

About this research paper

What this paper is about

In order to further decrease the probability of the collision and reduce communication complexity, a new low complexity anti-collision algorithm for RFID is proposed using Query Tree. The proposed algorithm can reduce the probability of collision and the traffic of data communication by tag grouping and setting rules, respectively. The simulation results show that the proposed scheme consumes fewer slots and has lower communication complexity.

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

In order to further decrease the probability of the collision and reduce communication complexity, a new low complexity anti-collision algorithm for RFID is proposed using Query Tree. The proposed algorithm can reduce the probability of collision and the traffic of data communication by tag grouping and setting rules, respectively. The simulation results show that the proposed scheme consumes fewer slots and has lower communication complexity.

Key concepts: Collision, Computer science, Tree (set theory), Communication complexity, Computational complexity theory, Algorithm, Scheme (mathematics), Theoretical computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Low Complexity Anti-Collision Algorithm for RFID Using Query Tree — Research Paper | ScholarLens