本文選題：無線傳感器網(wǎng)路 + leach算法��； 參考：《燕山大學》2014年碩士論文

【摘要】：無線傳感器網(wǎng)絡功耗小、數(shù)量多、自組網(wǎng)等特點使得其在許多重要領(lǐng)域都具有潛在的應用價值，但是無線傳感器網(wǎng)路也存在著能量受限，拓撲結(jié)構(gòu)易變等缺點，這就對無線傳感器網(wǎng)絡的路由算法提出了較高的要求。在無線傳感器網(wǎng)絡路由算法中最經(jīng)典也是最重要的當屬leach算法，它是第一個分層路由算法，與平面路由相比它有效地延長了網(wǎng)絡的生命周期，提高了節(jié)點能量的利用率，但是它也存在一些缺點。本文在研究leach算法的基礎(chǔ)上，針對其簇頭選擇和數(shù)據(jù)傳輸方式提出了兩種改進方法，并在開源協(xié)議棧contiki下進行了仿真研究。本文研究內(nèi)容如下： 首先，，對本課題的研究背景和現(xiàn)狀做了簡要介紹，并分析了無線傳感器網(wǎng)絡的主要應用、體系結(jié)構(gòu)和關(guān)鍵技術(shù)，并從平面路由算法和層次路由算法兩個方面，各選取了幾個典型的算法進行分析和比較。 其次，詳細描述leach算法的過程，分析它的性能，針對其不足之處提出了兩種改進方法。一種是leach-data，利用數(shù)據(jù)競爭的方式發(fā)送數(shù)據(jù)，并且按照網(wǎng)絡的實際需求來建立簇；另一種方法是leach-sink，通過sink節(jié)點選擇整個網(wǎng)絡的簇頭，普通節(jié)點再根據(jù)鄰居列表選擇自己的簇頭，這樣可以保證網(wǎng)絡中簇頭的個數(shù)和每個節(jié)點擔任簇頭的機會都是均等的。 再次，研究了contiki協(xié)議棧環(huán)境下無線網(wǎng)絡通信的工作機制和實現(xiàn)方法，重點研究了contiki下網(wǎng)絡層協(xié)議rime的實現(xiàn)方式和cooja仿真工具，并對基于contiki環(huán)境的基本無線通信進行了實驗研究。 最后，通過仿真實驗，分析了leach算法的特點，以及新算法對leach算法的改進之處。并對本文所存在的不足做了進一步的展望。
[Abstract]:Wireless sensor networks (WSN) have small power consumption and a large number of wireless sensor networks, which have the potential application value in many important fields. However, the wireless sensor networks have the disadvantages of limited energy and topology structure. This is a high requirement for the routing algorithms of wireless sensor networks. The most classic and most important algorithm in the algorithm is the LEACH algorithm. It is the first hierarchical routing algorithm. Compared with the plane routing, it effectively prolongs the life cycle of the network and improves the utilization of node energy, but it also has some shortcomings. Based on the study of the LEACH algorithm, this paper aims at the cluster head selection and the data transmission side. This paper proposes two improved methods and conducts simulation research under the open source protocol stack Contiki.
First, the research background and present situation of this topic are briefly introduced, and the main applications, architecture and key technologies of the wireless sensor network are analyzed, and several typical algorithms are selected and analyzed from two aspects of the plane routing algorithm and the hierarchical routing algorithm.
Secondly, the process of LEACH algorithm is described in detail, and its performance is analyzed. In view of its shortcomings, two improved methods are proposed. One is leach-data, which uses data competition to send data and sets up clusters according to the actual needs of the network; the other is leach-sink, the cluster head of the entire network is selected through the sink node, and the common section is selected. Then select the cluster head according to the neighbor list, so that the number of cluster heads in the network and the chance of each node as cluster head are equal.
Thirdly, the working mechanism and implementation method of wireless network communication in the Contiki protocol stack are studied. The implementation of network layer protocol rime under Contiki and the simulation tools of cooja are emphatically studied, and the basic wireless communication based on Contiki environment is studied experimentally.
Finally, through the simulation experiment, the characteristics of the LEACH algorithm and the improvement of the new algorithm to the LEACH algorithm are analyzed, and the shortcomings of this paper are further prospected.

【學位授予單位】：燕山大學
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：TN929.5;TP212.9

【參考文獻】

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

1 王金偉;孫華志;孫德兵;;基于能耗的無線傳感器網(wǎng)絡最優(yōu)簇首數(shù)研究[J];傳感器與微系統(tǒng);2011年07期

2 謝銳兵;郭淑華;;無線傳感器網(wǎng)絡路由協(xié)議的分析研究[J];電腦知識與技術(shù);2011年33期

3 羅開平;姜維;李一軍;;傳感器管理述評[J];電子學報;2010年08期

4 宋朝;王倩;;無線自組網(wǎng)和無線傳感器網(wǎng)絡研究[J];福建電腦;2012年04期

5 林新霞;郭建輝;;傳感器技術(shù)發(fā)展與前景展望[J];工業(yè)儀表與自動化裝置;2011年02期

6 朱祥賢;孫岐峰;楊永;;無線傳感器網(wǎng)絡的體系結(jié)構(gòu)及其應用[J];信息通信;2009年06期

7 房曉菲;沈永增;姚俊杰;;一種基于LEACH的新型WSN路由算法[J];機電工程;2008年05期

8 周治平;王亭;張明亮;;傳感器網(wǎng)絡中一種能量有效的簇頭選擇機制[J];計算機工程與應用;2012年08期

9 沈明玉;鄭立坤;;WSN中SPIN路由協(xié)議的改進[J];計算機工程;2012年05期

10 鄧亞平;�？�;;低能耗的分布式數(shù)據(jù)融合改進算法[J];計算機應用;2009年07期

本文編號：1796194