【24h】

Optimal Frame Tuning for Aloha Protocols in RFID Networks

机译:RFID网络中Aloha协议的最佳帧调整

获取原文

摘要

We consider the problem of efficient tag identification in RFID networks. Among the solutions recently proposed for tag identification, a variant of the framed slotted ALOHA protocol, called tree slotted ALOHA (TSA), has been shown to achieve the lowest identification delay and highest time system efficiency. However, in case of a large number of tags, this protocol produces an estimate of the tag population size which still differs from the actual number of tags, and utilizes a non-optimal method for deciding the frame size. In this paper we address the issues of more precise tag number estimation and achieving optimal frame sizing by proposing a new protocol, the binary spitting TSA (BSTSA) protocol. Through thorough NS2-based simulations we show that BSTSA considerably outperforms all previous protocols, achieving 80% time system efficiency vs. the 50% achieved by TSA, and reduces the length of the tag identification process of up to 40% with respect to TSA.
机译:我们考虑了RFID网络中有效标签识别的问题。在最近提出的用于标签识别的解决方案中,已显示了帧时隙ALOHA协议的一种变体,称为树时隙ALOHA(TSA),可实现最低的识别延迟和最高的时间系统效率。但是,在标签数量很多的情况下,该协议会产生一个与标签实际数量仍然不同的标签数量估计值,并利用非最佳方法来确定帧大小。在本文中,我们通过提出一种新协议,即二进制分散TSA(BSTSA)协议,解决了更精确的标签数量估计和实现最佳帧大小的问题。通过全面的基于NS2的模拟,我们表明BSTSA的性能大大优于所有以前的协议,与TSA相比,BSTSA的时间系统效率达到了80%,而TSA为50%,并且标签识别过程的时间缩短了40%。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号