【作者】 陈中平；

【导师】 王玉皞； 王晖；

【作者基本信息】 南昌大学 ， 电子与通信工程， 2012， 硕士

【摘要】 无线射频识别技术(Radio Frequency Identification,简写作RFID)是一种非接触的自动识别技术。RFID技术革新了追踪产业的发展,它的应用十分广阔。目前,这些应用发展迅速并且越发高效、节能,所以,随着日益增多的标签产品出现,标签读取技术前景宽广。然而,实际上标签读取协议仍面临许多问题。一个主要的难题是标签碰撞,当多个标签同时对一个阅读器产生响应时就会碰撞。在这种情况下,RFID阅读器的标签读取能力低下,并且能耗过多。本文围绕RFID系统标签防碰撞算法展开研究分析。首先分析其研究背景。之后对国内外的研究现状进行分析。再在简单介绍RFID系统结构、工作流程的基础上,重点讨论目前RFID防碰撞算法,对Aloha算法,树型算法及混合型算法进行分析比较。进一步对目前常用的标签防碰撞算法进行仿真分析,在分析已有的防碰撞算法基础上提出一种新算法——基于碰撞反演的混合型算法,并通过MATLAB加以仿真分析及验证。基于碰撞反演的混合型算法充分利用了Aloha算法和树型算法的优点,即结合了Aloha的时隙机制,又采用了树型的碰撞反演。新算法的特点是结合码表的使用,充分利用碰撞,以对后续的时隙进行合理的规划,从而减少碰撞。针对空闲时隙的处理,本算法采用了“提前结束”的方式,减少了空闲时隙的耗时,加快了标签的接入速度。最后通过仿真实验表明,新算法在标签数较多的情况下的确优于目前主流常用的算法,确实加快了标签接入的速度。更多还原

【Abstract】 Technology of Radio Frequency Identification (RFID) is non-contact and automatic identification. RFID technologies have innovated the tracking industry, and applications is very broad. Facing more and more tag numbers, the promise of tag reading is brightly, especially these applications are so fast and energy efficient. In fact, tag reading algorithms face many problems. A key one being tag collision, which occurs when multiple tags reply simultaneously to a reader. In this case, an RFID reader experiences low tag reading performance, and wastes valuable energy.This thesis focus on researching tag’s an-collision algorithm of RFID system. Firstly, it introduces researching background. At the second place, analying domestic and international present condition of research. Then based on simply introducing the RFID-system’s structure and working process, it mainly discuss RFID an-collision protocols at present. At the same time, making a comparison of aloha algorithm, tree algorithm and hybrid algorithm. Further more, to analysis the common tag an-collision algorithm from simulation. And from this, we present an improved protocol----hybrid algorithm of collision inversion, and through the MATLAB simulation to analysis and test it.Hybrid algorithm of collision inversion makes full use of the advantages of aloha algorithm and tree algorithm, which combines time mechanism of aloha, and collision inversion of the other. Particularly, because of the code table, it can make full use of the former collision to arrange subsequent slots and reduce collisions. Dealing with the idle slots, this algorithm adapt "early end", which can speed up the tag access, to reduce the time of idle slots. Finally, simulation experiments show that the new one is better than the common algorithms, and is really accelerating the access speed.更多还原