Collision Avoidance for Radio Frequency Identification Tags: Simulation and Testing

Tag collisions are a common and significant obstacle in radio frequency identification (RFID) systems, directly affecting the identification efficiency and system throughput. To address this issue, this paper proposes a dynamic frame slotted RFID collision avoidance algorithm based on multiple frequencies. The proposed algorithm organizes tags into groups, limits the number of tags responding within each group, and dynamically adjusts the frame length to optimize management within the group. By efficiently allocating tags with different frequencies within the group, the proposed algorithm effectively reduces collision slots and increases system throughput per unit of time. Simulation and practical test results demonstrate that, compared to traditional RFID collision avoidance algorithms, the proposed algorithm shows significant advantages in improving throughput and reducing the number of collisions. It can be applied to practical RFID systems in high-density tag scenarios.

Authors

Institutions

Publication Details

Published
2025-03-21
DOI
https://doi.org/10.1109/iscait64916.2025.11010562
Primary Topic
Air Traffic Management and Optimization
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Collision Avoidance for Radio Frequency Identification Tags: Simulation and Testing

Yiheng Yu, Yixin He, Fanghui Huang, Dawei Wang
Air Traffic Management and Optimization
article

Collision Avoidance for Radio Frequency Identification Tags: Simulation and Testing

Yiheng Yu, Yixin He, Fanghui Huang, Dawei Wang
article en

Abstract

Tag collisions are a common and significant obstacle in radio frequency identification (RFID) systems, directly affecting the identification efficiency and system throughput. To address this issue, this paper proposes a dynamic frame slotted RFID collision avoidance algorithm based on multiple frequencies. The proposed algorithm organizes tags into groups, limits the number of tags responding within each group, and dynamically adjusts the frame length to optimize management within the group. By efficiently allocating tags with different frequencies within the group, the proposed algorithm effectively reduces collision slots and increases system throughput per unit of time. Simulation and practical test results demonstrate that, compared to traditional RFID collision avoidance algorithms, the proposed algorithm shows significant advantages in improving throughput and reducing the number of collisions. It can be applied to practical RFID systems in high-density tag scenarios.

Northwestern Polytechnical University (CN), Jiaxing University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 84%
Air Traffic Management and Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.