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

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 manageme...

Full description

Saved in:
Bibliographic Details
Published in:Micromachines (Basel) Vol. 11; no. 8; p. 755
Main Authors: Chen, Yen-Hung, Chen, Yen-An, Huang, Shu-Rong
Format: Journal Article
Language:English
Published: Basel MDPI AG 04.08.2020
MDPI
Subjects:
Algorithms
anti-collision
Belt conveyors
Collision avoidance
Cost analysis
Dwell time
Human resources
mobile tag
Radio frequency identification
Resource management
RFID
specimen management
Stations
Success
tag identification
Tags
Traffic congestion
Traffic jams
ISSN:2072-666X, 2072-666X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2072-666X
2072-666X
DOI:10.3390/mi11080755