Efficient Privacy-Preserving Binary Tree Search

According to the issue of tag collision in the radio frequency identification technology, this paper proposes a binary tree search anti-collision algorithm, which takes different processing methods according to how many continuous collision. Compared with the dynamic binary tree search algorithm, the improved algorithm reduces the query information send by the reader. At the same time,the algorithm in the process of identifying tags reduces the query information, the query number and tag response times, so as to shorten the recognition time, further improve the search performance.

Download Full-text

Research on Anti-Collision of Personnel Positioning in Underground Coal Mine Based on RFID

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.380-384.1820 ◽

2013 ◽

Vol 380-384 ◽

pp. 1820-1823

Author(s):

Xiao Yue Liu ◽

Pei Lei Zhang

Keyword(s):

Coal Mine ◽

Binary Tree ◽

Search Algorithm ◽

Tracking System ◽

Tree Search ◽

Time And Space ◽

Underground Coal Mine ◽

Probability Of Collision ◽

Binary Tree Search ◽

Tree Search Algorithm

in order to avoid signal collision when two or more tags send recognizable signals to the reader of underground coal mine personnel tracking system , the binary tree search algorithm along with algorithms which improved from them is discussed, an adaptive anti-collision algorithm is proposed .In the respects of time and space the algorithm shows obvious advantages than the binary tree search algorithm ,so the probability of collision reduces greatly and the problem of collision maybe effectively solved.

Download Full-text

Efficient greedy estimation of mixture models through a binary tree search

Robotics and Autonomous Systems ◽

10.1016/j.robot.2014.05.016 ◽

2014 ◽

Vol 62 (10) ◽

pp. 1440-1452 ◽

Cited By ~ 6

Author(s):

Nicola Greggio ◽

Alexandre Bernardino ◽

Paolo Dario ◽

José Santos-Victor

Keyword(s):

Mixture Models ◽

Binary Tree ◽

Tree Search ◽

Binary Tree Search

Download Full-text

Binary tree search architecture for efficient implementation of round robin arbiters

2004 IEEE International Conference on Acoustics, Speech, and Signal Processing ◽

10.1109/icassp.2004.1327115 ◽

2004 ◽

Cited By ~ 4

Author(s):

C.E. Savin ◽

T. McSmythurs ◽

J. Czilli

Keyword(s):

Binary Tree ◽

Round Robin ◽

Efficient Implementation ◽

Tree Search ◽

Binary Tree Search

Download Full-text

An Anti-Collision Algorithm for Applications with Massive RFID Tags

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.756-759.4011 ◽

2013 ◽

Vol 756-759 ◽

pp. 4011-4015

Author(s):

Hang Zhang ◽

Jing Sha He

Keyword(s):

Radio Frequency Identification ◽

Binary Tree ◽

Search Algorithms ◽

Rfid Tags ◽

Tree Search ◽

Tag Identification ◽

Massive Scale ◽

Frequency Identification ◽

Massive Number ◽

Binary Tree Search

Anti-collision is a key technology in systems and applications in which Radio Frequency Identification (RFID) is used since it determines the efficiency of RFID tag identification. Although binary-tree search algorithms can effectively resolve collisions, they may not be very efficient in systems with a large number of RFID tags. In this paper, we propose a new flat-tree anti-collision algorithm and show that the proposed algorithm is more suitable for resolving collisions involving a massive number of RFID tags. Through analysis and experiment, we show that the flat-tree algorithm outperforms the binary-tree search algorithms when the number of RFID tags reaches a massive scale, i.e., exceeds a certain number.

Download Full-text

Segment Slot Partial Competitive Anti-Collision Algorithm for RFID System

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.148-149.753 ◽

2011 ◽

Vol 148-149 ◽

pp. 753-756

Author(s):

Zhen Yu Yang ◽

Juan Xing ◽

Xin Gang Wang

Keyword(s):

Radio Frequency ◽

Collision Avoidance ◽

Radio Frequency Identification ◽

Binary Tree ◽

Tree Search ◽

Simulation Experiments ◽

Rfid System ◽

Frequency Identification ◽

Simulation Results ◽

Binary Tree Search

Slot partial competitive (SPC) anti-collision algorithm is based on the ISO/IEC18000-6C UHF radio frequency identification (RFID) standard, which introduces dynamic binary tree search technology into the competitive collision avoidance mechanism. Moreover, the SPC algorithm applies the specific technologies to idle slots and collision slots. This paper proposes a segment slot partial competitive (SSPC) anti-collision algorithm based on the SPC, and introduce the segment algorithm. The performances of the dynamic binary tree search, the SPC algorithm and the SSPC algorithm are compared via simulation experiments. Simulation results indicate that the SSPC algorithm is improved significantly.

Download Full-text

A modified binary-tree search architecture for two-dimensional stack filtering

Signal Processing ◽

10.1016/s0165-1684(97)00091-1 ◽

1997 ◽

Vol 61 (1) ◽

pp. 45-63 ◽

Cited By ~ 1

Author(s):

C.Emanuel Savin ◽

M.Omair Ahmad ◽

M.N.S. Swamy

Keyword(s):

Binary Tree ◽

Tree Search ◽

Two Dimensional ◽

Binary Tree Search

Download Full-text