A Tag Prediction Algorithm using Upper Bit in RFID systems

Sung Soo Kim, Yong Hwan Kim, S. Lee, Kyung-Ho Chung, K. Ahn
{"title":"A Tag Prediction Algorithm using Upper Bit in RFID systems","authors":"Sung Soo Kim, Yong Hwan Kim, S. Lee, Kyung-Ho Chung, K. Ahn","doi":"10.1109/LCN.2008.4664238","DOIUrl":null,"url":null,"abstract":"In RFID (Radio Frequency IDentification) system, the reader needs the anti collision algorithm for fast identifying all of the tags in the interrogation zone. This paper proposes the tree based Tag Prediction Algorithm using Upper Bit (TPAUB) to arbitrate the tag collision. A TPAUB can identify tags without identifying all the bits in the tag ID. The reader uses the upper bit which is added to the tag ID and if there are two collided bits or multiple collided bits, it checks the upper bit and grasps the number the number of identified dasia1psilas. A TPAUB can reduce the number of the requests transmitted from the reader, thus it shortens the time of identifying all of the tags in the interrogation zone.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"2007 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2008.4664238","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In RFID (Radio Frequency IDentification) system, the reader needs the anti collision algorithm for fast identifying all of the tags in the interrogation zone. This paper proposes the tree based Tag Prediction Algorithm using Upper Bit (TPAUB) to arbitrate the tag collision. A TPAUB can identify tags without identifying all the bits in the tag ID. The reader uses the upper bit which is added to the tag ID and if there are two collided bits or multiple collided bits, it checks the upper bit and grasps the number the number of identified dasia1psilas. A TPAUB can reduce the number of the requests transmitted from the reader, thus it shortens the time of identifying all of the tags in the interrogation zone.
RFID系统中基于上位的标签预测算法
在RFID(无线射频识别)系统中,读写器需要防碰撞算法来快速识别审问区内的所有标签。本文提出了一种基于树的标签预测算法,该算法使用上比特(TPAUB)来仲裁标签冲突。TPAUB可以在不识别标签ID中所有比特的情况下识别标签。阅读器使用添加到标签ID上的上位,如果有两个或多个碰撞位,则检查上位并掌握已识别的数据的数量。TPAUB可以减少从读取器传输的请求的数量,从而缩短识别讯问区内所有标签的时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信