【摘要】：如何節(jié)省能耗,延長(zhǎng)網(wǎng)絡(luò)生命周期是工業(yè)界和學(xué)術(shù)界對(duì)無(wú)線傳感器網(wǎng)絡(luò)路由算法研究的熱點(diǎn)問(wèn)題。詳細(xì)探討了經(jīng)典LEACH協(xié)議的原理和運(yùn)行機(jī)制,從理論分析和仿真實(shí)驗(yàn)說(shuō)明了它的優(yōu)缺點(diǎn),在總結(jié)前人經(jīng)驗(yàn)的基礎(chǔ)上提出相應(yīng)的改進(jìn)思想,最后利用MATLAB實(shí)驗(yàn)平臺(tái)仿真分析,驗(yàn)證算法的可行性。首先,簡(jiǎn)單介紹了無(wú)線傳感器網(wǎng)絡(luò)和無(wú)線傳感器網(wǎng)絡(luò)路由協(xié)議基本概念。詳細(xì)介紹經(jīng)典LEACH協(xié)議的基本原理和運(yùn)行機(jī)制,利用MATLAB編碼實(shí)現(xiàn)了平面直接路由算法和LEACH算法,總結(jié)出LEACH算法在網(wǎng)絡(luò)生命周期、能量利用率上的優(yōu)點(diǎn)。其次,分析LEACH實(shí)驗(yàn)數(shù)據(jù),總結(jié)出LEACH算法在簇首選擇和單跳路由等方面的不足,提出改進(jìn)思路：(一)針對(duì)LEACH協(xié)議中的閾值公式,引入了四個(gè)修正因子：節(jié)點(diǎn)的剩余能量、節(jié)點(diǎn)到基站的距離、節(jié)點(diǎn)到鄰居節(jié)點(diǎn)距離的平均值、節(jié)點(diǎn)的密度,讓算法產(chǎn)生更加科學(xué)合理的簇首。(二)普通節(jié)點(diǎn)在選擇簇首加入時(shí),同時(shí)考慮節(jié)點(diǎn)到簇首的距離和簇首到基站的距離的“通信代價(jià)函數(shù)”的概念。(三)參考了“雙簇首”的思想,按閾值公式產(chǎn)生的主簇首會(huì)根據(jù)請(qǐng)求加入的普通節(jié)點(diǎn)自身能量和位置信息,讓能量越大、越靠近基站的普通節(jié)點(diǎn)成為本簇的副簇首,主簇首負(fù)責(zé)搜集本簇的數(shù)據(jù)信息,副簇首負(fù)責(zé)轉(zhuǎn)發(fā)簇間的數(shù)據(jù)信息。(四)結(jié)合能量的消耗公式以及數(shù)學(xué)中圓的定義,給出了一種在副簇首之間多跳的路由鏈路產(chǎn)生的辦法,減少能量的消耗。最后,MATLAB編碼實(shí)現(xiàn)了引入改進(jìn)思路之后的LEACH-NEW算法過(guò)程,并對(duì)產(chǎn)生的實(shí)驗(yàn)數(shù)據(jù)進(jìn)行了分析,選用網(wǎng)絡(luò)生存周期、網(wǎng)絡(luò)能耗、基站接收數(shù)據(jù)報(bào)文數(shù)、節(jié)點(diǎn)能耗的均衡率、簇間多跳路由鏈路、簇首位置、簇首數(shù)量統(tǒng)計(jì)、能量空洞問(wèn)題等八個(gè)方面來(lái)對(duì)比LEACH-NEW和LEACH的性能,從實(shí)驗(yàn)數(shù)據(jù)可以看出,LEACH-NEW在能量均衡和延長(zhǎng)網(wǎng)絡(luò)生存周期方面確實(shí)有一定改進(jìn)。
[Abstract]:How to save energy and prolong network life cycle is a hot issue in industry and academia. The principle and running mechanism of classical LEACH protocol are discussed in detail. Its advantages and disadvantages are illustrated by theoretical analysis and simulation experiments. The corresponding improvement ideas are put forward on the basis of summing up the previous experiences. Finally, the simulation analysis is carried out on the MATLAB experimental platform. Verify the feasibility of the algorithm. Firstly, the basic concepts of wireless sensor network and wireless sensor network routing protocol are introduced briefly. The basic principle and running mechanism of classical LEACH protocol are introduced in detail. The planar direct routing algorithm and LEACH algorithm are implemented by MATLAB coding. The advantages of LEACH algorithm in network life cycle and energy utilization are summarized. Secondly, the LEACH experimental data are analyzed, and the shortcomings of the LEACH algorithm in cluster head selection and single hop routing are summarized. The improved ideas are as follows: (1) for the threshold formula of LEACH protocol, four correction factors are introduced: the residual energy of nodes. The distance from the node to the base station, the average distance from the node to the neighbor node, and the density of the node make the algorithm produce more scientific and reasonable cluster heads. (2) the concept of "communication cost function" of the distance from the node to the cluster head and the distance from the cluster head to the base station is considered when the common node selects the cluster head to join. (3) referring to the idea of "double cluster head", the main cluster head generated by threshold formula will be based on the energy and position information of the ordinary node added upon request, so that the higher the energy, the more the ordinary node near the base station becomes the sub-cluster head of the cluster. The main cluster head is responsible for collecting the data information of the cluster, and the secondary cluster head is responsible for forwarding the data information between the clusters. (4) combined with the formula of energy consumption and the definition of circle in mathematics, a method of generating multi-hop routing link between sub-cluster heads is presented to reduce the energy consumption. Finally, MATLAB code realizes the process of LEACH-NEW algorithm after introducing the improved idea, and analyzes the generated experimental data, selects the network life cycle, network energy consumption, the number of data packets received by base station, and the equalization rate of node energy consumption. The performance of LEACH-NEW and LEACH is compared in eight aspects, such as multi-hop routing link, cluster head location, cluster head statistics, energy hole problem, etc. From the experimental data, we can see that, LEACH-NEW does have some improvements in energy balance and prolongation of network lifetime.
【學(xué)位授予單位】：復(fù)旦大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TN929.5;TP212.9

【參考文獻(xiàn)】

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

1 潘剛;;基于雙簇頭無(wú)線傳感器網(wǎng)絡(luò)分簇算法的研究[J];西昌學(xué)院學(xué)報(bào)(自然科學(xué)版);2012年04期

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

1 于繼明;無(wú)線傳感器網(wǎng)絡(luò)基于分簇的多路徑路由算法研究[D];南京理工大學(xué);2008年

，

本文編號(hào)：2401291