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

Bibliographic Details
Main Authors: Yen-Hung Chen, Yen-An Chen, Shu-Rong Huang
Format: Article
Language:English
Published: MDPI AG 2020-08-01
Series:Micromachines
Subjects:
Online Access:https://www.mdpi.com/2072-666X/11/8/755
_version_ 1797560334550040576
author Yen-Hung Chen
Yen-An Chen
Shu-Rong Huang
author_facet Yen-Hung Chen
Yen-An Chen
Shu-Rong Huang
author_sort Yen-Hung Chen
collection DOAJ
description 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.
first_indexed 2024-03-10T17:59:23Z
format Article
id doaj.art-9582b5471ffa470daebb52ef7b95d726
institution Directory Open Access Journal
issn 2072-666X
language English
last_indexed 2024-03-10T17:59:23Z
publishDate 2020-08-01
publisher MDPI AG
record_format Article
series Micromachines
spelling doaj.art-9582b5471ffa470daebb52ef7b95d7262023-11-20T09:01:56ZengMDPI AGMicromachines2072-666X2020-08-0111875510.3390/mi11080755A Mobility Aware Binary Tree Algorithm to Resolve RFID Jam and Bottleneck Problems in a Next Generation Specimen Management SystemYen-Hung Chen0Yen-An Chen1Shu-Rong Huang2Department of Information Management, National Taipei University of Nursing and Health Sciences, Taipei 112, TaiwanTaipei Veterans General Hospital, Taipei 112, TaiwanDepartment of Information Management, National Chiao Tung University, Hsinchu 300, TaiwanHospitals 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.https://www.mdpi.com/2072-666X/11/8/755RFIDtag identificationanti-collisionmobile tagspecimen management
spellingShingle Yen-Hung Chen
Yen-An Chen
Shu-Rong Huang
A Mobility Aware Binary Tree Algorithm to Resolve RFID Jam and Bottleneck Problems in a Next Generation Specimen Management System
Micromachines
RFID
tag identification
anti-collision
mobile tag
specimen management
title A Mobility Aware Binary Tree Algorithm to Resolve RFID Jam and Bottleneck Problems in a Next Generation Specimen Management System
title_full A Mobility Aware Binary Tree Algorithm to Resolve RFID Jam and Bottleneck Problems in a Next Generation Specimen Management System
title_fullStr A Mobility Aware Binary Tree Algorithm to Resolve RFID Jam and Bottleneck Problems in a Next Generation Specimen Management System
title_full_unstemmed A Mobility Aware Binary Tree Algorithm to Resolve RFID Jam and Bottleneck Problems in a Next Generation Specimen Management System
title_short A Mobility Aware Binary Tree Algorithm to Resolve RFID Jam and Bottleneck Problems in a Next Generation Specimen Management System
title_sort mobility aware binary tree algorithm to resolve rfid jam and bottleneck problems in a next generation specimen management system
topic RFID
tag identification
anti-collision
mobile tag
specimen management
url https://www.mdpi.com/2072-666X/11/8/755
work_keys_str_mv AT yenhungchen amobilityawarebinarytreealgorithmtoresolverfidjamandbottleneckproblemsinanextgenerationspecimenmanagementsystem
AT yenanchen amobilityawarebinarytreealgorithmtoresolverfidjamandbottleneckproblemsinanextgenerationspecimenmanagementsystem
AT shuronghuang amobilityawarebinarytreealgorithmtoresolverfidjamandbottleneckproblemsinanextgenerationspecimenmanagementsystem
AT yenhungchen mobilityawarebinarytreealgorithmtoresolverfidjamandbottleneckproblemsinanextgenerationspecimenmanagementsystem
AT yenanchen mobilityawarebinarytreealgorithmtoresolverfidjamandbottleneckproblemsinanextgenerationspecimenmanagementsystem
AT shuronghuang mobilityawarebinarytreealgorithmtoresolverfidjamandbottleneckproblemsinanextgenerationspecimenmanagementsystem