改进动态帧时隙ALOHA算法

ALOHA型算法是一种防碰撞算法,适用于标签数目较少的情况。当标签数目逐渐增大时,通常需要指数倍增长的时隙数才能识别出这些标签。文中提出了一种改进的动态帧时隙ALOHA算法,它首先估计未被识别的标签数,然后调整相应帧长,从而获得最佳系统效率。仿真结果显示,当标签数为500时,文中所提出算法较传统算法的系统时延减少为原来的1／2。     

A Time‐Optimal Anti‐collision Algorithm for FSA‐Based RFID Systems

With the introduction of the new generation RFID technology, EPCglobal Class‐1 Generation‐2, there is considerable interest in improving the performance of the framed slotted Aloha (FSA)‐based tag collision arbitration protocol. We suggest a novel time‐optimal anti‐collision algorithm for the FSA protocol. Our performance evaluation demonstrates that our algorithm outperforms other tag collision arbitration schemes.     

Gen2‐Based Tag Anti‐collision Algorithms Using Chebyshev's Inequality and Adjustable Frame Size

Arbitration of tag collision is a significant issue for fast tag identification in RFID systems. A good tag anti‐collision algorithm can reduce collisions and increase the efficiency of tag identification. EPCglobal Generation‐2 (Gen2) for passive RFID systems uses probabilistic slotted ALOHA with a Q algorithm, which is a kind of dynamic framed slotted ALOHA (DFSA), as the tag anti‐collision algorithm. In this paper, we analyze the performance of the Q algorithm used in Gen2, and analyze the methods for estimating the number of slots and tags for DFSA. To increase the efficiency of tag identification, we propose new tag anti‐collision algorithms, namely, Chebyshev's inequality, fixed adjustable framed Q, adaptive adjustable framed Q, and hybrid Q. The simulation results show that all the proposed algorithms outperform the conventional Q algorithm used in Gen2. Of all the proposed algorithms, AAFQ provides the best performance in terms of identification time and collision ratio and maximizes throughput and system efficiency. However, there is a tradeoff of complexity and performance between the CHI and AAFQ algorithms.     

基矛物联网的农产品可追溯关键算法研究

为提高农产品追溯效率、降低农产品跟踪、监控成本,通过对现有农产品生产、定位、跟踪、监控、销售等全过程进行了分析．给出了一种基于RFID农产品可追溯系统的物联网设计方案。重点分析了标签的唯一编码方案、RFID防碰撞算法和RFID数据采集过滤算法。最后对RFID数据采集进行了仿真与实现。应用结果表明对提高农产品追溯效率、降低农产品跟踪、监控成本有较明显的效果。     

Adaptive Binary Splitting: A RFID Tag Collision Arbitration Protocol for Tag Identification

In the RFID system, a reader recognizes tags through communications over a shared wireless channel. When multiple tags transmit their IDs at the same time, the tag-to-reader signals lead to collision. Tag collision arbitration for passive RFID tags is significant for fast identification since collisions disturb the reader's identification process. This paper presents an Adaptive Binary Splitting (ABS) protocol which is an improvement on the binary tree protocol. To reduce collisions and identify tags efficiently, ABS uses information which is obtained from the last processes of tag identification. Our performance evaluation shows that ABS outperforms other tree based tag anti-collision protocols. This work was supported by Korea Research Foundation Grant (KRF-2005-041-D00680).     

一种帧长优化的动态时隙ALOHA算法

为了解决RFID（射频识别）系统中多标签通信时的碰撞问题,人们提出了各种防碰撞的算法,而动态时隙ALOHA算法是其中效率较高的一类。文章对动态时隙ALOHA算法中的最优帧长进行了研究,考虑到在使用曼彻斯特编码的前提下,标签发送的信息之间发生某些特殊的碰撞,阅读器依然能够正确识别标签的情形,提出了一种优化新算法。数学分析和仿真结果表明,与现有的动态时隙ALOHA算法相比,该算法的系统效率更高。     

Tree-based backoff protocol for fast RFID tag identification

This paper proposes a tree-based backoff (TBB) protocol that reduces the number of iterations implemented in the procedure of tag collision arbitration in radio frequency identification (RFID) systems. This is achieved by employing the following mechanisms: one is send the request command iteratively to all tags in the interrogation zone until a single tag is identified. The other is backward to the parent node instead of root node to obtain the request parameters and send the request command again until all tags are identified. Compared with the traditional tree-based protocol, on average, simulated results show that the TBB protocol reduces the number of the iterations by 72.3% and the identification delay by 58.6% and achieves the goal of fast tag identification.     

基于可离散处理的RFID防碰撞混杂算法研究

针对一类二叉树搜索算法存在寻呼次数过高的应用局限,采用二叉树查询和离散处理相结合的方法,提出了RFID防碰撞混杂算法。理论分析表明,与以往算法不同,该算法实质上是对满足可离散处理特征的模式而非个体的标签进行二叉树搜索。算法充分考虑了阅读器寻呼次数、寻呼开销、吞吐率等重要的性能指标。仿真结果验证了该算法在寻呼次数、吞吐率等性能指标上有明显的提升。     

中等容量和大容量声表面波标签研究

声表面波标签因其自身固有生产工艺的缺点及容量有限而限制了其应用和发展。从实际生产的角度出发,以脉冲位置编码声表面波标签为基础,提出了中等容量和大容量声表面波标签的设计方案,在提高容量的同时可降低生产成本。该文核心内容为大容量声表面波标签的设计,其基于相关叉指换能器和排列组合原理,与之对应的两种阅读器结构方案也展开了讨论。     

基于图染色思想的RFID防冲突算法研究

针对射频识别技术（R．FID）存在多个阅读器同时传输数据容易产生冲突的问题,提出了一种基于图染色理论的防止冲突的算法。该算法利用图的染色算法将可能存在冲突的阅读器染成不同的颜色,使得每种不相同的颜色不能同时获得相同的时隙,降低了多个阅读器同时传输数据产生冲突的可能性。分析表明：采用该算法明显地降低了阅读器之间的冲突率,同时得到最小的时隙数,提高了信道利用率,为R-FID防冲突算法提供了一种新的解决方案,同时为基于TDMA的广播调度模式也提供了一种新的时隙分配方式。     

一种减少通信复杂度的RFID搜索树防碰撞算法

针对射频识别搜索树防碰撞算法中通信数据量大、识别时延长等问题,提出了一种减少通信复杂度的防碰撞算法.在标签中引入前缀长度寄存器和响应标志寄存器,在阅读器堆栈区存储前缀个数信息,阅读器通过发送前缀长度信息,对标签进行分类搜索,阅读器和标签不再发送对方已经识别的序列号,有效减少了通信数据量.仿真结果表明,与传统的二叉树搜索防碰撞算法相比,该算法可明显减少系统通信复杂度,提高标签的搜索速率.     

改进的基于ALOHA的RFID防碰撞算法

为了解决RFID系统中电子标签识别效率不高的问题,对基于ALOHA的随机性防碰撞算法进行了详细分析,提出了一种新的ALOHA防碰撞算法.在该算法中,针对标签估计,采用动态调整的方式自动改变标签估计式中的系数,使得标签估计个数随着已识别的标签数动态变化,从而估计下一帧待识别标签数;而对于帧长调整,根据估计的标签数,通过帧长与标签数分组的关系确定.通过MATLAB进行仿真,结果表明,该算法能明显提高系统的吞吐率和稳定性.