ScholarLens Back to search
2011•Microelectronics & ComputerRequires access

Skip Binary Tree Search Algorithm and its Analysis of Anti-collision

Jiao Ting-ting

Open publisher page 0 citations

Abstract

Proposed jump binary tree search anti-collision algorithm based on the introduction of the anti-collision algorithm in RFID system.LIFO stack by setting the full use of the collision node information to enable them to quickly and effectively identify RFID tags.Through its analysis,the efficiency of the algorithm can reach 50%.

About this research paper

What this paper is about

Proposed jump binary tree search anti-collision algorithm based on the introduction of the anti-collision algorithm in RFID system.LIFO stack by setting the full use of the collision node information to enable them to quickly and effectively identify RFID tags.Through its analysis,the efficiency of the algorithm can reach 50%.

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

Proposed jump binary tree search anti-collision algorithm based on the introduction of the anti-collision algorithm in RFID system.LIFO stack by setting the full use of the collision node information to enable them to quickly and effectively identify RFID tags.Through its analysis,the efficiency of the algorithm can reach 50%.

Key concepts: Computer science, Collision, Binary search tree, Binary tree, Binary search algorithm, FIFO and LIFO accounting, Algorithm, Node (physics)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source