本文關(guān)鍵詞：多級(jí)異構(gòu)無(wú)線(xiàn)傳感器網(wǎng)絡(luò)高能效分簇路由算法　出處：《江西理工大學(xué)》2017年碩士論文　論文類(lèi)型：學(xué)位論文

  更多相關(guān)文章： 無(wú)線(xiàn)傳感器網(wǎng)絡(luò) 分簇路由 多跳路由 能量消耗

【摘要】：無(wú)線(xiàn)傳感器網(wǎng)絡(luò)WSN(Wireless Sensor Network)是將數(shù)據(jù)收集、處理和傳輸綜合為一體的網(wǎng)絡(luò),它也是一種節(jié)點(diǎn)分布較隨機(jī)、自組織相互協(xié)調(diào)合作、不需要基礎(chǔ)設(shè)施的網(wǎng)絡(luò),在諸多領(lǐng)域有著廣闊的應(yīng)用前景。但是,網(wǎng)絡(luò)中傳感器節(jié)點(diǎn)體積細(xì)小,節(jié)點(diǎn)的能量又受到限制,而且,節(jié)點(diǎn)需要收集監(jiān)測(cè)數(shù)據(jù)并進(jìn)行處理,還要通過(guò)無(wú)線(xiàn)廣播通信發(fā)送數(shù)據(jù)。故此,為了減少傳感器節(jié)點(diǎn)的能量消耗,怎樣充分利用能量,是優(yōu)化無(wú)線(xiàn)傳感器網(wǎng)絡(luò)路由要解決的重點(diǎn)問(wèn)題。本文在DEEC研究的基礎(chǔ)上,研究了多級(jí)異構(gòu)WSN基于節(jié)點(diǎn)位置信息和當(dāng)前剩余能量的優(yōu)化分簇路由技術(shù),并對(duì)改進(jìn)路由技術(shù)在網(wǎng)絡(luò)運(yùn)行周期和轉(zhuǎn)發(fā)數(shù)據(jù)量的能力上進(jìn)行了重點(diǎn)分析。本文主要研究?jī)?nèi)容如下:1.介紹WSN的概念、特點(diǎn)、結(jié)構(gòu)以及應(yīng)用模型。闡述了LEACH和DEEC路由的運(yùn)行機(jī)制,通過(guò)仿真實(shí)驗(yàn)對(duì)比了這兩種算法的性能,分析了這兩種算法的優(yōu)缺點(diǎn)。同時(shí)簡(jiǎn)單介紹了其他相關(guān)的WSN路由技術(shù),并分析了DEEC仍可改進(jìn)的地方。2.分析、研究了基于節(jié)點(diǎn)位置和剩余能量的分簇路由技術(shù)。分簇結(jié)構(gòu)網(wǎng)絡(luò)有著良好的可擴(kuò)展性,便于管理,因此成為解決能耗問(wèn)題的重要方法。本文提出一種多級(jí)異構(gòu)無(wú)線(xiàn)傳感器網(wǎng)絡(luò)能量?jī)?yōu)化算法(EOCA),該算法在分簇階段考慮了節(jié)點(diǎn)位置和剩余能量這兩個(gè)因素,使得選擇的簇頭在距離基站更近的位置,減少距基站較遠(yuǎn)節(jié)點(diǎn)競(jìng)選為簇頭的機(jī)率。與SEP和DEEC路由算法比較,EOCA路由算法很好的提高了網(wǎng)絡(luò)性能,平衡了全網(wǎng)能量的消耗,使得全網(wǎng)的生存時(shí)間得以延長(zhǎng)。3.分析、研究了基于節(jié)點(diǎn)位置和剩余能量的自適應(yīng)多跳路由算法。本文提出一種多級(jí)異構(gòu)無(wú)線(xiàn)傳感器網(wǎng)絡(luò)高能效多跳路由算法(MEECR),該算法采用單跳與多跳相結(jié)合的路由機(jī)制,算法利用一個(gè)距離閾值決定節(jié)點(diǎn)采用單跳或是多跳路由,在多跳路由中算法依據(jù)節(jié)點(diǎn)位置和剩余能量定義的一個(gè)決策值,由該決策值確定簇頭的下一跳路由。由仿真實(shí)驗(yàn)結(jié)果可知,MEECR有效地提升了網(wǎng)絡(luò)的性能。與SEP和DEEC相比,MEECR具有較長(zhǎng)的穩(wěn)定運(yùn)行時(shí)間以及更大的網(wǎng)絡(luò)吞吐量。
[Abstract]:Wireless sensor network (WSN(Wireless Sensor Network) is a network that integrates data collection, processing and transmission, and it is also a random distribution of nodes. Self-organization and cooperation with each other do not require infrastructure of the network, which has a broad application prospects in many fields. However, the sensor nodes in the network are small in size, and the energy of nodes is limited. Nodes need to collect and process monitoring data and transmit data through wireless communication. Therefore, in order to reduce the energy consumption of sensor nodes, how to make full use of energy. Based on the research of DEEC, this paper studies the optimal clustering routing technology of multilevel heterogeneous WSN based on node location information and current residual energy. And improve the routing technology in network running cycle and forwarding data capacity is analyzed. The main research content of this paper is as follows: 1. Introduce the concept and characteristics of WSN. Structure and application model. The running mechanism of LEACH and DEEC routing is described, and the performance of the two algorithms is compared by simulation experiments. This paper analyzes the advantages and disadvantages of these two algorithms. At the same time, it briefly introduces other related WSN routing techniques, and analyzes the possible improvement of DEEC. 2. The clustering routing technology based on node location and residual energy is studied. The cluster structure network has good scalability and is easy to manage. Therefore, it has become an important method to solve the problem of energy consumption. In this paper, a multi-level heterogeneous wireless sensor network energy optimization algorithm EOCA) is proposed. The algorithm takes into account the node position and residual energy in the clustering phase, which makes the selected cluster head closer to the base station. Compared with SEP and DEEC routing algorithm, it can improve the network performance and balance the energy consumption of the whole network. So that the whole network of survival time can be extended. 3. Analysis. An adaptive multi-hop routing algorithm based on node location and residual energy is studied. In this paper, an efficient multi-hop routing algorithm for multi-level heterogeneous wireless sensor networks (WSN) is proposed. The algorithm uses a single-hop and multi-hop routing mechanism, the algorithm uses a distance threshold to determine the node to use single-hop or multi-hop routing. According to a decision value defined by node position and residual energy in multi-hop routing, the next hop routing of cluster head is determined by the decision value. Compared with SEP and DEEC, MEECR has longer stable running time and larger network throughput.
【學(xué)位授予單位】：江西理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類(lèi)號(hào)】：TP212.9;TN929.5

【參考文獻(xiàn)】

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

1 孫彥景;林昌林;江海峰;;一種能量高效的分布式非均勻分簇路由算法[J];傳感技術(shù)學(xué)報(bào);2015年08期

2 董國(guó)勇;彭力;吳凡;聞繼偉;;一種采用蟻群優(yōu)化的WSN能量均衡非均勻分簇路由算法[J];小型微型計(jì)算機(jī)系統(tǒng);2015年07期

3 蔣文賢;賴(lài)超;;一種壓縮感知的異構(gòu)傳感網(wǎng)絡(luò)分簇路由算法[J];小型微型計(jì)算機(jī)系統(tǒng);2015年02期

4 任繼永;劉智濤;;一種無(wú)線(xiàn)傳感器網(wǎng)絡(luò)平面路由協(xié)議研究[J];網(wǎng)絡(luò)安全技術(shù)與應(yīng)用;2014年12期

5 陸亞芳;易可夫;馮緒;萬(wàn)江文;;基于模糊理論的無(wú)線(xiàn)傳感器網(wǎng)絡(luò)多層分簇式路由算法[J];傳感技術(shù)學(xué)報(bào);2014年07期

6 陳炳才;么華卓;楊明川;李寶君;赫凌超;;一種基于LEACH協(xié)議改進(jìn)的簇間多跳路由協(xié)議[J];傳感技術(shù)學(xué)報(bào);2014年03期

7 趙金鈴;馬昕桐;;能量?jī)?yōu)化的無(wú)線(xiàn)傳感器網(wǎng)絡(luò)節(jié)點(diǎn)路由算法研究[J];計(jì)算機(jī)仿真;2013年10期

8 黃曉峰;劉廣鐘;;無(wú)線(xiàn)網(wǎng)絡(luò)中DEEC協(xié)議的改進(jìn)[J];微型機(jī)與應(yīng)用;2013年10期

9 尚鳳軍;任東海;;無(wú)線(xiàn)傳感器網(wǎng)絡(luò)中分布式多跳路由算法研究[J];傳感技術(shù)學(xué)報(bào);2012年04期

10 王建新;趙湘寧;劉輝宇;;一種基于兩跳鄰居信息的貪婪地理路由算法[J];電子學(xué)報(bào);2008年10期

，

本文編號(hào)：1389670