Next Article in Journal
Parallel-Channel Electrotaxis and Neuron Screening of Caenorhabditis elegans
Next Article in Special Issue
L-Shaped Slot-Loaded Stepped-Impedance Microstrip Structure UWB Antenna
Previous Article in Journal
Recent Advances and Perceptive Insights into Powder-Mixed Dielectric Fluid of EDM
Previous Article in Special Issue
A 5-nV/√Hz Chopper Negative-R Stabilization Preamplifier for Audio Applications
Article

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

1
Department of Information Management, National Taipei University of Nursing and Health Sciences, Taipei 112, Taiwan
2
Taipei Veterans General Hospital, Taipei 112, Taiwan
3
Department of Information Management, National Chiao Tung University, Hsinchu 300, Taiwan
*
Authors to whom correspondence should be addressed.
Micromachines 2020, 11(8), 755; https://doi.org/10.3390/mi11080755
Received: 2 July 2020 / Revised: 23 July 2020 / Accepted: 28 July 2020 / Published: 4 August 2020
(This article belongs to the Special Issue Next Generation RFID Transponders)
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. View Full-Text
Keywords: RFID; tag identification; anti-collision; mobile tag; specimen management RFID; tag identification; anti-collision; mobile tag; specimen management
Show Figures

Figure 1

MDPI and ACS Style

Chen, Y.-H.; Chen, Y.-A.; Huang, S.-R. A Mobility Aware Binary Tree Algorithm to Resolve RFID Jam and Bottleneck Problems in a Next Generation Specimen Management System. Micromachines 2020, 11, 755. https://doi.org/10.3390/mi11080755

AMA Style

Chen Y-H, Chen Y-A, Huang S-R. A Mobility Aware Binary Tree Algorithm to Resolve RFID Jam and Bottleneck Problems in a Next Generation Specimen Management System. Micromachines. 2020; 11(8):755. https://doi.org/10.3390/mi11080755

Chicago/Turabian Style

Chen, Yen-Hung, Yen-An Chen, and Shu-Rong Huang. 2020. "A Mobility Aware Binary Tree Algorithm to Resolve RFID Jam and Bottleneck Problems in a Next Generation Specimen Management System" Micromachines 11, no. 8: 755. https://doi.org/10.3390/mi11080755

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop