【摘要】：射頻識(shí)別技術(shù)(RFID)是從八十年代發(fā)展起來(lái)的自動(dòng)識(shí)別的技術(shù)，是物聯(lián)網(wǎng)技術(shù)中重要組成部分，可以應(yīng)用于廣泛地各個(gè)領(lǐng)域。現(xiàn)在己廣泛應(yīng)用于監(jiān)控識(shí)別、智能交通，物流管理、工業(yè)、醫(yī)學(xué)、防盜等各個(gè)領(lǐng)域，近幾年物聯(lián)網(wǎng)技術(shù)和應(yīng)用的發(fā)展迅速，作為物聯(lián)網(wǎng)關(guān)鍵核心技術(shù)的RFID識(shí)別技術(shù)己成為國(guó)內(nèi)外研究的熱點(diǎn)。 RFID技術(shù)的特性包括：非接觸特性、識(shí)別高速運(yùn)動(dòng)的目標(biāo)，多個(gè)遠(yuǎn)距離標(biāo)簽可同時(shí)識(shí)別，其中自身攜帶電池的有源RFID標(biāo)簽，能夠支持遠(yuǎn)距離的信息通信，大數(shù)據(jù)量傳輸，較小的發(fā)射功率等優(yōu)點(diǎn)，因此擁有非常廣闊應(yīng)用領(lǐng)域，特別應(yīng)用于大型貴重物品或者危險(xiǎn)物品監(jiān)控和識(shí)別方面。針對(duì)有源標(biāo)簽組成RFID系統(tǒng)中，最大限度地減少識(shí)別時(shí)間，實(shí)現(xiàn)有源標(biāo)簽的低能量消耗，提高標(biāo)簽存在性檢測(cè)效率，是標(biāo)簽檢測(cè)算法值得研究的一個(gè)熱點(diǎn)問(wèn)題。 本文簡(jiǎn)單介紹了本課題的研究背景和意義、RFID技術(shù)的系統(tǒng)工作原理等相關(guān)的知識(shí)，本文針對(duì)標(biāo)簽存在性問(wèn)題進(jìn)行了深入的研究，以提高標(biāo)簽檢查效率，減少有源標(biāo)簽電量消耗為基礎(chǔ)，主要從兩個(gè)方面進(jìn)行了改進(jìn)：多閱讀器系統(tǒng)中閱讀器并行工作沖突問(wèn)題和檢測(cè)過(guò)程中標(biāo)簽?zāi)芰肯暮托蕟?wèn)題。 多閱讀器并行工作時(shí)閱讀器讀取范圍存在交叉碰撞問(wèn)題，解決閱讀器沖突碰撞問(wèn)題一直是RFID技術(shù)研究的熱點(diǎn)。本文基于粒子群算法和圖著色算法相結(jié)合的分布式防沖突算法進(jìn)行的改進(jìn)，中心思想是服務(wù)器根據(jù)閱讀器估計(jì)標(biāo)簽數(shù)量，實(shí)時(shí)的優(yōu)化和更新閱讀器時(shí)間段分配，新算法最大化利用閱讀器網(wǎng)絡(luò)的時(shí)隙，減少了系統(tǒng)時(shí)隙資源浪費(fèi)，最終提高了系統(tǒng)識(shí)別的整體效率。 RFID系統(tǒng)中標(biāo)簽識(shí)別技術(shù)是RFID技術(shù)的關(guān)鍵技術(shù)。傳統(tǒng)的自動(dòng)識(shí)別技術(shù)通過(guò)收集所有標(biāo)簽標(biāo)識(shí)號(hào)，并與系統(tǒng)數(shù)據(jù)庫(kù)中存儲(chǔ)的標(biāo)簽集合進(jìn)行對(duì)比來(lái)判斷標(biāo)簽存在性問(wèn)題。但是這類方法識(shí)別效率很低，而且針對(duì)有源標(biāo)簽消耗自身電量偏高。針對(duì)以上問(wèn)，本文在多閱讀器并行基礎(chǔ)上提出了一種新標(biāo)簽檢測(cè)算法HPL，算法是基于幀時(shí)隙協(xié)議的改進(jìn)，主要內(nèi)容是閱讀器發(fā)射查詢幀時(shí)攜帶一個(gè)隨機(jī)數(shù)Q，標(biāo)簽通過(guò)Q值選擇一個(gè)時(shí)隙回復(fù)一個(gè)比特位，閱讀器通過(guò)一個(gè)固定的輪詢周期，完成一次識(shí)別過(guò)程，，根據(jù)回復(fù)信息形成了一個(gè)矩陣來(lái)判斷標(biāo)簽的存在性。 本文的算法經(jīng)過(guò)理論分析和仿真證明，本文基于粒子群算法和圖著色算法相結(jié)合的分布式防沖突算法進(jìn)行的改進(jìn)，減低了標(biāo)簽的識(shí)別時(shí)間，提高了系統(tǒng)吞吐率。和傳統(tǒng)的基于標(biāo)簽標(biāo)識(shí)號(hào)的檢測(cè)算法相比較，本文提出的HPL（Hash polling Detection）算法在標(biāo)簽?zāi)芰肯纳峡山档鸵粋�(gè)數(shù)量級(jí)，同時(shí)縮短了算法的執(zhí)行時(shí)間。和目前最好的迭代ID-free協(xié)議檢測(cè)算法相比較，HPL算法在標(biāo)簽?zāi)芰肯纳峡山档腿齻�(gè)數(shù)量級(jí)，并且也縮短了算法的執(zhí)行時(shí)間。
[Abstract]:Radio frequency identification technology (RFID) is an automatic identification technology developed from 1980s. RFID is an important part of Internet of things technology and can be used in a wide range of fields. Now it has been widely used in monitoring and identification, intelligent transportation, logistics management, industry, medicine, anti-theft and other fields. In recent years, the technology and application of the Internet of things has developed rapidly. As the key core technology of the Internet of things, RFID identification technology has become a hot research topic at home and abroad. The characteristics of RFID technology include: non-contact characteristics, identification of high-speed moving targets, multiple remote tags can be identified at the same time, in which the active RFID tags carrying batteries can support long-distance information communication, large amount of data transmission, Because of the advantages of small transmission power, it has a very wide range of applications, especially in the monitoring and identification of large valuables or dangerous goods. Aiming at the RFID system composed of active tags, it is a hot issue that label detection algorithm is worth studying to minimize the recognition time, realize the low energy consumption of active tags and improve the efficiency of tag existence detection. This paper briefly introduces the research background and significance of this subject, the system working principle of RFID technology and so on. In this paper, the problem of label existence is deeply studied in order to improve the efficiency of label checking. On the basis of reducing the power consumption of active tags, it is mainly improved from two aspects: the parallel working conflict of readers in multi-reader system and the energy consumption and efficiency of tags in the process of detection. There is a cross-collision problem in the reader reading range when multiple readers work in parallel, and solving the reader collision problem has always been the focus of RFID technology research. In this paper, based on the improvement of distributed anti-collision algorithm based on particle swarm optimization algorithm and graph coloring algorithm, the central idea is that the server can optimize and update the time allocation of reader according to the number of tags estimated by the reader. The new algorithm maximizes the time slot of reader network, reduces the waste of system slot resources, and finally improves the overall efficiency of system recognition. Label recognition technology in RFID system is the key technology of RFID technology. The traditional automatic recognition technology judges the existence of tags by collecting all label identification numbers and comparing them with the tag sets stored in the system database. However, the recognition efficiency of this method is very low, and the power consumption of active tags is too high. In view of the above questions, this paper proposes a new label detection algorithm HPL, algorithm based on frame slot protocol on the basis of multi-reader parallelism. The main content is that the reader carries a random number Q when transmitting query frames. The tag selects a time slot to reply to a bit through the Q value, the reader completes a recognition process through a fixed polling cycle, and forms a matrix according to the reply information to judge the existence of the label. Through theoretical analysis and simulation, it is proved that the distributed anti-collision algorithm based on particle swarm optimization algorithm and graph coloring algorithm is improved in this paper, which reduces the recognition time of tags and improves the throughput of the system. Compared with the traditional detection algorithm based on label identification number, the HPL (Hash polling Detection) algorithm proposed in this paper can reduce the energy consumption of tags by an order of magnitude, and shorten the execution time of the algorithm at the same time. Compared with the best iterative ID-free protocol detection algorithm, HPL algorithm can reduce the label energy consumption by three orders of magnitude, and also shorten the execution time of the algorithm.
【學(xué)位授予單位】：山東師范大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：TP391.44

【參考文獻(xiàn)】

相關(guān)期刊論文 前10條

1 劉佳;張有光;;基于時(shí)隙的RFID防碰撞算法分析[J];電子技術(shù)應(yīng)用;2007年05期

2 王建偉;趙玉萍;Timo Korhonen;;RFID系統(tǒng)防碰撞協(xié)議研究——設(shè)計(jì)與優(yōu)化[J];電子與信息學(xué)報(bào);2009年01期

3 莫磊;;RFID位屏蔽二進(jìn)制搜索防碰撞算法研究[J];河北科技大學(xué)學(xué)報(bào);2010年05期

4 陳瀚寧;朱云龍;胡琨元;;基于多種群共生進(jìn)化的RFID網(wǎng)絡(luò)優(yōu)化[J];解放軍理工大學(xué)學(xué)報(bào)(自然科學(xué)版);2008年05期

5 尹君;何怡剛;李兵;鄧曉;譚陽(yáng)紅;肖迎群;;基于分組動(dòng)態(tài)幀時(shí)隙的RFID防碰撞算法[J];計(jì)算機(jī)工程;2009年20期

6 劉快;紀(jì)志成;;基于混合粒子群的RFID網(wǎng)絡(luò)的優(yōu)化部署[J];計(jì)算機(jī)應(yīng)用研究;2012年04期

7 李秉璋;景征駿;羅燁;;基于后退式二進(jìn)制的RFID防碰撞搜索算法[J];計(jì)算機(jī)應(yīng)用與軟件;2009年12期

8 林雪明;;基于回溯方法的RFID防碰撞算法研究[J];寧波大學(xué)學(xué)報(bào)(理工版);2009年03期

9 陳穎;;一種新的多閱讀器防碰撞算法的研究[J];杭州電子科技大學(xué)學(xué)報(bào);2012年05期

10 王雪;錢志鴻;胡正超;李奕男;;基于二叉樹(shù)的RFID防碰撞算法的研究[J];通信學(xué)報(bào);2010年06期

本文編號(hào)：2479651