【摘要】：無線傳感器網(wǎng)絡(Wireless Sensor Network,WSN)是現(xiàn)代互聯(lián)網(wǎng)技術發(fā)展到一定階段的必然產物,是人類獲取信息的重要手段。它是由成千上萬的廉價的傳感器節(jié)點,隨機的分布在被檢測區(qū)域,節(jié)點利用自身的感應設備感知信息,感知到的信息在通過節(jié)點形成的網(wǎng)絡傳輸?shù)絪ink節(jié)點,在利用互聯(lián)網(wǎng)發(fā)送到數(shù)據(jù)處理中心。目的就是獲取監(jiān)測對象的信息,根據(jù)信息對目標區(qū)域進行分析判斷和處理操作。由于無線傳感器節(jié)點成本低、結構簡單、易于部署,并且無線傳感器網(wǎng)絡可以在獨立的環(huán)境下運行,因此無線傳感器網(wǎng)絡被廣泛應用于各種等惡劣環(huán)境中,特別是人類難以到達的地方。無線傳感器節(jié)點是一個獨立的個體,節(jié)點能源是由自身攜帶的電池所提供,因此節(jié)省能耗尤為重要。在網(wǎng)絡中,路由協(xié)議主要作用是優(yōu)化路徑。因此路由協(xié)議在節(jié)省能耗上起著重要的作用,設計一個性能優(yōu)良的路由協(xié)議尤為重要。為了提高無線傳感器網(wǎng)絡高效可靠的分簇管理,本文詳細分析了分簇路由算法,提出了 COORD算法。該算法以sink為原點,按照一定的規(guī)則建立一個節(jié)點坐標信息表。sink節(jié)點在依據(jù)坐標信息表確定每個節(jié)點坐標,并且根據(jù)平均密度劃分子區(qū)域。當子區(qū)域劃分以后,在子區(qū)域中選舉簇首,選舉簇首時加入節(jié)點剩余能量作為選舉參數(shù)之一。通過試驗得出,COORD協(xié)議在簇首分布和節(jié)點能耗上都要比LEACH協(xié)議和TEED協(xié)議表現(xiàn)優(yōu)良。另外,我們對分簇骨干網(wǎng)絡局部故障下的轉發(fā)協(xié)議也提出了改進方案。無線傳感器網(wǎng)絡中的節(jié)點一般都是隨機投放的,而且節(jié)點在工作過程中會隨著能源耗盡而死亡,因此節(jié)點密度逐漸減小,從而會出現(xiàn)路由中斷現(xiàn)象�；谝陨蠁栴},本文提出了"游標復制機制"解決方案。該方案首先是簇首節(jié)點發(fā)現(xiàn)自己處于路由故障時,設置游標信息sign=-1并進行廣播出去,接收到信息的臨近節(jié)點對游標信息進行復制,并找出路由中斷鏈或樹中的節(jié)點,鏈中節(jié)點根據(jù)反饋信息重新尋找路徑,并且反饋給下一跳節(jié)點直到找到路由中斷節(jié)點。最后根據(jù)重新找到的路徑進行數(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.
【學位授予單位】：安徽理工大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：TP212.9;TN929.5

【參考文獻】

相關期刊論文 前7條

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

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

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

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

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

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

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

，

本文編號：2498724