arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1305.0909cs.ITmath.IT
收藏

动态框架Aloha的渐近有效积压估计

An Asymptotically Efficient Backlog Estimate for Dynamic Frame Aloha

Luca Barletta, Flaminio Borgonovo, Matteo Cesana

摘要:

在本文中,我们探讨积压估计程序的动态帧Aloha(DFA)在射频识别(RFID)环境。特别地,我们解决了具有任何标签号$N$(包括$N\rightarrow\infty$)的标签识别效率。虽然在后一种情况下,效率$e^{-1}$是可能的,但文献中提出的解决方案都没有显示出达到这样的值。我们分析了Schoute的积压估计,这是非常有吸引力的简单,并正式证明其渐近效率为0.311。在此基础上,我们提出了渐近有效积压估计($^2$),它是Schoute积压估计的改进,其效率渐近地达到了$e^{-1}$.我们进一步表明,AE $^2$可以进行优化,以提出一个效率非常接近$e^{-1}$几乎任何值的人口规模。我们还评估了当帧大小被约束为2的幂时的效率损失,如用于DFA的RFID标准所要求的,并且理论上表明渐近效率变为0.356。

英文摘要:

In this paper we investigate backlog estimation procedures for Dynamic Frame Aloha (DFA) in Radio Frequency Identification (RFID) environment. In particular, we address the tag identification efficiency with any tag number $N$, including $N\rightarrow\infty$. Although in the latter case efficiency $e^{-1}$ is possible, none of the solution proposed in the literature has been shown to reach such value. We analyze Schoute's backlog estimate, which is very attractive for its simplicity, and formally show that its asymptotic efficiency is 0.311. Leveraging the analysis, we propose the Asymptotic Efficient backlog Estimate (AE$^2$) an improvement of the Schoute's backlog estimate, whose efficiency reaches $e^{-1}$ asymptotically. We further show that AE$^2$ can be optimized in order to present an efficiency very close to $e^{-1}$ for practically any value of the population size. We also evaluate the loss of efficiency when the frame size is constrained to be a power of two, as required by RFID standards for DFA, and theoretically show that the asymptotic efficiency becomes 0.356.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑