AFR:准确和快速的RFID估计

Wenchao Jiang, Yanmin Zhu, Bo Li
{"title":"AFR:准确和快速的RFID估计","authors":"Wenchao Jiang, Yanmin Zhu, Bo Li","doi":"10.1109/GLOCOM.2013.6831077","DOIUrl":null,"url":null,"abstract":"A hot and primary problem in RFID system is the estimation of RFID tag cardinality and many algorithms have been proposed for estimating RFID cardinality. However, we find that there is a serious problem that has been widely neglected by some of previous works of RFID cardinality estimation. They incorrectly assume that states of different time slots in the same frame are independent of each other. The consequence of such incorrect assumption would lead to low estimation accuracy. To demonstrate how we correct this mistake, we propose an accurate and fast estimating algorithm called AFR based on the pattern of the number of consecutive empty slots before the first non-empty slot. We theoretically derive the expected number and the variance of consecutive empty slots before the first non-empty slot as a function of the number of tags. Based on such theoretical derivation, we determine the best estimation of the number of tags by only looking at the numbers of consecutive empty slots before the first non-empty slot. Simulation results demonstrate that our algorithm makes more accurate estimation of RFID tag cardinality than an existing state-of-the-art algorithm while using shorter estimation time.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"AFR: Accurate and fast RFID estimation\",\"authors\":\"Wenchao Jiang, Yanmin Zhu, Bo Li\",\"doi\":\"10.1109/GLOCOM.2013.6831077\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A hot and primary problem in RFID system is the estimation of RFID tag cardinality and many algorithms have been proposed for estimating RFID cardinality. However, we find that there is a serious problem that has been widely neglected by some of previous works of RFID cardinality estimation. They incorrectly assume that states of different time slots in the same frame are independent of each other. The consequence of such incorrect assumption would lead to low estimation accuracy. To demonstrate how we correct this mistake, we propose an accurate and fast estimating algorithm called AFR based on the pattern of the number of consecutive empty slots before the first non-empty slot. We theoretically derive the expected number and the variance of consecutive empty slots before the first non-empty slot as a function of the number of tags. Based on such theoretical derivation, we determine the best estimation of the number of tags by only looking at the numbers of consecutive empty slots before the first non-empty slot. Simulation results demonstrate that our algorithm makes more accurate estimation of RFID tag cardinality than an existing state-of-the-art algorithm while using shorter estimation time.\",\"PeriodicalId\":233798,\"journal\":{\"name\":\"2013 IEEE Global Communications Conference (GLOBECOM)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE Global Communications Conference (GLOBECOM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2013.6831077\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Global Communications Conference (GLOBECOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2013.6831077","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

RFID系统中的一个热点和主要问题是RFID标签基数的估计,目前已经提出了许多用于估计RFID基数的算法。然而,我们发现有一个严重的问题,被广泛地忽视了一些以前的RFID基数估计工作。他们错误地假设同一帧中不同时隙的状态是相互独立的。这种不正确的假设将导致较低的估计精度。为了证明我们是如何纠正这个错误的,我们提出了一种准确而快速的估计算法,称为AFR,该算法基于第一个非空槽之前连续空槽的数量模式。我们从理论上推导出在第一个非空槽之前连续空槽的期望值和方差作为标签数量的函数。基于这样的理论推导,我们只看第一个非空槽之前连续空槽的数量来确定标签数量的最佳估计。仿真结果表明,该算法比现有的最先进算法在更短的估计时间内更准确地估计RFID标签的基数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
AFR: Accurate and fast RFID estimation
A hot and primary problem in RFID system is the estimation of RFID tag cardinality and many algorithms have been proposed for estimating RFID cardinality. However, we find that there is a serious problem that has been widely neglected by some of previous works of RFID cardinality estimation. They incorrectly assume that states of different time slots in the same frame are independent of each other. The consequence of such incorrect assumption would lead to low estimation accuracy. To demonstrate how we correct this mistake, we propose an accurate and fast estimating algorithm called AFR based on the pattern of the number of consecutive empty slots before the first non-empty slot. We theoretically derive the expected number and the variance of consecutive empty slots before the first non-empty slot as a function of the number of tags. Based on such theoretical derivation, we determine the best estimation of the number of tags by only looking at the numbers of consecutive empty slots before the first non-empty slot. Simulation results demonstrate that our algorithm makes more accurate estimation of RFID tag cardinality than an existing state-of-the-art algorithm while using shorter estimation time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信