【摘要】：自動(dòng)識(shí)別中最具有優(yōu)勢(shì)的無線射頻識(shí)別(Radio Frequency Identification,RFID)技術(shù)是一種非接觸式識(shí)別方法。它利用發(fā)射信號(hào)的電感(電磁)耦合原理或信號(hào)的反射特性來識(shí)別目標(biāo)物體。其以信號(hào)的距離長(zhǎng)、識(shí)別容量大、安全程度高、多標(biāo)簽可同時(shí)識(shí)別,并具有較強(qiáng)的穿透能力等優(yōu)點(diǎn)被廣泛地應(yīng)用于人類生活中的多個(gè)領(lǐng)域。例如物流倉庫、安全交通、商場(chǎng)支付等。但是伴隨著RFID技術(shù)高速發(fā)展,它也逐漸暴露出了一些亟待解決的問題。當(dāng)RFID在某區(qū)域內(nèi)多個(gè)閱讀器同時(shí)與大量電子標(biāo)簽進(jìn)行信息交換時(shí),可能會(huì)出現(xiàn)信號(hào)相互干擾的碰撞問題。為此研究員們提出了RFID防碰撞算法,它不但解決通信過程中標(biāo)簽碰撞問題,而且減少了電子標(biāo)簽的識(shí)別時(shí)間、提高通道的利用效率和系統(tǒng)的吞吐率。電子標(biāo)簽防碰撞算法解決了多個(gè)標(biāo)簽在閱讀器工作范圍內(nèi)產(chǎn)生的碰撞問題。論文深入研究了二進(jìn)制搜索算法、ALOHA算法等防碰撞算法,提出了分組混合查詢防碰撞算法和基于幀時(shí)隙的HQT算法并完成了閱讀器的軟件設(shè)計(jì)。本文的主要研究?jī)?nèi)容包括:(1)對(duì)閱讀器進(jìn)行了軟件設(shè)計(jì)。根據(jù)我國(guó)自主標(biāo)準(zhǔn)協(xié)議,實(shí)現(xiàn)了以32位STM32F207為基礎(chǔ)的邏輯控制單元的軟件架構(gòu)設(shè)計(jì)。其中底層驅(qū)動(dòng)實(shí)現(xiàn)STM32F207與FPGA之間通信,采用SPI串行接口進(jìn)行通信�；鶐У倪壿嬁刂茊卧c上位機(jī)之間的數(shù)據(jù)傳輸是基于以太網(wǎng)采用無線通信方式和TCP/IP協(xié)議實(shí)現(xiàn)。協(xié)議層是采取我國(guó)自主的標(biāo)準(zhǔn)空中接口協(xié)議,實(shí)現(xiàn)閱讀器與標(biāo)簽的通信狀態(tài)機(jī)制和處理過程的協(xié)議命令,同時(shí)對(duì)標(biāo)簽與閱讀器之間的交互式處理進(jìn)行分析、執(zhí)行。(2)在傳統(tǒng)的射頻識(shí)別二進(jìn)制多叉樹防碰撞算法和QT算法的基礎(chǔ)上,本文提出了一種基于分組的混合查詢防碰撞算法�？紤]到當(dāng)碰撞位在標(biāo)簽中所占的位數(shù)較多時(shí),直接使用多叉樹算法會(huì)產(chǎn)生較多的查詢次數(shù)。在此基礎(chǔ)上提出先分組后使用改進(jìn)的HQT算法能減少查詢次數(shù)。通過不斷的異或分組再用最高位和次高碰撞位的組合信息對(duì)標(biāo)簽進(jìn)行時(shí)隙延遲響應(yīng),這樣就錯(cuò)開了大量標(biāo)簽的碰撞。仿真結(jié)果表明,新算法較HQT算法和QT算法有明顯的改進(jìn),在系統(tǒng)的查詢次數(shù)上相較QT算法明顯減少,對(duì)比HQT算法也有一定的減少;系統(tǒng)吞吐率明顯提高。(3)在傳統(tǒng)的ALOHA防碰撞算法和二進(jìn)制搜索防碰撞算法基礎(chǔ)上,本文提出了基于分組的幀時(shí)隙HQT算法。該算法首先通過對(duì)標(biāo)簽數(shù)量進(jìn)行預(yù)估計(jì)決定是否將標(biāo)簽分組,這樣減少碰撞機(jī)率、提高系統(tǒng)識(shí)別效率;在進(jìn)行不確定性算法時(shí)采用多組隨機(jī)數(shù),減少空閑時(shí)隙,然后再對(duì)產(chǎn)生碰撞的時(shí)隙進(jìn)行無空時(shí)隙的HQT防碰撞算法,這樣能夠提高系統(tǒng)的識(shí)別效率、減少空時(shí)隙數(shù)以及數(shù)據(jù)傳輸量。仿真結(jié)果表明對(duì)比動(dòng)態(tài)幀時(shí)隙ALOHA算法,改進(jìn)算法在系統(tǒng)的吞吐率由36%提高到57%左右;隨著電子標(biāo)簽的增加識(shí)別時(shí)隙數(shù)增加并不明顯,遠(yuǎn)小于動(dòng)態(tài)幀時(shí)隙ALOHA算法。
[Abstract]:Radio Frequency Identification (Radio Frequency Identification,RFID) technology, which has the most advantages in automatic identification, is a non-contact identification method. It uses the inductance (electromagnetic) coupling principle of the transmitting signal or the reflection characteristic of the signal to identify the target object. It is widely used in many fields of human life because of its long distance, large recognition capacity, high level of security, simultaneous recognition of multiple tags and strong penetration ability. Such as logistics warehouse, safe transportation, shopping mall payment and so on. However, with the rapid development of RFID technology, it has gradually exposed some problems to be solved. When multiple readers in a certain area exchange information with a large number of tags simultaneously, there may be a collision problem in which the signals interfere with each other. For this reason, RFID anti-collision algorithm is proposed, which not only solves the problem of tag collision in communication process, but also reduces the identification time of electronic tag, improves the efficiency of channel utilization and the throughput of the system. The anti-collision algorithm solves the collision problem caused by multiple tags in the reader range. In this paper, the anti-collision algorithms such as binary search algorithm, ALOHA algorithm and so on are studied, and the anti-collision algorithm of grouping mixed query and HQT algorithm based on frame slot are proposed, and the software design of reader is completed. The main contents of this paper are as follows: (1) the software design of reader is carried out. According to the independent standard protocol of our country, the software architecture design of the logical control unit based on 32 bit STM32F207 is realized. The bottom driver realizes the communication between STM32F207 and FPGA, and uses SPI serial interface to communicate. The data transmission between the base band logic control unit and the host computer is realized by wireless communication mode and TCP/IP protocol based on Ethernet. The protocol layer adopts our country's own standard air interface protocol to realize the communication state mechanism between reader and tag and the protocol command of processing process. At the same time, the interactive processing between tag and reader is analyzed. (2) based on the traditional anti-collision algorithm of binary multitree and QT algorithm, a hybrid query anti-collision algorithm based on grouping is proposed in this paper. When the collision bit takes up more bits in the tag, the multi-tree algorithm can generate more query times. On this basis, it is proposed that the improved HQT algorithm can reduce the number of queries. Using the combination information of the highest bit and the second high collision bit, the time-slot delay response of the tag is carried out by the constant XOR grouping, so a large number of tag collisions are staggered. The simulation results show that the new algorithm is better than the HQT algorithm and the QT algorithm, the query times of the system are obviously reduced compared with the QT algorithm, and the HQT algorithm is also reduced to some extent. The throughput of the system is improved obviously. (3) based on the traditional ALOHA anti-collision algorithm and binary search anti-collision algorithm, a frame slot HQT algorithm based on packet is proposed in this paper. In this algorithm, the number of tags is estimated in advance to decide whether to group the tags, which reduces the probability of collision and improves the efficiency of system recognition. In order to reduce the free time slot, the HQT anti-collision algorithm is applied to the collision time slot, which can improve the recognition efficiency of the system. Reduce the number of slots and the amount of data transmitted. The simulation results show that compared with the dynamic frame slot ALOHA algorithm, the throughput of the improved algorithm increases from 36% to 57%, and with the increase of tag, the number of identifying slots is not obviously increased, which is much smaller than the dynamic frame slot ALOHA algorithm.
【學(xué)位授予單位】：浙江理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TP391.44

【參考文獻(xiàn)】

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

1 張小紅;胡應(yīng)夢(mèng);;分組自適應(yīng)分配時(shí)隙的RFID防碰撞算法研究[J];電子學(xué)報(bào);2016年06期

2 陳浩;張海峰;應(yīng)屹航;;基于動(dòng)態(tài)Q學(xué)習(xí)的防碰撞算法的研究[J];杭州電子科技大學(xué)學(xué)報(bào)(自然科學(xué)版);2016年01期

3 趙偉;熊衛(wèi)華;季瑞松;;基于國(guó)家標(biāo)準(zhǔn)的UHF RFID讀寫器數(shù)字基帶系統(tǒng)設(shè)計(jì)[J];物聯(lián)網(wǎng)技術(shù);2015年10期

4 姜武;楊恒新;張昀;;一種改進(jìn)的查詢樹RFID標(biāo)簽防碰撞算法[J];計(jì)算機(jī)技術(shù)與發(fā)展;2015年02期

5 袁開國(guó);郝昱文;李爭(zhēng)平;張笛笛;;RFID網(wǎng)絡(luò)中基于Aloha防碰撞的標(biāo)簽數(shù)目的聯(lián)合估計(jì)算法[J];北京郵電大學(xué)學(xué)報(bào);2014年S1期

6 劉金艷;馮全源;;無線射頻識(shí)別多標(biāo)簽防碰撞算法綜述[J];計(jì)算機(jī)集成制造系統(tǒng);2014年02期

7 單劍鋒;陳明;謝建兵;;基于ALOHA算法的RFID防碰撞技術(shù)研究[J];南京郵電大學(xué)學(xué)報(bào)(自然科學(xué)版);2013年01期

8 錢志鴻;王義君;;面向物聯(lián)網(wǎng)的無線傳感器網(wǎng)絡(luò)綜述[J];電子與信息學(xué)報(bào);2013年01期

9 李波;;基于標(biāo)簽信息分組的射頻識(shí)別防碰撞算法[J];華南理工大學(xué)學(xué)報(bào)(自然科學(xué)版);2011年07期

10 張學(xué)軍;王娟;王鎖萍;;基于標(biāo)簽識(shí)別碼分組的連續(xù)識(shí)別防碰撞算法研究[J];電子與信息學(xué)報(bào);2011年05期

相關(guān)博士學(xué)位論文 前1條

1 白煜;超高頻射頻識(shí)別（UHF RFID）系統(tǒng)抗干擾策略的研究[D];天津大學(xué);2009年

相關(guān)碩士學(xué)位論文 前4條

1 吳遠(yuǎn);基于RFID系統(tǒng)的防碰撞算法研究[D];浙江理工大學(xué);2015年

2 田浩;分立式超高頻RFID讀寫器設(shè)計(jì)[D];鄭州大學(xué);2014年

3 王玉青;射頻識(shí)別標(biāo)簽防碰撞算法研究[D];南京航空航天大學(xué);2012年

4 董向陽;基于ARM的LwIP協(xié)議棧研究與移植[D];哈爾濱理工大學(xué);2009年

，

本文編號(hào)：2299503