Instant collision resolution for tag identification in RFID networks

In this paper, we approach the problem of identifying a set of objects in an RFID network. We propose a modified version of Slotted Aloha protocol to reduce the number of transmission collisions. All tags select a slot to transmit their ID by generating a random number. If there is a collision in a slot, the reader broadcasts the next identification request only to tags which collided in that slot. Besides, we present an extensive comparative evaluation of collision resolution protocols for tag identification problem in RFID networks. After a quick survey of the best performing RFID tag identification protocols, both deterministic and probabilistic, we present the outcome of intensive simulation experiments set up to evaluate several metrics, such as the total delay of identification process and the bit complexity of reader and tags. The last metric is strictly related to energy constraints required by an RFID system. The experiments point out that our protocol outperform all the other protocols in most cases, and matches them in the others.     

Comparison of energy consumption for reader anti-collision protocols in dense RFID networks

Wireless Networks - Radio-frequency identification (RFID) is known as a universal technology and has been in the center of attention in the past few years. Readers and tags constitute the main...     

物理层的超高频RFID标签信号分离

提出一种分离冲突信号算法,先用动尺度变换将冲突信号变换至时—尺域并得到变换矩阵,然后由最小二乘和最小均方误差准则将冲突信号分离以检测标签信号。仿真结果表明,相比传统标签分离方法,所提方法仅采用单接收天线就可分离2个以上冲突标签信号,并在无捕获效应下也具有良好分离性能。     

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.     

A new anti‐collision algorithm for RFID tag

We present a new radio frequency identification tag anti‐collision algorithm in this paper. The main idea of this algorithm is that we should find the collided bit at first, and every tag contains a register RC, which has length the same as the tag's ID length to store the conflict bit, then all the subsequent processing are based on the conflict bit. In this new algorithm, tag uses a binary pulse string to transfer data to the reader, compared with the traditional query tree‐based algorithms, which is based on the tag's ID; this new algorithm is more efficient and requires fewer read cycles for tag's identification. Copyright © 2013 John Wiley & Sons, Ltd.     

Interleaving collision resolution engines in n-ary tree protocols

N-ary tree protocols are used for access control on shared channels to resolve collisions among channel users. For exercising a single collision resolution engine (CRE), the throughput and latency of such protocols have been comprehensively studied. This study investigates the same protocols with multiple interleaved CREs in slotted networks. Power, defined as the ratio of throughput over latency, is measured as the criteria to launch or terminate CREs. Analysis results indicate that the appropriate number of CREs to trigger depends on the traffic load and the collision resolution protocol. As the load grows to 0.25, 0.35, 0.5, and 0.8, the optimal number of interleaved CREs becomes 2, 3, 5, and 8, respectively. Moreover, the power of n-ary tree protocol with n determined dynamically outperforms the 3-ary tree protocol by 13%     

A fast tag identification anti‐collision algorithm for RFID systems

In this work, we propose a highly efficient binary tree‐based anti‐collision algorithm for radio frequency identification (RFID) tag identification. The proposed binary splitting modified dynamic tree (BS‐MDT) algorithm employs a binary splitting tree to achieve accurate tag estimation and a modified dynamic tree algorithm for rapid tag identification. We mathematically evaluate the performance of the BS‐MDT algorithm in terms of the system efficiency and the time system efficiency based on the ISO/IEC 18000‐6 Type B standard. The derived mathematical model is validated using computer simulations. Numerical results show that the proposed BS‐MDT algorithm can provide the system efficiency of 46% and time system efficiency of 74%, outperforming all other well‐performed algorithms.     

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     

Differential RCS of RFID tag

The differential radar cross-section (RCS) of an RFID tag is an important parameter which determines the power of the modulated backscattered tag signal. The vector differential RCS of an RFID tag as seen by the reader is analysed and, for the first time, compared with experimental results in UHF band     

Design of MAC protocols with fast collision resolution for wireless local area networks

Development of efficient medium access control (MAC) protocols providing both high throughput performance for data traffic and good quality of service (QoS) support for real-time traffic is the current major focus in distributed contention-based MAC protocol research. In this paper, we propose an efficient contention resolution algorithm for wireless local area networks, namely, the fast collision resolution (FCR) algorithm. The MAC protocol with this new algorithm attempts to provide significantly higher throughput performance for data services than the IEEE 802.11 MAC algorithm and more advanced dynamic tuning backoff (DTB) algorithm. We demonstrate that this algorithm indeed resolves collisions faster and reduces the idle slots more effectively. To provide good fairness performance and to support good QoS for real-time traffic, we incorporate the self-clocked fair queueing algorithm and a priority scheme into the FCR algorithm and come up with the real-time FCR (RT-FCR) algorithm, and show that RT-FCR can simultaneously achieve high throughput and good fairness performance for nonreal-time traffic while maintaining satisfactory QoS support for real-time traffic.     

A study of the energy consumption characteristics of cryptographic algorithms and security protocols

Security is becoming an everyday concern for a wide range of electronic systems that manipulate, communicate, and store sensitive data. An important and emerging category of such electronic systems are battery-powered mobile appliances, such as personal digital assistants (PDAs) and cell phones, which are severely constrained in the resources they possess, namely, processor, battery, and memory. This work focuses on one important constraint of such devices-battery life-and examines how it is impacted by the use of various security mechanisms. In this paper, we first present a comprehensive analysis of the energy requirements of a wide range of cryptographic algorithms that form the building blocks of security mechanisms such as security protocols. We then study the energy consumption requirements of the most popular transport-layer security protocol: Secure Sockets Layer (SSL). We investigate the impact of various parameters at the protocol level (such as cipher suites, authentication mechanisms, and transaction sizes, etc.) and the cryptographic algorithm level (cipher modes, strength) on the overall energy consumption for secure data transactions. To our knowledge, this is the first comprehensive analysis of the energy requirements of SSL. For our studies, we have developed a measurement-based experimental testbed that consists of an iPAQ PDA connected to a wireless local area network (LAN) and running Linux, a PC-based data acquisition system for real-time current measurement, the OpenSSL implementation of the SSL protocol, and parameterizable SSL client and server test programs. Based on our results, we also discuss various opportunities for realizing energy-efficient implementations of security protocols. We believe such investigations to be an important first step toward addressing the challenges of energy-efficient security for battery-constrained systems.     

RFID标签中有机补偿电路的设计

当前RFID标签技术有着极为广泛的应用,为了减少RFID标签的制造成本和提高工作的可靠性,提出了一种有机补偿电路。该电路集成了8个阶段的有机整流器,其最高工作频率可以达到14 MHz,以及一个集成的PUF结构,它产生一个不可克隆的随机码,每一个独立的结构生成自己的代码,并可以准确地从其他电路中识别出来,耦合这两个电路以及天线将可以建立一个RFID无源标签。该方案可以应用于塑料薄膜中逐片有机处理的RFID标签中,方便设计和制造出复杂的全有机电路。     

一种UHFRFID系统宽带标签天线的设计

基于微带天线结构,设计了一款适用于整个UHF RFID系统的新型宽带标签天线。在H型贴片上开H槽,形成了两个相近的谐振点,调整H槽的位置和大小,使两个谐振点靠近耦合,从而拓展了天线带宽。通过改变贴片底部矩形槽深度和微带线长度调整天线的输入阻抗。使用软件HFSS14.0进行仿真分析。结果表明,该天线具有很好的宽频特性(766～989 MHz,回波损耗S11<10 dB),在超高频段(840～960 MHz)内具有良好的阻抗匹配特性。     

一种可穿戴的UHF RFID标签弯折天线设计(重新投稿)

针对可穿戴的人体跟踪以及监测问题,提出了一种小型的纺织RFID标签弯折天线,该天线主要由导电线绣成的四个字母文本构成,具有文本弯折的几何结构以及锯齿形穿线结构,天线尺寸较小,即：65 mm × 24 mm × 0.46 mm,与普通文字标签的尺寸相似。并对该标签进行了优化,以便在工作频率（即：910 MHz）条件下与RFID芯片阻抗实现共轭匹配。最后,利用双端口差分探头对若干标签进行了测量,该探头适用于平衡的RFID标签结构。在测试实验中,对带有不同线迹图案以及各种导电线直径的标签进行了检测,实验结果表明,提出标签阻抗的实测结果与模拟结果基本吻合,证明了提出标签设计和测量方法的有效性。     

UHF频段金属型标签天线的研究与设计

随着天线技术的发展,时UHF RFID可用于金属物体的标签天线的研究成为了热点和难点.根据当前标签天线的设计特点和设计原则,设计出一种适用于845～960MHz的宽频带可用于金属物体的新型标签天线,并通过仿真分析与计算确定了天线的一些重要参量,实现了标签天线输入阻抗能在较大范围内与更多阻抗不同的标签芯片进行匹配.实测结果与仿真结果基本一致,抗金属性能稳定,天线尺寸较小,通信距离较远.     

Analysis of energy consumption for multiple object identification system with active RFID tags

Radio frequency identification (RFID) systems are very effective for identifying objects. Existing published works focus on designing efficient collision resolution protocols for the tag identification problem in RFID systems with passive RFID tags. However, advances in low‐cost and low‐power sensing technologies will make active RFID tags more popular and affordable in the near future. In multiple object identification systems with active tags, the tags are designed for extremely low‐cost large‐scale applications such that battery replacement is not feasible. This imposes a critical energy‐constraint on the communication protocols used in these systems. In this paper, we analyze energy consumption and identification times for several protocols. The objective is to decrease energy consumption of tags by reducing both the total identification time and the total active time. Copyright © 2007 John Wiley & Sons, Ltd.     

Analysis and design of power efficient semi-passive RFID tag

The analysis and design of a semi-passive radio frequency identification(RFID) tag is presented.By studying the power transmission link of the backscatter RFID system and exploiting a power conversion efficiency model for a multi-stage AC-DC charge pump,the calculation method for semi-passive tag's read range is proposed.According to different read range limitation factors,an intuitive way to define the specifications of tag's power budget and backscatter modulation index is given.A test chip is implemen...     

高能效半有源射频识别标签的分析与设计

本文介绍了一款半有源射频识别标签的分析与设计。通过将多级AC-DC电荷泵的能量转换效率模型引入到反向散射射频识别系统的功率传输链路中,本文给出了计算半有源标签最大读写距离的数学方法,以及当读写距离限制因素改变时,制定标签功耗设计指标和反向散射调制系数的方法。在理论分析的指导下,本文设计了一颗半有源标签的测试芯片,芯片采用SMIC 0.18 μm标准CMOS工艺流片实现。主要的功能模块包括了一个采用阈值补偿技术的电荷泵和采用功率唤醒模式的低功耗唤醒电路。本文设计的半有源标签完全兼容EPC C1G2标准,芯片面积为0.54 mm2,支持输出电压在1.2到2.4 V范围内的电池。     

一种小型UHF RFID抗金属标签天线的设计

针对射频识别标签天线小型化、抗金属环境的实际需求,提出了一种可应用于金属环境的超高频射频识别标签天线.通过在矩形贴片上开槽来实现小型化,天线总尺寸为56 mm×50 mm×1.6 mm.通过改变槽的尺寸调节标签天线的输入阻抗,结合等效电路图分析抗金属标签天线的设计过程,从而方便地实现与标签芯片的共轭匹配.实验结果表明,实测和仿真结果比较吻合,标签阻抗匹配良好,实测最大读取距离达3.1m.与其他标签天线相比,该天线具有结构简单、成本低、易于实现和读取距离远等优势.