基于分组的动态帧时隙ALOHA防碰撞算法研究

在RFID系统中,由标签引起的冲突一直是影响RFID系统性能的重要因素.为了进一步提高RFID系统中电子标签的识别效率,在对现有的ALOHA算法分析的基础上,提出了一种改进的分组动态帧时隙ALOHA算法.该算法通过改变标签分组的方法提高了阅读器识别标签的效率.当标签数量大于256时,该算法能有效地减少阅读器的识别时间,提高了RFID系统的标签识别效率.仿真结果表明:当标签数为1000时,该算法比基本帧时隙ALOHA算法和动态帧时隙ALOHA算法所用时隙数分别减少了43％和39％.     

一种改进的RFID动态帧时隙ALOHA算法

射频识别(RFID)系统中,存在多个电子标签同时响应读写器的可能性,这将使得电子标签产生碰撞现象。在对帧时隙ALOHA算法分析的基础上,提出了一种改进的RFID动态帧时隙ALOHA算法。该算法通过对读写器范围内的标签数进行估计,设置最佳帧长度,使RFID系统获得最大吞吐量,从而提高标签的识别效率。仿真结果表明:与传统ALOHA算法相比,性能有明显改善。     

基于汉明重分组的动态帧时隙ALOHA 防碰撞算法

针对射频识别(RFID)系统中标签较多时动态帧时隙 ALOHA 算法识别效率快速下降的问题,在动态帧时隙 ALOHA 算法的基础上,利用标签 ID 前 M位的汉明重量对阅读器范围内标签进行分组,提出了一种基于汉明重分组的动态帧时隙 ALOHA 算法(LGDFSA),并利用 MATLAB 对它进行了仿真模拟。仿真结果表明,LGDF-SA 算法与动态帧时隙 ALOHA 算法相比,当标签数较多时,系统吞吐量提高,并趋于稳定,总操作数有所减少,系统总体效率提高。     

基于Hash函数的RFID系统防碰撞算法的研究

防碰撞算法是RFID系统的关键技术之一;针对动态帧时隙ALOHA算法(EDFSA)的局限性,提出了一种基于Hash函数的防碰撞算法;在算法中,标签通过Hash函数选择时隙发送信息,阅读器通过精确的标签数目估计方法来动态改变帧长度,从而提高了系统识别效率;文中详细介绍了算法设计流程,通过建立数学模型对算法进行分析,证明了系统识别效率期望值突破了36.8%的限制,仿真实验进一步证明了该算法在识别大量标签时效率明显优于动态帧时隙ALOHA算法.     

基于分组动态帧时隙的RFID防碰撞算法

为了解决射频识别(RFID)系统中的多标签防碰撞问题,在分析帧时隙ALOHA算法的基础上,提出一种基于分组动态帧时隙的RFID防碰撞算法。当标签数量庞大时,该算法可以通过分组限制响应标签数量达到较高的识别效率。仿真结果表明,当标签数为1 000时,与传统算法相比,该算法能使时隙利用率提高80%以上。     

基于混合溢出树搜索的帧时隙ALOHA防碰撞算法

为提高射频识别系统中电子标签防碰撞算法的识别效率,提出了一种结合精确标签估计和混合溢出树搜索的帧时隙ALOHA算法。算法将识别过程分为标签估计和标签识别两个阶段。在标签估计过程中,通过精确估计标签数量来对初始帧时隙大小进行优化。在标签识别阶段,利用改进的混合溢出树搜索算法对时隙内的碰撞标签进行快速识别。实验结果表明,该算法能够有效地改善射频识别的防碰撞性能,提高RFID系统的标签识别效率。     

一种新的RFID混合防碰撞算法

针对射频识别（RFID）系统随机性防碰撞算法中标签识别效率低的问题,提出了一种新的RFID混合防碰撞算法。新算法采用帧时隙ALOHA（FSA）机制,根据碰撞时隙数直接估计出总的未识读标签数目,经多次动态调整帧长,获得最优帧长,然后使读写器按照最优帧长分配时隙以供标签响应,在碰撞时隙内调用自适应搜索矩阵（ASM）算法对响应标签进行识别。理论研究和仿真表明,新算法有效实用,可有效提高系统性能,使时隙吞吐量达到40%以上。     

嵌入式无线频率识别设备的设计与实现

为了降低RFID系统标签的冲突几率,优化RFTD系统的效率,设计并实现了一个基于XScale处理器的嵌入式无线频率识别设备(radio frequency identification device)的读写器系统.该系统的RFID阅读器封装了底层的硬件驱动,功能模块扩展方便,实现了对电子标签的识别功能.该系统优化了基于动态帧时隙ALOHA防冲突算法,有效地避免了电子标签数据冲突,降低了RFID系统中数据碰撞的概率,提高了电子标签系统的识别效率和稳定性.实验数据表明了基于动态帧时隙ALOHA防冲突算法的有效性.     

面向EPC Gen2标准的RFID标签分组多位隙并行识别协议

在分析EPCglobal UHF class1 generation2和基于DFSA协议的高速标签识别算法的基础上,采用位隙FSA协议标签响应标志位隙的设置方法,通过在标签上设置一个组位隙响应标志字,提出了一种EPC Gen2 标准下的RFID标签分组多位隙并行识别协议GMBPIP,设计了一条新的分组查询命令和基于DFSA的多组标签并行识别协议流程,从理论上了分析GMBPIP协议的性能,并使用EPC Gen2 标准协议时间参数进行了仿真实验。结果表明,GMBPIP协议在不增加标签太多计算负担的情况下,能够在EPC Gen2标准下有效降低时隙空闲率和冲突率,提高了标签的识别率、时隙利用率;平均识别率不仅突破了帧时隙ALOHA协议最高36.8%的瓶颈,而且高于目前文献所述同类算法的性能指标,达到了70.95%~81.61%。GMBPIP可以作为低成本RFID系统高速识别大量被动标签的支撑协议。     

一种基于时隙ALOHA的RFID系统防碰撞算法

防碰撞算法是RFID系统中的关键技术.针对防碰撞算法中ALOHA算法的局限性,本文提出的一种改进的基于帧-时隙ALOHA法的防碰撞算法,通过限制响应标签的数量,降低了冲突发生的可能性,提高了标签的识别效率.通过一系列的仿真实验,证明了本文所提出算法的优越性.     

Efficient detection of counterfeit products in large-scale RFID systems using batch authentication protocols

RFID technology facilitates processing of product information, making it a promising technology for anti-counterfeiting. However, in large-scale RFID applications, such as supply chain, retail industry, pharmaceutical industry, total tag estimation and tag authentication are two major research issues. Though there are per-tag authentication protocols and probabilistic approaches for total tag estimation in RFID systems, the RFID authentication protocols are mainly per-tag-based where the reader authenticates one tag at each time. For a batch of tags, current RFID systems have to identify them and then authenticate each tag sequentially, one at a time. This increases the protocol execution time due to the large volume of authentication data. In this paper, we propose to detect counterfeit tags in large-scale system using efficient batch authentication protocol. We propose FSA-based protocol, FTest, to meet the requirements of prompt and reliable batch authentication in large-scale RFID applications. FTest can determine the validity of a batch of tags with minimal execution time which is a major goal of large-scale RFID systems. FTest can reduce protocol execution time by ensuring that the percentage of potential counterfeit products is under the user-defined threshold. The experimental result demonstrates that FTest performs significantly better than the existing counterfeit detection approaches, for example, existing authentication techniques.     

一种单阅读器移动RFID系统性能评估方法

中小型区域RFID标签的识别通常采用阅读器网路实现,因为只有多阅读器才能静态实现阅读器对所有待识别标签的全覆盖。但这种方法面临阅读器使用成本高,阅读器间碰撞,标签识别率低等问题。为改善上述问题,提出一种运用于中小型区域的单阅读器移动RFID系统性能评估方法,该方法以标签丢失率和全识别圈数作为性能指标,在单阅读器移动RFID系统中对已有的静态防碰撞算法的性能进行评估。实验通过判断当前时隙类型确定阅读器是否成功识别标签,每消耗1个时隙阅读器位置调整一次使得信号区及其区内标签重新确定,直至阅读器结束标签识别任务。仿真结果表明该方法能很好地对各种已有标签算法在中小型区域的RFID标签识别环境中的性能进行有效评估,同时提高RFID系统效率。     

移动物联网的可定制RFID网络安全协议

已有的RFID安全协议大多针对隐私性与匿名性而忽略了可扩展性与可定制性,对此提出一种可扩展且可定制的RFID双向认证协议.首先,目标认证模块分别对标签与客户端阅读器进行认证,其中分别使用基于线性搜索的标签分组以及一个映射表提高认证的效率;然后,通过简单的ID匹配机制检测恶意用户;最终,通过标签与服务器的交互认证实现双向认证过程,进一步提高安全性.分析结果表明,本算法在具有可定制能力与可扩展能力的前提下,且具有较好的计算效率与安全性.     

基于动态概率路径事件模型的RFID数据填补算法

RFID 数据采集过程中漏读现象频频发生,降低了RFID(radio frequency identification)应用中查询结果的准确性.目前解决漏读问题的算法主要是以RFID 原始读数为粒度,并基于标签自身历史读数进行窗口平滑,这种作法会填补许多与查询无关的冗余数据,并且在多逻辑区域参与的复杂应用中,填补准确率较差.为解决上述问题,首次将RFID数据从数据层抽象到逻辑区域层作为处理的粒度,提出3 种基于动态概率路径事件模型的数据填补算法,通过挖掘已知的区域事件的顺序相关性来对后续发生的事件进行判断     

Unbalanced states violates RFID privacy

Designing privacy preserving authentication protocols for massively deployed Radio Frequency IDentification (RFID) systems is a real world challenge that have drawn significant attention from RFID community. This interest yields considerable amount of proposals targeting to overcome the main bottleneck (i.e. the exhaustive search over the list of all tag entries) which appears in the back-end database for large-scale RFID tag deployments. A class of these proposals contains RFID protocols where the server authenticates the tag in a negligible constant/sub-linear time for a more frequent normal state and needs a linear search in a rare abnormal states. In this study, however, we show that such protocols having unbalanced states are subject to side-channel attacks and do not preserve the RFID privacy. To illustrate this brutal security flaw, we conduct our analysis on different RFID protocols.     

Secure and private search protocols for RFID systems

In many real world applications, there is a need to search for RFID tagged items. In this paper, we propose a set of protocols for secure and private search for tags based on their identities or certain criteria they must satisfy. When RFID enabled systems become pervasive in our life, tag search becomes crucial. Surprisingly, the problem of RFID search has not been widely addressed in the literature. We analyzed the privacy and security features of the proposed tag search protocols, and concluded that our protocols provide tag identity privacy, tag source location privacy, and tag-reader communication privacy. For the first time, we propose a formal method to securely search RFID tags which satisfy certain search criteria.     

Tag-Splitting: Adaptive Collision Arbitration Protocols for RFID Tag Identification

Tag identification is an important tool in RFID systems with applications for monitoring and tracking. A RFID reader recognizes tags through communication over a shared wireless channel. When multiple tags transmit their IDs simultaneously, the tag-to-reader signals collide and this collision disturbs a reader's identification process. Therefore, tag collision arbitration for passive tags is a significant issue for fast identification. This paper presents two adaptive tag anticollision protocols: an Adaptive Query Splitting protocol (AQS), which is an improvement on the query tree protocol, and an Adaptive Binary Splitting protocol (ABS), which is based on the binary tree protocol and is a de facto standard for RFID anticollision protocols. To reduce collisions and identify tags efficiently, adaptive tag anticollision protocols use information obtained from the last process of tag identification. Our performance evaluation shows that AQS and ABS outperform other tree-based tag anticollision protocols.     

Cover4

Tag identification is an important tool in RFID systems with applications for monitoring and tracking. A RFID reader recognizes tags through communication over a shared wireless channel. When multiple tags transmit their IDs simultaneously, the tag-to-reader signals collide and this collision disturbs a reader's identification process. Therefore, tag collision arbitration for passive tags is a significant issue for fast identification. This paper presents two adaptive tag anticollision protocols: an adaptive query splitting protocol (AQS), which is an improvement on the query tree protocol, and an adaptive binary splitting protocol (ABS), which is based on the binary tree protocol and is a de facto standard for RFID anticollision protocols. To reduce collisions and identify tags efficiently, adaptive tag anticollision protocols use information obtained from the last process of tag identification. Our performance evaluation shows that AQS and ABS outperform other tree-based tag anticollision protocols     

能抵抗拒绝服务攻击且高效的RFID安全认证协议

针对现有的RFID认证协议所面临的安全隐私保护问题,利用Hash函数加密的方法,提出了一种能抵抗拒绝服务攻击且高效的RFID安全认证协议。通过在阅读器上进行随机数的比较与识别,从而使该协议可抵抗拒绝服务攻击,并且在后台数据库中存储标签标识符的两种状态,以便实现电子标签与后台数据库的数据同步。从理论上分析了协议的性能和安全性,并利用BAN逻辑对协议的安全性进行了形式化证明。分析结果表明,该协议能够有效地实现阅读器和电子标签之间的相互认证,能有效地抵抗拒绝服务攻击且与其他协议比较,整个RFID系统的计算量减小,适用于大规模使用标签的RFID系统。     

An efficient and secure authentication protocol for RFID systems

The use of radio frequency identification (RFID) tags may cause privacy violation of users carrying an RFID tag. Due to the unique identification number of the RFID tag, the possible privacy threats are information leakage of a tag, traceability of the consumer, denial of service attack, replay attack and impersonation of a tag, etc. There are a number of challenges in providing privacy and security in the RFID tag due to the limited computation, storage and communication ability of low-cost RFID tags. Many research works have already been conducted using hash functions and pseudorandom numbers. As the same random number can recur many times, the adversary can use the response derived from the same random number for replay attack and it can cause a break in location privacy. This paper proposes an RFID authentication protocol using a static identifier, a monotonically increasing timestamp, a tag side random number and a hash function to protect the RFID system from adversary attacks. The proposed protocol also indicates that it requires less storage and computation than previous existing RFID authentication protocols but offers a larger range of security protection. A simulation is also conducted to verify some of the privacy and security properties of the proposed protocol.