A Pair-Resolution Blocking Algorithm on Adaptive Binary Splitting for RFID Tag Identification

For RFID tag identification, this research proposes a novel anti-collision method, the Pair-Resolution Blocking algorithm (PRB). It inherits the essence of a previous algorithm, the Adaptive Binary Splitting algorithm (ABS), and thus uses the information of recognized tags obtained from the last process of tag identification. Furthermore, PRB adopts a blocking technique which prevents recognized tags from being collided by unrecognized tags and utilizes a pair resolution technique which couples recognized tags to significantly reduce the identification delay. The analytical and simulation results show that PRB significantly outperforms ABS.     

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).     

Two Blocking Algorithms on Adaptive Binary Splitting: Single and Pair Resolutions for RFID Tag Identification

In radio frequency identification (RFID) systems, the reader identifies tags through communication over a shared wireless channel. When multiple tags transmit their IDs simultaneously, their signals collide, increasing the identification delay. Therefore, many previous anti-collision algorithms, including an adaptive query splitting algorithm (AQS) and an adaptive binary splitting algorithm (ABS), focused on solving this problem. This paper proposes two blocking algorithms, a single resolution blocking ABS algorithm (SRB) and a pair resolution blocking ABS algorithm (PRB), based on ABS. SRB not only inherits the essence of ABS which uses the information of recognized tags obtained from the last process of tag identification, but also adopts a blocking technique which prevents recognized tags from being collided by unrecognized tags. PRB further adopts a pair resolution technique which couples recognized tags and thus only needs half time for next identifying these recognized tags. We formally analyze the performance of SRB and PRB. Finally, the analytic and simulation results show that SRB slightly outperforms ABS and PRB significantly surpasses ABS.     

An Efficient Anti-collision Protocol for Fast Identification of RFID Tags

Tag collision prevention/resolution for radio frequency identification (RFID) tags is one of the most significant issues for fast tag identification. This paper proposes a new anti-collision protocol that has objective of minimizing the tag identification delay. The proposed scheme reduces the tag collisions by allocating exclusive timeslot to each tag using identified timeslot information. Performance evaluation based on numerical and simulation results shows that the proposed anti-collision method improves RFID identification performance.     

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

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

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

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

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

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

A Collision Arbitration Protocol Based on Specific Selection Function

Fast and eff ective identifications of a large number of items are required in many Radio-frequency identification (RFID) applications. Simultaneous responses from multiple tags are corrupted by collisions and thus re-sult in low identification efficiency. To address the prob-lem of low identification eifficiency, many existing tag anti-collision algorithms try to schedule the identification pro-cess to avoid collisions. A novel anti-collision scheme based on specific selection function is presented, in which tags pick a slot according to a selection function instead of be-ing randomly assigned to slots within a frame. If collision occurs, the reader sends the custom command SETBM ac-cording to the collision information. When probed by the SETBM, the tags apply the selection function to its partial ID and send the mapped result to the reader. According to the mapped result, the reader assigns the time slot to the tags. All tags collided in the same slot will be identified by the tree traversal scheme. Compared to the most of exist-ing anti-collision algorithms, simulation results show that our proposed algorithm can achieve better performance in terms of identification efficiency, time efficiency, and en-ergy consumption.     

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多标签防碰撞算法

在射频识别系统中,需要一种防碰撞算法使阅读器在可读范围内快速地识别出所有标签。提出了一种改进的ID预测算法以解决标签碰撞问题。该算法的最大特点是：阅读器向标签发出一次询问命令,有可能同时识别多个标签。此算法能有效地减少阅读器发送询问指令的次数,从而缩短识别出所有标签的时间。     

基于CDMA技术的新型防碰撞算法

标签碰撞是射频识别（RFID）技术的常见问题,该问题影响了RFID系统通信过程中数据传输的完整性.在分析已有防碰撞方法的基础上,根据帧时隙分组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.     

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%.     

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

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

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

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

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

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

LRST：低冗余搜索树防碰撞算法

针对RFID标签防碰撞树型算法在识别过程中因询问命令过多、过长而产生大量冗余数据导致通信开销过大的问题,在后退式动态搜索树算法的基础上提出一种低冗余搜索树防碰撞算法（LRST）：为减少询问次数,提出了“一问两答”询问方式,即碰撞标签根据最高碰撞位比特分别在第一个时隙或第二个时隙响应;为减小询问命令的长度,用计数器替代标签中的前缀匹配电路,使算法不再需要前缀作为询问命令的标识参数;此外,提出的预测识别和标签屏蔽机制可节省不必要的询问。理论分析和仿真结果表明,通信开销大大降低。     

A Novel RFID Tag Identification Protocol: Adaptive n-Resolution and k-Collision Arbitration

Since radio frequency identification (RFID) technology has become increasingly common in numerous applications, including large-scale supply chain management, improving the efficiency of RFID tag identification is an important task. In practical settings, the identification of RFID tags often occurs in a dynamic environment, in which tags move through a specific interrogation range. However, the literature contains few studies on the design of efficient identification protocols in dynamic environments. This study proposes a novel tag identification protocol that is particularly efficient in dynamic environments. the proposed protocol involves two anti-collision techniques: adaptive n-Resolution (AnR) and k-Collision Arbitration (kCA). These two techniques significantly improve the tag identification delay and communication overhead. This improvement is primarily due to the use of a newly designed challenge-response bit sequence mechanism and the information obtained from the previous tag identification procedure. As a result, AnR requires only a constant number of interrogation times regardless of the number of target tags, while kCA further improves the efficiency of tag identification with \(k\) -splitting collision arbitration. Rigorous analysis and simulation experiments show that this tag identification protocol significantly outperforms related methods (by at least 48.85 % identification delay and 23.87 % communication overhead can).     

分组N叉跟踪树型RFID防碰撞算法研究

针对无线射频识别(RFID,Radio Frequency Identification)标签多路访问产生的信号碰撞问题,提出了基于碰撞位跟踪的分组N叉跟踪树型RFID防碰撞算法(CBGN,Collision Bit Tracking Tree Algorthm Based on Grouping N-ray).利用极大似然位估算法(MLE,Maximum Likelihood Bit Estimation)估算应用环境下标签的数量.在MLE基础上根据标签标识(ID)将标签分配在不同分组内,并利用N叉树识别分组后的标签,CBGN算法通过分组及N叉识别两种策略相结合来降低碰撞概率及识别延时.最后,以通信复杂度为基准对不同N叉树下的最优分组系数进行了推导,从而获得最优N值及对应分组系数.理论分析和仿真实验表明,CBGN算法具有鲁棒性好和通信复杂度低的特点.     

可并行识别的分组动态帧时隙ALOHA标签防碰撞算法

该文针对现有动态帧时隙ALOHA标签防碰撞算法的系统吞吐率低、算法效率低等问题,提出一种可并行识别的分组动态帧时隙ALOHA(PIGDFSA)标签防碰撞算法。该文以实验为基础,探索了待识别标签数、标签分组数、帧长对系统吞吐率与标签碰撞率的影响,研究了提升系统吞吐率与降低标签碰撞率的策略与方法。结合射频识别(RFID)的多天线系统,引入FastICA技术,从而实现碰撞时隙重新定义,并以此为基础,利用未识别标签数目自适应确定分组数与帧长。仿真结果表明:PIGDFSA算法在标签数达到2000时,算法吞吐率仍能稳定在92%以上,与FSA-256, GDFSA, BSDBG等算法相比具有更高的算法吞吐率,更少的空隙时隙,更高的算法效率。