Research and optimization of RFID tag anti-collision algorithm

Miao Bai, Zhiying Yang
{"title":"Research and optimization of RFID tag anti-collision algorithm","authors":"Miao Bai, Zhiying Yang","doi":"10.1117/12.2682439","DOIUrl":null,"url":null,"abstract":"In order to reduce the total identification time of readers and improve the system throughput in Radio Frequency Identification (RFID) systems, a new algorithm is proposed. Based on the Frame-Slotted ALOHA (FSA) algorithm, Tags are grouped according to the number of time slots during the reader's recognition process. For tags in collision time slots after a frame ends, the Collision Tree (CT) algorithm is used for group recognition, solving the starvation problem of the FSA algorithm and significantly reducing the total identification time of the reader. Simulation experiments have demonstrated that the algorithm proposed by the author significantly reduces the processing time when compared to the CT algorithm. and achieves a throughput rate that is higher than the traditional CT algorithm When the number of tags exceeds 260, reaching a maximum of 52% when the number of tags is around 400.","PeriodicalId":177416,"journal":{"name":"Conference on Electronic Information Engineering and Data Processing","volume":"12700 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference on Electronic Information Engineering and Data Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2682439","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In order to reduce the total identification time of readers and improve the system throughput in Radio Frequency Identification (RFID) systems, a new algorithm is proposed. Based on the Frame-Slotted ALOHA (FSA) algorithm, Tags are grouped according to the number of time slots during the reader's recognition process. For tags in collision time slots after a frame ends, the Collision Tree (CT) algorithm is used for group recognition, solving the starvation problem of the FSA algorithm and significantly reducing the total identification time of the reader. Simulation experiments have demonstrated that the algorithm proposed by the author significantly reduces the processing time when compared to the CT algorithm. and achieves a throughput rate that is higher than the traditional CT algorithm When the number of tags exceeds 260, reaching a maximum of 52% when the number of tags is around 400.
RFID标签防碰撞算法的研究与优化
为了减少读写器的总识别时间,提高射频识别系统的吞吐量,提出了一种新的算法。基于帧槽ALOHA (Frame-Slotted ALOHA)算法,根据阅读器识别过程中的时隙数量对标签进行分组。对于帧结束后处于冲突时隙的标签,采用碰撞树(collision Tree, CT)算法进行分组识别,解决了FSA算法的饥饿问题,显著减少了阅读器的总识别时间。仿真实验表明,与CT算法相比,本文提出的算法显著缩短了处理时间。当标签数超过260个时,吞吐量高于传统CT算法,当标签数在400个左右时,吞吐量最高可达52%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信