ScholarLens Back to search
2009•Communications technologyRequires access

Anti-Collision Algorithm Based on Binary Tree in RFID

Teng Pei-jun

Open publisher page 0 citations

Abstract

It is one of the key problems in RFID that how to identify multi-tags quickly and efficiently,that is,the anti-collision problem. Based on study of Query Tree Algorithm and its performance,this paper proposes an improved Query Tree Algorithm—Collision Tracking Tree Algorithm. Finally,experimented example and analysis indicate that the proposed algorithm improves the performance both in time complexity and communication complexity.

About this research paper

What this paper is about

It is one of the key problems in RFID that how to identify multi-tags quickly and efficiently,that is,the anti-collision problem. Based on study of Query Tree Algorithm and its performance,this paper proposes an improved Query Tree Algorithm—Collision Tracking Tree Algorithm. Finally,experimented example and analysis indicate that the proposed algorithm improves the performance both in time complexity and communication complexity.

Why it matters

A significance statement is not available in the OpenAlex record.

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

It is one of the key problems in RFID that how to identify multi-tags quickly and efficiently,that is,the anti-collision problem. Based on study of Query Tree Algorithm and its performance,this paper proposes an improved Query Tree Algorithm—Collision Tracking Tree Algorithm. Finally,experimented example and analysis indicate that the proposed algorithm improves the performance both in time complexity and communication complexity.

Key concepts: Computer science, Tree (set theory), Collision, Binary tree, Key (lock), Algorithm, Collision problem, Binary search algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Anti-Collision Algorithm Based on Binary Tree in RFID — Research Paper | ScholarLens