scholarly journals A Mobility Aware Binary Tree Algorithm to Resolve RFID Jam and Bottleneck Problems in a Next Generation Specimen Management System

Micromachines ◽  
2020 ◽  
Vol 11 (8) ◽  
pp. 755
Author(s):  
Yen-Hung Chen ◽  
Yen-An Chen ◽  
Shu-Rong Huang
Keyword(s):  
Radio Frequency Identification ◽  
Binary Tree ◽  
Arrival Rate ◽  
Tag Identification ◽  
Coverage Area ◽  
Tree Algorithm ◽  
Clinical Laboratories ◽  
Conveyor Belts ◽  
Time Required ◽  
Specimen Management

Hospitals are continuously working to reduce delayed analysis and specimen errors during transfers from testing stations to clinical laboratories. Radio-frequency identification (RFID) tags, which provide automated specimen labeling and tracking, have been proposed as a solution to specimen management that reduces human resource costs and analytic delays. Conventional RFID solutions, however, confront the problem of traffic jams and bottlenecks on the conveyor belts that connect testing stations with clinical laboratories. This mainly results from methods which assume that the arrival rate of specimens to laboratory RFID readers is fixed/stable, which is unsuitable and impractical in the real world. Previous RFID algorithms have attempted to minimize the time required for tag identification without taking the dynamic arrival rates of specimens into account. Therefore, we propose a novel RFID anti-collision algorithm called the Mobility Aware Binary Tree Algorithm (MABT), which can be used to improve the identification of dynamic tags within the reader’s coverage area and limited dwell time.

Pre-Split Anti-Collision Binary Tree Algorithm

2012 ◽  
Vol 220-223 ◽  
pp. 2403-2406
Author(s):  
Ying Hua Cui ◽  
Yu Ping Zhao ◽  
Hui Yang Wang ◽  
Jin He Zhou
Keyword(s):  
Binary Tree ◽  
Tag Identification ◽  
Tree Algorithm ◽  
Rfid System ◽  
Simulation Results ◽  
Modified Algorithm

In RFID system, reducing the frequency of collisions is very important for fast tag identification. In this paper, we proposed a pre-split anti-collision algorithm based on binary tree algorithm. The proposed scheme pre-splits the tags into different groups before the reader detects the first tag. Simulation results indicate that the modified algorithm can achieve much better performance than the conventional one.

An Anti-Collision Algorithm for Applications with Massive RFID Tags

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.

scholarly journals An Effective Scheduling-Based RFID Reader Collision Avoidance Model and Its Resource Allocation via Artificial Immune Network

2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Shanjin Wang ◽  
Zhonghua Li ◽  
Chunhui He ◽  
Jianming Li
Keyword(s):  
Resource Allocation ◽  
Collision Avoidance ◽  
Radio Frequency Identification ◽  
Immune Network ◽  
Artificial Immune ◽  
Tag Identification ◽  
Coverage Area ◽  
Identification Rate ◽  
Rfid Reader ◽  
Artificial Immune Network

Radio frequency identification, that is, RFID, is one of important technologies in Internet of Things. Reader collision does impair the tag identification efficiency of an RFID system. Many developed methods, for example, the scheduling-based series, that are used to avoid RFID reader collision, have been developed. For scheduling-based methods, communication resources, that is, time slots, channels, and power, are optimally assigned to readers. In this case, reader collision avoidance is equivalent to an optimization problem related to resource allocation. However, the existing methods neglect the overlap between the interrogation regions of readers, which reduces the tag identification rate (TIR). To resolve this shortage, this paper attempts to build a reader-to-reader collision avoidance model considering the interrogation region overlaps (R2RCAM-IRO). In addition, an artificial immune network for resource allocation (RA-IRO-aiNet) is designed to optimize the proposed model. For comparison, some comparative numerical simulations are arranged. The simulation results show that the proposed R2RCAM-IRO is an effective model where TIR is improved significantly. And especially in the application of reader-to-reader collision avoidance, the proposed RA-IRO-aiNet outperforms GA, opt-aiNet, and PSO in the total coverage area of readers.

scholarly journals REINFORCEMENT LEARNING BASED ANTI-COLLISION ALGORITHM FOR RFID SYSTEMS

2019 ◽  
pp. 155-168
Author(s):  
Murukesan Loganathan ◽  
Thennarasan Sabapathy ◽  
Mohamed Elobaid Elshaikh ◽  
Mohamed Nasrun Osman ◽  
Rosemizi Abd Rahim ◽  
...  
Keyword(s):  
Reinforcement Learning ◽  
Radio Frequency Identification ◽  
Energy Efficient ◽  
Current Standard ◽  
Tag Identification ◽  
Rfid Systems ◽  
Order Of Magnitude ◽  
Control Message ◽  
Frequency Identification ◽  
Better Than

Efficient collision arbitration protocol facilitates fast tag identification in radio frequency identification (RFID) systems. EPCGlobal-Class1-Generation2 (EPC-C1G2) protocol is the current standard for collision arbitration in commercial RFID systems. However, the main drawback of this protocol is that it requires excessive message exchanges between tags and the reader for its operation. This wastes energy of the already resource-constrained RFID readers. Hence, in this work, reinforcement learning based anti-collision protocol (RL-DFSA) is proposed to address the energy efficient collision arbitration problem in the RFID system. The proposed algorithm continuously learns and adapts to the changes in the environment by devising an optimal policy. The proposed RL-DFSA was evaluated through extensive simulations and compared with the variants of EPC-C1G2 algorithms that are currently being used in the commercial readers. Based on the results, it is concluded that RL-DFSA performs equal or better than EPC-C1G2 protocol in delay, throughput and time system efficiency when simulated for sparse and dense environments while requiring one order of magnitude lesser control message exchanges between the reader and the tags.

scholarly journals Path Planning of Anti ship Missile based on Voronoi Diagram and Binary Tree Algorithm

2019 ◽  
Vol 69 (4) ◽  
pp. 369-377
Author(s):  
Yan Shi ◽  
Lihua Zhang ◽  
Shouquan Dong
Keyword(s):  
Path Planning ◽  
Voronoi Diagram ◽  
Binary Tree ◽  
Dijkstra Algorithm ◽  
Tree Algorithm ◽  
Multiple Missiles ◽  
Intractable Problem ◽  
The Relationship

The path planning of anti-ship missile should be considered both cruising in safety and striking in quick, which is an intractable problem. In particular, it is difficult to consider the safety of each missile path in the path planning of multiple missiles. To solve this problem, the “AREA Algorithm” is presented to divide the relative relations of areas：relative security area of the threat areas and fast-attack area of target approaching. Specifically，it is a way to achieve area division through the relationship between the target and the center of the operational area. The Voronoi diagram topology network, Dijkstra algorithm and binary tree algorithm have been used in the above process as well. Finally, Simulations have verified the feasibility and obvious advantages of “AREA Algorithm” compared with the single algorithm, and the tactical meaning in path planning of multiple missiles.

Adaptive Framework for Collisions in RFID Tag Identification

2008 ◽  
Vol 07 (01) ◽  
pp. 9-14 ◽  
Author(s):  
Selwyn Piramuthu
Keyword(s):  
Supply Chain ◽  
Radio Frequency Identification ◽  
Rfid Tags ◽  
Tag Identification ◽  
Seamless Integration ◽  
Essential Information ◽  
Rfid Tag ◽  
Frequency Identification ◽  
Pass Through ◽  
Aloha Protocol

Radio Frequency Identification (RFID) is promising, as a technique, to enable tracking of essential information about objects as they pass through supply chains. Information thus tracked can be utilised to efficiently operate the supply chain. Effective management of the supply chain translates to huge competitive advantage for the firms involved. Among several issues that impede seamless integration of RFID tags in a supply chain, one of the problems encountered while reading RFID tags is that of collision, which occurs when multiple tags transmit data to the same receiver slot. Data loss due to collision necessitates re-transmission of lost data. We consider this problem when Framed Slotted ALOHA protocol is used. Using machine learning, we adaptively configure the number of slots per frame to reduce the number of collisions while improving throughput.

scholarly journals cytometree: A binary tree algorithm for automatic gating in cytometry analysis

2018 ◽  
Vol 93 (11) ◽  
pp. 1132-1140 ◽  
Author(s):  
Daniel Commenges ◽  
Chariff Alkhassim ◽  
Raphael Gottardo ◽  
Boris Hejblum ◽  
Rodolphe Thiébaut
Keyword(s):  
Binary Tree ◽  
Tree Algorithm
Sign in / Sign up

Export Citation Format

Share Document