【摘要】：無線傳感器網(wǎng)絡(luò)(WSN)是一種由大量隨機(jī)部署在監(jiān)測(cè)區(qū)域內(nèi)具有信息采集、數(shù)據(jù)處理及數(shù)據(jù)傳輸?shù)裙δ艿牧畠r(jià)微型傳感器節(jié)點(diǎn)以無線通信方式形成的多跳式自組織網(wǎng)絡(luò)。 本文針對(duì)無線傳感器網(wǎng)絡(luò)技術(shù)中的分簇式路由算法展開基礎(chǔ)理論研究。由于無線傳感器網(wǎng)絡(luò)節(jié)點(diǎn)本身存在軟硬件資源及能量供應(yīng)受限的特點(diǎn),故需要在維持網(wǎng)絡(luò)性能的同時(shí)盡可能降低節(jié)點(diǎn)能耗以延長(zhǎng)網(wǎng)絡(luò)生命周期。論文從無線傳感器網(wǎng)絡(luò)路由拓?fù)浣Y(jié)構(gòu)的合理性及數(shù)據(jù)傳輸?shù)母咝詢蓚�(gè)角度出發(fā),分析并研究?jī)煞N典型分簇式路由算法LEACH和HEED,提出改進(jìn)型算法I-LEACH(Improved-LEACH)與I-HEED(Improved-HEED),具體的研究?jī)?nèi)容與貢獻(xiàn)如下： 第一,對(duì)無線傳感器網(wǎng)絡(luò)技術(shù)的相關(guān)概念、發(fā)展歷程、研究?jī)?nèi)容等進(jìn)行簡(jiǎn)要說明與總結(jié),介紹了無線傳感器網(wǎng)絡(luò)協(xié)議棧、網(wǎng)絡(luò)節(jié)點(diǎn)結(jié)構(gòu)及特點(diǎn),以及無線傳感器網(wǎng)絡(luò)及的應(yīng)用領(lǐng)域,研究了無線傳感器網(wǎng)絡(luò)路由協(xié)議的技術(shù)標(biāo)準(zhǔn)、性能評(píng)估標(biāo)準(zhǔn),并對(duì)典型的無線傳感器網(wǎng)絡(luò)路由算法進(jìn)行了分析和比較。 第二,重點(diǎn)針對(duì)分簇式路由算法進(jìn)行研究與分析,選擇兩種不同類型的分簇式路由算法LEACH與HEED作為研究對(duì)象,詳細(xì)說明這兩種無線傳感器網(wǎng)絡(luò)路由算法的執(zhí)行過程,并分析這兩種算法存在的局限性。在充分運(yùn)用LEACH算法優(yōu)點(diǎn)的基礎(chǔ)上,本文提出一種改進(jìn)型路由算法I-LEACH,在I-LEACH路由算法中分別對(duì)以下三個(gè)方面提出改進(jìn)：(1)閾值公式；(2)最優(yōu)簇頭個(gè)數(shù)；(3)簇頭分布。針對(duì)HEED路由算法存在的不足,本文提出改進(jìn)型算法I-HEED,有以下改進(jìn)方案：(1)設(shè)計(jì)一種非均勻分簇機(jī)制；(2)對(duì)HEED路由算法中產(chǎn)生的孤立節(jié)點(diǎn)設(shè)計(jì)一種處理方法。 最后,本文將提出的改進(jìn)型算法進(jìn)行試驗(yàn)仿真,將多種協(xié)議在網(wǎng)絡(luò)生存時(shí)間、簇頭節(jié)點(diǎn)分布、網(wǎng)絡(luò)能耗均衡性等方面進(jìn)行比較,驗(yàn)證改進(jìn)型路由算法的先進(jìn)性。通過對(duì)仿真結(jié)果的比較與分析表明,改進(jìn)型的無線傳感器網(wǎng)絡(luò)路由算法相對(duì)于原路由算法,具有更好的網(wǎng)絡(luò)性能及更長(zhǎng)的網(wǎng)絡(luò)生命周期。
[Abstract]:Wireless sensor network (WSN) is a multi-hop ad hoc network based on wireless communication, which is composed of a large number of cheap micro sensor nodes deployed randomly in the monitoring area with the functions of information collection, data processing and data transmission. In this paper, the basic theory of clustering routing algorithm in wireless sensor networks (WSN) is studied. Due to the limitation of hardware and software resources and energy supply in wireless sensor network nodes, it is necessary to reduce the node energy consumption while maintaining the network performance to prolong the network life cycle. Based on the rationality of routing topology and the efficiency of data transmission in wireless sensor networks, two typical clustering routing algorithms, LEACH and HEED, are analyzed and studied in this paper. The improved algorithms I-LEACH (Improved-LEACH) and I-HEED (Improved-HEED) are proposed. The specific research contents and contributions are as follows: first, the related concepts and development process of wireless sensor network technology are introduced. The research contents are briefly described and summarized. The protocol stack, the structure and characteristics of network nodes, and the application fields of wireless sensor networks are introduced. The technical standards of routing protocols in wireless sensor networks are studied. The performance evaluation criteria and the typical routing algorithms for wireless sensor networks are analyzed and compared. Secondly, focusing on the research and analysis of clustering routing algorithm, two different clustering routing algorithms, LEACH and HEED, are selected as the research objects, and the execution process of these two routing algorithms is explained in detail. The limitations of these two algorithms are analyzed. On the basis of making full use of the advantages of LEACH algorithm, this paper proposes an improved routing algorithm I-LEACH. in I-LEACH routing algorithm, the following three aspects are improved: (1) threshold formula; (2) optimal number of cluster heads; (3) cluster head distribution. Aiming at the shortcomings of HEED routing algorithm, this paper proposes an improved I-HEED algorithm with the following improved schemes: (1) designing a non-uniform clustering mechanism; (2) designing a processing method for isolated nodes generated in HEED routing algorithm. Finally, the proposed improved algorithm is simulated and compared in the aspects of network lifetime, cluster head node distribution, network energy consumption balance, and so on, to verify the advanced nature of the improved routing algorithm. The comparison and analysis of simulation results show that the improved routing algorithm has better network performance and longer network lifetime than the original routing algorithm.
【學(xué)位授予單位】：安徽理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP212.9;TN929.5

【參考文獻(xiàn)】

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

1 張榮博;曹建福;;利用蟻群優(yōu)化的非均勻分簇?zé)o線傳感器網(wǎng)絡(luò)路由算法[J];西安交通大學(xué)學(xué)報(bào);2010年06期

，

本文編號(hào)：2415211