發(fā)布時(shí)間：2019-06-13 18:30

【摘要】：無線傳感器網(wǎng)絡(luò)(Wireless Sensor Network,WSN)是現(xiàn)代互聯(lián)網(wǎng)技術(shù)發(fā)展到一定階段的必然產(chǎn)物,是人類獲取信息的重要手段。它是由成千上萬的廉價(jià)的傳感器節(jié)點(diǎn),隨機(jī)的分布在被檢測(cè)區(qū)域,節(jié)點(diǎn)利用自身的感應(yīng)設(shè)備感知信息,感知到的信息在通過節(jié)點(diǎn)形成的網(wǎng)絡(luò)傳輸?shù)絪ink節(jié)點(diǎn),在利用互聯(lián)網(wǎng)發(fā)送到數(shù)據(jù)處理中心。目的就是獲取監(jiān)測(cè)對(duì)象的信息,根據(jù)信息對(duì)目標(biāo)區(qū)域進(jìn)行分析判斷和處理操作。由于無線傳感器節(jié)點(diǎn)成本低、結(jié)構(gòu)簡單、易于部署,并且無線傳感器網(wǎng)絡(luò)可以在獨(dú)立的環(huán)境下運(yùn)行,因此無線傳感器網(wǎng)絡(luò)被廣泛應(yīng)用于各種等惡劣環(huán)境中,特別是人類難以到達(dá)的地方。無線傳感器節(jié)點(diǎn)是一個(gè)獨(dú)立的個(gè)體,節(jié)點(diǎn)能源是由自身攜帶的電池所提供,因此節(jié)省能耗尤為重要。在網(wǎng)絡(luò)中,路由協(xié)議主要作用是優(yōu)化路徑。因此路由協(xié)議在節(jié)省能耗上起著重要的作用,設(shè)計(jì)一個(gè)性能優(yōu)良的路由協(xié)議尤為重要。為了提高無線傳感器網(wǎng)絡(luò)高效可靠的分簇管理,本文詳細(xì)分析了分簇路由算法,提出了 COORD算法。該算法以sink為原點(diǎn),按照一定的規(guī)則建立一個(gè)節(jié)點(diǎn)坐標(biāo)信息表。sink節(jié)點(diǎn)在依據(jù)坐標(biāo)信息表確定每個(gè)節(jié)點(diǎn)坐標(biāo),并且根據(jù)平均密度劃分子區(qū)域。當(dāng)子區(qū)域劃分以后,在子區(qū)域中選舉簇首,選舉簇首時(shí)加入節(jié)點(diǎn)剩余能量作為選舉參數(shù)之一。通過試驗(yàn)得出,COORD協(xié)議在簇首分布和節(jié)點(diǎn)能耗上都要比LEACH協(xié)議和TEED協(xié)議表現(xiàn)優(yōu)良。另外,我們對(duì)分簇骨干網(wǎng)絡(luò)局部故障下的轉(zhuǎn)發(fā)協(xié)議也提出了改進(jìn)方案。無線傳感器網(wǎng)絡(luò)中的節(jié)點(diǎn)一般都是隨機(jī)投放的,而且節(jié)點(diǎn)在工作過程中會(huì)隨著能源耗盡而死亡,因此節(jié)點(diǎn)密度逐漸減小,從而會(huì)出現(xiàn)路由中斷現(xiàn)象�；谝陨蠁栴},本文提出了"游標(biāo)復(fù)制機(jī)制"解決方案。該方案首先是簇首節(jié)點(diǎn)發(fā)現(xiàn)自己處于路由故障時(shí),設(shè)置游標(biāo)信息sign=-1并進(jìn)行廣播出去,接收到信息的臨近節(jié)點(diǎn)對(duì)游標(biāo)信息進(jìn)行復(fù)制,并找出路由中斷鏈或樹中的節(jié)點(diǎn),鏈中節(jié)點(diǎn)根據(jù)反饋信息重新尋找路徑,并且反饋給下一跳節(jié)點(diǎn)直到找到路由中斷節(jié)點(diǎn)。最后根據(jù)重新找到的路徑進(jìn)行數(shù)據(jù)傳輸。
[Abstract]:Wireless sensor network (Wireless Sensor Network,WSN) is the inevitable product of the development of modern Internet technology to a certain stage, and it is an important means for human beings to obtain information. It is composed of thousands of cheap sensor nodes, which are randomly distributed in the detected area. The nodes use their own sensing devices to sense the information, the perceived information is transmitted to the sink node through the network formed by the node, and the Internet is used to send it to the data processing center. The purpose is to obtain the information of the monitoring object, analyze and judge the target area according to the information. Because of the low cost, simple structure and easy deployment of wireless sensor nodes, and wireless sensor networks can run in independent environment, wireless sensor networks are widely used in a variety of harsh environments, especially in places difficult for human beings to reach. Wireless sensor node is an independent individual, node energy is provided by its own battery, so it is particularly important to save energy consumption. In the network, the main function of routing protocol is to optimize the path. Therefore, routing protocol plays an important role in saving energy consumption, and it is particularly important to design a routing protocol with good performance. In order to improve the efficient and reliable clustering management of wireless sensor networks, the clustering routing algorithm is analyzed in detail, and the COORD algorithm is proposed. The algorithm takes sink as the origin and establishes a node coordinate information table according to certain rules. Sink node determines the coordinates of each node according to the coordinate information table and divides the molecular region according to the average density. After the sub-region is divided, the cluster head is elected in the sub-region, and the residual energy of the node is added as one of the election parameters when the cluster head is elected. The experimental results show that COORD protocol is better than LEACH protocol and TEED protocol in cluster head distribution and node energy consumption. In addition, we also propose an improved forwarding protocol under the local fault of clustering backbone network. The nodes in wireless sensor networks are generally randomly dropped, and the nodes will die with the depletion of energy in the working process, so the node density decreases gradually, resulting in routing interruption. Based on the above problems, this paper proposes a solution to cursor replication mechanism. In this scheme, when the cluster head node finds itself in a routing fault, the cursor information sign=-1 is set up and broadcast, the adjacent node that receives the information copies the cursor information, and finds a way out to break the node in the chain or tree. The node in the chain looks for the path again according to the feedback information, and feedback to the next hop node until the routing interrupt node is found. Finally, the data is transmitted according to the refound path.
【學(xué)位授予單位】：安徽理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TP212.9;TN929.5

【參考文獻(xiàn)】

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

1 嚴(yán)斌亨;劉軍;;一種基于正六邊形網(wǎng)格的LEACH協(xié)議改進(jìn)[J];微電子學(xué)與計(jì)算機(jī);2016年08期

2 付云虹;李尹;;LEACH協(xié)議的簇首多跳與選擇優(yōu)化[J];湖南大學(xué)學(xué)報(bào)(自然科學(xué)版);2015年02期

3 周萌;陳躍東;陳孟元;;能耗最優(yōu)的LEACH協(xié)議改進(jìn)[J];計(jì)算機(jī)工程與應(yīng)用;2014年23期

4 徐世武;王平;施文灶;蘇國棟;;無線傳感器網(wǎng)絡(luò)分簇路由協(xié)議綜述[J];網(wǎng)絡(luò)新媒體技術(shù);2013年05期

5 高娟;高志鵬;黃日茂;孟洛明;;基于密度趨近的無線傳感器網(wǎng)絡(luò)故障恢復(fù)方法[J];儀器儀表學(xué)報(bào);2012年02期

6 周玉;景博;楊洲;;一種基于遺傳算法的無線傳感器網(wǎng)絡(luò)LEACH路由協(xié)議的改進(jìn)算法[J];計(jì)算機(jī)研究與發(fā)展;2010年S2期

7 劉俊鋒;高隨祥;;基于網(wǎng)格的無線傳感器網(wǎng)絡(luò)分簇方法[J];計(jì)算機(jī)工程與設(shè)計(jì);2007年09期

，

本文編號(hào)：2498724