RFID防碰撞算法的FPGA仿真实现

研究无线射频身份识别(RFID)系统中的防碰撞算法的硬件仿真设计。在介绍防碰撞算法原理的基础上,基于曼彻斯特编码(Manchester)方式,实现了多标签识读过程中的解码和防碰撞算法。利用FPGA对算法进行了仿真,结果表明本方法具有速度上的优越性和技术上的可行性。     

RFID防碰撞算法研究

RFID射频识别技术由于其技术简单,应用方便,当前在仓储,物流,图书管理,药品管理等各方面都广泛应用.但实际应用中,很多情况是在射频场中存在一个阅读器和多个电子标签.当阅读器同时清点多个电子标签时,就会出现信道争用.现有的解决方案是ALOHA和Binary Tree方法.以及在这两种方法基础上改进的方法.但现有的方法清点效率较低,因此在现有的碰撞方法基础上,提出一种结合ALOHA和Binary Tree方法的新的防碰撞方案,旨在进一步提高RFID应用的多标签清点效率.     

RFID防碰撞算法研究

在分析了目前现有的时隙ALOHA算法和查询树QT算法后,结合这两类算法的优点,提出了一种混合型算法GFA-QT来解决RFID中的碰撞问题.理论与仿真表明,这种混合型的算法在系统效率上优于现有的算法.     

RFID电子标签防碰撞算法的研究

电子标签防碰撞是RFID应用系统中的关键问题之一。解决这个问题可以采用时分多路存取技术,其相关的算法有ALOHA法、时隙ALOHA法、二进制搜索法、动态二进制搜索法等防碰撞算法。这几种算法在实现方式、应用效率上各有不同,本文对这几种算法进行了分析论证。     

RFID防碰撞算法研究

针对射频识别系统中的标签碰撞问题,在基于后退式二进制搜索算法的基础上提出一种改进算法。该算法结合动态调整算法并引入分组策略实现仅有两位碰撞即可识别标签,从而减少了搜索次数。该算法还引入堆栈存放阅读器接收到的ID数据,阅读器发送的序列号参数只是最高碰撞位信息,使得通信量减少。仿真结果表明,该算法能减少搜索次数,降低阅读器与标签之间的通信量,提高识别效率。     

RFID防碰撞算法研究

RFID（Radio Frequency Identification）,即射频识别,是一种利用无线射频方式在阅读器和标签之间进行非接触双向数据传输．以达到目标识别和数据交换目的的技术。     

RFID防碰撞算法中Aloha算法的研究

防碰撞算法是RFID应用系统中的关键问题之一,解决这个问题可以采用时分多路(TDMA)技术,其相关的算法有Aloha法、时隙Aloha法、二进制搜索法、动态二进制搜索法等防碰撞算法。本文着重对Aloha算法进行分析论证。     

UHF频段RFID系统防碰撞算法研究

防碰撞技术是决定RFID系统性能的关键因素之一,特别是UHF频段.防碰撞性能决定着多目标的识别率、识别速度.本文着重研究UHF频段RFID系统防碰撞解决方案和算法改进问题,探讨盘存周期内总时隙数的选取,并对系统效率进行仿真,提出简单易行的提高系统效率的方法.     

RFID防碰撞算法的分析和仿真

"射频识别是物联网的重要组件.物与物之间的相连包括逻辑上的连接和信息传递,主要是通过射频识别进行的.该文着重分析了射频识别系统的防碰撞算法,阐述了一种快速高效的射频识别系统中的防碰撞算法即跳跃式二进制树形算法的工作原理,并完成了算法的现场可编程门阵列的仿真实验.实验结果表明该算法是正确的、快速的和高效的.     

RFID系统防碰撞算法

无线射频识别（RFID）系统经过多年的发展已经成为人们日常生产、生活中重要的一部分了。在RFID系统的研究中,防碰撞（Anti-collision）是一个重要的问题,并且会在很大程度上影响RFID系统的性能。针对三种不同的碰撞类型对防碰撞算法进行了分类,其中有些算法已经成为了工业界的标准。另外,对RFID系统中一些特殊应用中的防碰撞算法进行了介绍。通过完整的综述,希望读者能够了解防碰撞算法进展,掌握防碰撞算法未来的研究方向。     

Adaptive splitting and pre-signaling for RFID tag anti-collision

In an RFID system a reader requests tags to send their IDs by RF signal backscattering for the purpose of identification. When multiple tags respond to the request simultaneously, tag collisions occur and the tag identification performance is degraded. There are several tag anti-collision protocols proposed for reducing tag collisions. The protocols can be categorized into two classes: ALOHA-based and tree-based protocols that include deterministic tree-based and probabilistic counter-based subclasses of protocols. ALOHA-based protocols have the tag starvation problem; deterministic tree-based protocols have the problem that their performances are influenced by the length and/or the distribution of tag IDs. On the contrary, probabilistic counter-based protocols do not have such problems. In this paper, we propose a probabilistic counter-based tag anti-collision protocol, called ASPS, to reduce tag collisions by adaptively splitting tags encountering collisions into several groups according to the estimated number of tags to be split, and to reduce the number of messages sent between the reader and tags by utilizing a pre-signaling bit. We simulate and analyze ASPS and compare it with related ones to show its advantages.     

基于Q-选择的RFID防碰撞算法的研究

射频识别技术RFID(Radio Frequency Identification)是一种非接触式的自动识别技术.多个电子标签在识别时发生碰撞是射频识别技术中关键的问题.Q-选择算法是解决碰撞问题有效方法之一.为提高标签的阅读速率,将此算法中的C设定为随Q改变的值.通过在NS-2中的仿真将C可变与多种不可变的情况进行对比,证明了在C可变的情况下,读取速率有了较大的提高.并通过与其他RFID防碰撞算法(返回式二进制树形搜索算法)进行的比较,说明Q-选择算法的优越性.因此,当RFID应用于需识别标签数量较多的场景时,C可变的Q-选择算法将是非常有效的提高性能的方法.     

A power control technique for anti-collision schemes in RFID systems

The emerging technology of Radio Frequency IDentification (RFID) has enabled a wide range of automated tracking and monitoring applications. However, the process of interrogating a set of RFID tags usually involves sharing a wireless communication medium by an RFID reader and many tags. Tag collisions result in a significant delay to the interrogation process, and such collisions are hard to overcome because of the limited capabilities of passive RFID tags and their inability to sense the communication medium. While existing anti-collision schemes assume reading all tags at once which results in many collisions, we propose a novel approach in which the interrogation zone of an RFID reader is divided into a number of clusters (annuli), and tags of different clusters are read separately. Therefore, the likelihood of collisions is reduced as a result of reducing the number of tags that share the same channel at the same time.In this paper, we consider two optimization problems whose objective is minimizing the interrogation delay. The first one aims at finding the optimal clustering scheme assuming an ideal setting in which the transmission range of the RFID reader can be tuned with high precision. In the second one, we consider another scenario in which the RFID reader has a finite set of discrete transmission ranges. For each problem, we present a delay mathematical analysis and devise an algorithm to efficiently find the optimal number of clusters. The proposed approach can be integrated with any existing anti-collision scheme to improve its performance and, hence, meet the demand of large scale RFID applications. Simulation results show that our approach makes significant improvements in reducing collisions and delay.     

RFID标签防碰撞研究

分别简要介绍了几种ALOHA算法与树形算法,并对ALOHA算法与树形算法作了简要的比较。同时详细介绍了具有一定自学习能力的"在时隙内利用贝叶斯更新的帧ALOHA"算法与"自适应二进制分裂(ABS)"算法。     

An RFID anti-collision algorithm with dynamic condensation and ordering binary tree

In many RFID applications, the reader repeatedly identifies the same staying tags. Existing anti-collision protocols can rapidly identify the staying tags by remembering the order in which the tags were recognized in the previous identification process. This paper proposes a novel protocol, dynamic blocking adaptive binary splitting (DBA), based on the blocking mechanism, which prevents the newly-arriving tags from colliding with the staying tags. Moreover, DBA utilizes a dynamic condensation technique to reduce the number of idle slots produced when recognized tags leave. Following the condensation process, multiple staying tags may be required to share the same slot, and thus may cause collisions among them. Accordingly, an efficient ordering binary tree mechanism is proposed to split the collided tags deterministically according to the order in which they were recognized. The analytical and simulation results show that DBA consistently outperforms previous algorithms in all of the considered environments.     

基于时隙的RFID防碰撞算法分析

介绍了几种常见的基于时隙的防碰撞算法:帧时隙ALOHA算法和时隙随机算法,并通过仿真,比较分析这些算法识别所用总时隙和对系统吞吐性能的影响。     

ALOHA类RFID防碰撞算法OPNET建模与优化

在OPNET平台上建立了通用的RFID网络模型,并对UHF频段的RFID主要标准ISO18000-6中的ALOHA类防碰撞算法进行仿真,得到了一组最优化设置曲线供工程应用参考,同时给出具体执行方法。仿真结果表明,优化后算法可使标签识别速率接近最优值。     

Artificial immune network-based anti-collision algorithm for dense RFID readers

Radio frequency identification (RFID) is faced with reader-to-reader collision problem when multiple readers are deployed densely. In scheduling-based methods, the reader-to-reader collision problem can be often mitigated from the viewpoint of optimized resource allocation to readers, which aims at maximizing the total effective interrogation area of an RFID reader network. This paper formulates a reader-to-reader anti-collision model with respect to physical positions, time slots, frequency channels and transmitting power, and thus proposes an artificial immune network with hybrid encoding for resource allocation (AINetHE-RA) to solve this model. In AINetHE-RA, a candidate antibody consists of a location segment, a channel segment and a power segment, where time slots are hidden in the last two segments. According to their respective properties, the location segment and the power segment are encoded by using real number; while the channel segment is encoded by integer number. This is the hybrid encoding format in essence. Correspondingly, in the mutation operator, different mutation strategies are designed for three segments, respectively, which make AINetHE-RA solve this reader-to-reader anti-collision model efficiently. In simulation experiments, the effects of such parameters as time slots, frequency channels, power values and locations are first investigated, and the total effective interrogation area and the number of identified tags are evaluated for the single and multiple density tag distribution. Especially, as an industrial example of non-uniform random tag distribution, the simple sectionalized warehouse management is considered to evaluate the performance of AINetHE-RA. The simulation results demonstrate that the proposed AINetHE-RA algorithm is effective and efficient in mitigating the reader-to-reader collision problem in dense RFID networks and outperforms such methods as GA-RA, PSO-GA and opt-aiNet-RA in finding the optimal resource allocation schemes.