一种改进的RFID防碰撞算法及其在食品跟踪中的应用

Jinsheng Lu, Lvqing Yang, Yishu Qiu, Dingzhao Li
{"title":"一种改进的RFID防碰撞算法及其在食品跟踪中的应用","authors":"Jinsheng Lu, Lvqing Yang, Yishu Qiu, Dingzhao Li","doi":"10.1109/ICCSE.2019.8845458","DOIUrl":null,"url":null,"abstract":"Food safety issues are frequent in today’s society, and how to accurately and accurately track food is an urgent problem to be solved. In the information age of the Internet of Things (IOT), the “connected objects” feature allows food to provide detailed information from the production to the sales process, tracking the processing flow of each link, and when the food quality and safety issues arise, it can be accurate. Quickly find the source of food and related product flows, effectively prevent problem foods from entering the market, and let consumers eat safe food. This thesis mainly studies the multi-tag recognition collision avoidance in the Internet of Things technology, and improves the multi-fork tree anti-collision algorithm. By introducing the slot idea in the ALOHA algorithm, a dual-slot dynamic search algorithm (GMT) is proposed. Simulation experiments show that the algorithm effectively reduces the time spent on RFID tags recognition, reduces the number of collisions of tags, and reduces the energy consumption of the system. It is an effective anti-collision algorithm.","PeriodicalId":351346,"journal":{"name":"2019 14th International Conference on Computer Science & Education (ICCSE)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An improved RFID anti-collision algorithm and its application in food tracking\",\"authors\":\"Jinsheng Lu, Lvqing Yang, Yishu Qiu, Dingzhao Li\",\"doi\":\"10.1109/ICCSE.2019.8845458\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Food safety issues are frequent in today’s society, and how to accurately and accurately track food is an urgent problem to be solved. In the information age of the Internet of Things (IOT), the “connected objects” feature allows food to provide detailed information from the production to the sales process, tracking the processing flow of each link, and when the food quality and safety issues arise, it can be accurate. Quickly find the source of food and related product flows, effectively prevent problem foods from entering the market, and let consumers eat safe food. This thesis mainly studies the multi-tag recognition collision avoidance in the Internet of Things technology, and improves the multi-fork tree anti-collision algorithm. By introducing the slot idea in the ALOHA algorithm, a dual-slot dynamic search algorithm (GMT) is proposed. Simulation experiments show that the algorithm effectively reduces the time spent on RFID tags recognition, reduces the number of collisions of tags, and reduces the energy consumption of the system. It is an effective anti-collision algorithm.\",\"PeriodicalId\":351346,\"journal\":{\"name\":\"2019 14th International Conference on Computer Science & Education (ICCSE)\",\"volume\":\"73 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 14th International Conference on Computer Science & Education (ICCSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSE.2019.8845458\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 14th International Conference on Computer Science & Education (ICCSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSE.2019.8845458","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

食品安全问题在当今社会屡见不鲜,如何准确、准确地跟踪食品是一个亟待解决的问题。在物联网(IOT)的信息时代,“物联网”功能可以让食品提供从生产到销售过程的详细信息,跟踪每个环节的加工流程,当出现食品质量安全问题时,可以做到准确无误。快速查找食品来源及相关产品流向,有效防止问题食品进入市场,让消费者吃到安全食品。本文主要研究物联网技术中多标签识别的避碰问题,并对多叉树避碰算法进行改进。通过引入ALOHA算法中的槽思想,提出了一种双槽动态搜索算法(GMT)。仿真实验表明,该算法有效地减少了RFID标签识别花费的时间,减少了标签的碰撞次数,降低了系统的能耗。它是一种有效的抗碰撞算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An improved RFID anti-collision algorithm and its application in food tracking
Food safety issues are frequent in today’s society, and how to accurately and accurately track food is an urgent problem to be solved. In the information age of the Internet of Things (IOT), the “connected objects” feature allows food to provide detailed information from the production to the sales process, tracking the processing flow of each link, and when the food quality and safety issues arise, it can be accurate. Quickly find the source of food and related product flows, effectively prevent problem foods from entering the market, and let consumers eat safe food. This thesis mainly studies the multi-tag recognition collision avoidance in the Internet of Things technology, and improves the multi-fork tree anti-collision algorithm. By introducing the slot idea in the ALOHA algorithm, a dual-slot dynamic search algorithm (GMT) is proposed. Simulation experiments show that the algorithm effectively reduces the time spent on RFID tags recognition, reduces the number of collisions of tags, and reduces the energy consumption of the system. It is an effective anti-collision algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信