基于间隔估计法的RFID防碰撞算法

多个应答器的碰撞问题是影响超高频射频识别(RFID)系统读取效率的一个关键问题。从EPC Class1 Generation2(C1G2)RFID系统帧长受约束特点出发,分析了帧时隙ALOHA防碰撞机制及其经典应答器估计方法的特点。提出了应答器间隔估计方法(IEM)以及基于该方法的EPC C1G2 RFID防碰撞算法,并给出了仿真结果。与现有基于经典应答器估计方法的射频识别系统防碰撞算法相比较,提出的防碰撞算法减少了识别时间,提高了系统的识别效率。     

改进型帧时隙ALOHA防碰撞算法研究

为进一步提高RFID系统中电子标签防碰撞算法的识别效率,对帧时隙ALOHA防碰撞算法的性能进行分析,提出一种结合精确标签估计和二进制搜索的改进型帧时隙ALOHA算法.将识别过程分为标签估计和标签识别两个阶段,在标签估计算法中引入碰撞概率上、下限参数,并精确估计标签数量对初始帧时隙大小进行优化;在标签识别阶段,利用二进制搜索算法对时隙内的碰撞标签进行快速识别.通过对识别过程进行仿真结果表明:改进的算法改善了防碰撞性能,提高了RFID系统的标签识别效率.     

基于混沌序列的超高频RFID防碰撞及安全协议设计(英文)

Collision and security issues are considered as barriers to RFID applications.In this paper,a parallelizable anti-collision based on chaotic sequence combined dynamic frame slotted aloha to build a high-efficiency RFID system is proposed.In the tags parallelizable identification,we design a Discrete Markov process to analyze the success identification rate.Then a mutual authentication security protocol merging chaotic anti-collision is presented.The theoretical analysis and simulation results show that the proposed identification scheme has less than 45.1%of the identification time slots compared with the OVSF-system when the length of the chaos sequence is 31.The success identification rate of the proposed chaotic anti-collision can achieve 63%when the number of the tag is100.We test the energy consumption of the presented authentication protocol,which can simultaneously solve the anti-collision and security of the UHF RFID system.     

Bi-slotted tree based anti-collision protocols for fast tag identification in RFID systems

This paper is intended to present bi-slotted tree based RFID tag anti-collision protocols, bi-slotted query tree algorithm (BSQTA) and bi-slotted collision tracking tree algorithm (BSCTTA). Diminishing prefix overhead and iteration overhead is a significant issue to minimize the anti-collision cost. For fast tag identification, BSQTA and BSCTTA use time divided responses depending on whether the collided bit is `0' or `1' at each tag ID. According to the simulation results, BSQTA and BSCTTA require less time consumption for tag identification than the other tree based RFID tag anti-collision protocols     

超高频RFID系统中一种可行的时间最优防碰撞算法

动态帧时隙ALOHA(DFSA)算法是一种应用广泛的防碰撞技术,主要用于解决超高频(UHF)射频识别系统(RFID)中的标签碰撞问题.在DFSA算法中,读写器需要准确估计剩余标签数并设定一个新的帧长度来识别这些标签.因此,碰撞检测(CD)和标签剩余数估计在DFSA中起着关键性的作用.现有的碰撞检测方法并不能足够有效的用于检测碰撞并导致识别性能的下降.为了减少计算量和提高识别性能,本文提出了一种有效的防碰撞算法,该算法结合了碰撞检测和待识别标签数估计方法,使得性能更加高效.理论分析和仿真结果表明,该算法的性能要优于现有的同类算法,这非常有助于设计一种快速而高效的读写器.     

基于连续碰撞位探测的防碰撞算法研究

文章通过对IAMS算法的分析,提出了一种基于连续碰撞位探测（CCBD）的防碰撞算法.在CCBD算法中引入连续碰撞位探测机制,并把标签碰撞分为单独位碰撞和连续位碰撞两种情况进行处理.连续碰撞位探测机制能够准确获得连续碰撞位的实际存在情况从而避免了空闲时隙以及不必要的碰撞时隙的产生.理论分析和实验仿真表明,CCBD算法克服了IAMS算法的不足,在标签识别过程中表现出良好的性能.     

Adaptive binary splitting for efficient RFID tag anti-collision

Tag collision arbitration for passive RFID tags is a significant issue for fast tag identification. This letter presents a novel tag anti-collision scheme called adaptive binary splitting (ABS). For reducing collisions, ABS assigns distinct timeslots to tags by using information obtained from the last identification process. Our performance evaluation shows that ABS outperforms other tree based tag anti-collision protocols.     

Multi-branch query tree protocol for solving RFID tag collision problem

The technology of anti-collision is a key point in radio frequency identification （RFID） system. To avoid data collision, there are two approaches： ALOHA based algorithm and binary tree （BT） based algorithm. However, these cannot solve the collision problem completely, especially when the tag quantity is big and the tag ID is long. In this article, we present a multi-branch query tree （MBQT） protocol based on balanced incomplete block design （BIBD） code, and use 16-bit vectors derived from the BIBD as query prefix symbols of RFID reader. Compared with the conventional anti-collision algorithm, the theoretic analysis and simulation show that the proposed protocol improves the identification efficiency.     

Multiple feedback algorithm for RFID MAC protocols

This letter introduces a new tree-based anti-collision scheme using multiple feedbacks for uplink tag random access in a single-cell scenario. We examine MAC efficiency improvements that result from the proposed scheme in terms of uplink (UL) throughput for emerging radio frequency identification (RFID) networks, and compare it with the conventional tree based RFID MAC in ISO 18000-6 Type B standard.     

Minimising collisions in RFID data streams using probabilistic Cluster-Based Technique

Radio Frequency Identification (RFID) uses wireless radio frequency technology to automatically identify tagged objects. Despite the extensive development of the RFID technology in many areas, tags collisions still remain a major problem. This issue is known as the collision problem and can be solved by using anti-collision techniques. Current probabilistic anti-collision approaches suffer from tag starvation due to the inaccurate Backlog estimation and have a low performance in some cases. In this research, we propose a Probabilistic Cluster-Based Technique (PCT) to maximise the performance efficiency during the tag identification process. The PCT approach creates new tag grouping strategies using particular equations, according to the optimal efficiency obtained for a specific number of tags. Through extensive experimentation, we have demonstrated that the proposed concept performs better than the other current state-of-the-art approaches.     

捕获效应下RFID标签的CATPE防冲突协议

在被动式RFID系统中,当多个标签同时向阅读器发射信号时,捕获效应能使阅读器成功接收其中一个标签信号。为提高捕获效应下的识别效率,本文提出一种名为CATPE (capture-aware and tag-population estimation)的RFID标签防冲突协议。该协议可同时估计标签数和捕获效应的发生概率,并在非等长时隙下设置最优帧长。CATPE协议的优点在于不需搜索极值,仅一步计算就能完成估计,从而降低了计算复杂度。计算机仿真显示,该协议与已有协议的识别效率相近,但计算复杂度得到了降低。     

基于模运算标签分类的RFID标签防碰撞识别方法

为了解决射频识别(RFID)系统中的多标签防碰撞问题,在分析帧时隙ALOHA算法的基础上,提出一种基于模运算标签分类的RFID标签防碰撞识别方法。引入一种检测信息碰撞的时隙选择信息,对标签所选取时隙的碰撞情况进行分析并估计标签数量;然后对标签EPC编码进行逐级的取模运算,将同余的标签归为一组。各个标签经过K次取模运算后,分为2k组,每组只有发生少量碰撞位的标签。再将标签按照分组对应的时隙发送,碰撞标签采用二叉树后退式算法处理。本方法极大的提高了标签的识别效率,适用于射频识别系统中阅读器对于大量电子标签的快速识别。     

有源RFID系统中可靠通信的研究

有源RFID是一种自动识别技术,在追踪和识别高价值商品方面具有突出优势。针对通信距离的增加,有源RFID系统出现识读不可靠、数据出错等问题。构建了基于CC2510的有源RFID系统,并结合硬件特性,重点对读写器与有源电子标签之间的通信数据帧标识、数据帧结构、标签防冲突处理和数据错误重传机制等方面进行探讨和设计。实验结果表明,改进后的通信机制对不同的测试环境具有一定的适应能力,表现出较好的可靠性。     

跳频CDMA的RFID防碰撞算法研究

分析了当前RFID系统的防碰撞算法,研究防碰撞机制和相关的算法,结合跳频技术与CDMA提出基于跳频CDMA的RFID防碰撞算法。算法以不同的相互正交的码序列区分标签,在同一个时隙中标签通过跳频来防止碰撞的产生。通过一个2.4GHz有源RFID系统来实现和验证算法。实验表明,跳频CDMA算法能有效防止标签碰撞的产生,在时延方面优于二进制树形搜索算法。     

RFID系统中停留标签的组策略防碰撞算法

在射频识别RFID系统中,防碰撞算法对于标签的快速识别,尤其在移动应用的场景中非常重要。该文针对移动场景中停留标签,提出了组策略停留标签算法GSRA(Group Strategy for Remaining tags Algorithm),分为停留标签识别和新到标签识别两个阶段,并将停留标签信息分组存放与更新,从而提高停留标签的识别效率。理论分析证明该算法系统效率仅与标签动态时移动时的迁移速率和静态时的系统效率有关,而与标签数量无关。仿真结果表明GSRA算法在标签迁移速率为20%时,结合冲突树算法CT,系统效率可以达到240%。     

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

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

声表面波射频识别阅读器的设计

论述了基于DSP技术的声表面波射频识别(SAW RFID)阅读器的设计方法.在此基础上给出了阅读器的硬件设计和与多个标签识别的流程图.最后对标签的反碰撞问题进行了研究.     

一种低功耗有源射频识别系统的设计

研究了一种低功耗有源射频识别系统组网与设计技术,该系统可在软硬件两方面实现低功耗设计。在硬件方面,采用NORDIC公司的nRF24LE1芯片作为有源标签,nRF24L01+芯片作为节点射频芯片,STM32单片机作为节点控制芯片,实现了芯片与节点的注册与通信;软件方面,采用时分复用方法,合理分配有源芯片的时隙,设计了防冲突机制,使得芯片在极端的时间内工作,实现了低功耗组网通信。     

基于空闲时隙消除的超高频RFID防碰撞算法

标签防碰撞是射频识别系统中的一项重要研究课题.为了进一步提高射频识别系统的性能和降低复杂度,提出了一种基于空闲时隙消除的二进制分裂算法.该算法在二进制分裂算法中引入了单比特状态标识位,在识别过程中,标签在ID数据传输之前先发送单比特随机信号,用于判定时隙是否碰撞,从而避免了冗余的信息传输.由于该算法彻底消除了传统二进制随机数分裂方法中的空闲时隙,因此节省了识别过程中的协调时间开销.最后通过理论分析和仿真结果证明：ISE-BS算法的吞吐率稳定在40.65%左右,时间效率稳定在32.46%左右,ISE-BS算法相比于现有的防碰撞算法性能更优.从实现的角度,比较了各个算法的浮点运算成本,结果显示提出的算法可以极大的降低系统复杂度.     

Dynamic frame-slotted ALOHA anti-collision algorithm in RFID based on non-linear estimation

We propose an RFID tag anti-collision method using adaptive frame length adjustment. Based on the number of tags identified in the first frame, the original tag population can be estimated by solving a non-linear estimating equation. Subsequent frame lengths can be adaptively adjusted according to the number of remaining tags. The simulation results demonstrate the error rate of the proposed method to be less than 5% – superior to that of existing methods. Compared with the widely used dynamic frame slot ALOHA algorithm – adopted by EPC_C1 G2 standard – tag identification throughput performance increased by 50%.