【摘要】：無(wú)線傳感器網(wǎng)絡(luò)(Wireless Sensor Networks,WSN)是綜合多門(mén)學(xué)科技術(shù)的新興技術(shù)之一,具有數(shù)據(jù)采集、處理和傳輸?shù)墓δ堋鞲衅鞴?jié)點(diǎn)自組織形成網(wǎng)絡(luò)感知環(huán)境參數(shù)信息,實(shí)現(xiàn)對(duì)客觀物理世界的認(rèn)識(shí)。目前,WSN的應(yīng)用已經(jīng)滲透到各行各業(yè),具有廣闊的應(yīng)用前景和巨大的商業(yè)價(jià)值。然而,傳感器節(jié)點(diǎn)攜帶的電量有限,并且節(jié)點(diǎn)物理結(jié)構(gòu)的特殊性使其存儲(chǔ)、計(jì)算和通信等方面的能力受到限制,因此設(shè)計(jì)出高性能的WSN路由協(xié)議尤為重要。研究表明,層次路由協(xié)議與平面路由協(xié)議相比,在網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)、能量利用效率等方面更具有優(yōu)勢(shì)。采用分簇策略和多跳路由機(jī)制的WSN路由協(xié)議可以有效均衡WSN的能量消耗,延長(zhǎng)網(wǎng)絡(luò)的生命周期,隨著研究的進(jìn)展,大規(guī)模WSN的路由協(xié)議也逐漸趨于層次化。粒子群優(yōu)化算法(Particle Swarm Optimization,PSO)具有實(shí)現(xiàn)簡(jiǎn)單、自組織性好等優(yōu)點(diǎn),適合應(yīng)用在組合優(yōu)化和網(wǎng)絡(luò)路由等問(wèn)題上,而且PSO算法可以滿足WSN對(duì)高性能路由的要求。通過(guò)引入PSO算法原理,可以動(dòng)態(tài)優(yōu)化WSN分簇和路由選擇等問(wèn)題,提高網(wǎng)絡(luò)的穩(wěn)定性,延長(zhǎng)網(wǎng)絡(luò)的生命周期。本文的主要工作和創(chuàng)新點(diǎn)為:(1)通過(guò)分析WSN在多跳通信時(shí)的拓?fù)浣Y(jié)構(gòu)和能耗模型,在對(duì)網(wǎng)絡(luò)進(jìn)行分簇的基礎(chǔ)上,提出一種非均勻的節(jié)點(diǎn)部署策略,該策略量化了簇內(nèi)節(jié)點(diǎn)的數(shù)量關(guān)系,并設(shè)計(jì)了相應(yīng)的路由協(xié)議。(2)針對(duì)WSN的特殊應(yīng)用環(huán)境,提出一種兩層WSN中繼節(jié)點(diǎn)的部署方法,該方法基于中繼節(jié)點(diǎn)在網(wǎng)絡(luò)工作過(guò)程中大致同時(shí)改變的原理,將中繼節(jié)點(diǎn)的更替看作中繼節(jié)點(diǎn)的虛擬移動(dòng),以找到部署中繼節(jié)點(diǎn)的最佳位置和數(shù)量。(3)提出新的WSN分簇路由算法,在充分考慮傳感器節(jié)點(diǎn)的剩余能量、簇間距離和節(jié)點(diǎn)間距等因素的基礎(chǔ)上,重新設(shè)計(jì)適應(yīng)值函數(shù),應(yīng)用PSO優(yōu)化簇首選擇,以均衡網(wǎng)絡(luò)能耗,延長(zhǎng)網(wǎng)絡(luò)的生命周期。
[Abstract]:Wireless Sensor Network (Wireless Sensor Networks,WSN) is one of the new technologies which integrate multi-subject technology. It has the functions of data acquisition, processing and transmission. Sensor nodes self-organize to form the network-aware environmental parameter information to realize the understanding of the objective physical world. At present, the application of WSN has penetrated into various industries, with broad application prospects and huge commercial value. However, the sensor nodes carry a limited amount of electricity, and the particularity of the physical structure of the nodes limits their storage, computing and communication capabilities, so it is particularly important to design a high-performance WSN routing protocol. The research shows that the hierarchical routing protocol has more advantages than the planar routing protocol in the network topology, energy utilization efficiency and so on. The WSN routing protocol based on clustering strategy and multi-hop routing mechanism can effectively balance the energy consumption of WSN and prolong the lifetime of the network. With the development of research, the routing protocols of large-scale WSN become more and more hierarchical. Particle swarm optimization (Particle Swarm Optimization,PSO) has the advantages of simple implementation and good self-organization. It is suitable for application in combinatorial optimization and network routing, and PSO algorithm can meet the requirements of WSN for high performance routing. By introducing the principle of PSO algorithm, we can dynamically optimize the WSN clustering and routing problems, improve the stability of the network and prolong the network life cycle. The main work and innovations of this paper are as follows: (1) by analyzing the topology structure and energy consumption model of WSN in multi-hop communication, a non-uniform node deployment strategy is proposed on the basis of clustering network. The strategy quantifies the number of nodes in the cluster and designs the corresponding routing protocol. (2) for the special application environment of WSN, a two-layer WSN relay node deployment method is proposed. Based on the principle that the relay nodes change at the same time during the network operation, the replacement of the relay nodes is regarded as the virtual movement of the relay nodes to find the best location and number of the relay nodes deployed. (3) A new WSN clustering routing algorithm is proposed. On the basis of fully considering the residual energy of sensor nodes, the distance between clusters and the distance between nodes, the fitness function is redesigned, and the cluster head selection is optimized by using PSO to balance the network energy consumption and prolong the network life cycle.
【學(xué)位授予單位】：中國(guó)礦業(yè)大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類(lèi)號(hào)】：TP212.9;TN929.5

【參考文獻(xiàn)】

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

1 徐晶晶;張欣慧;許必宵;孫知信;;無(wú)線傳感器網(wǎng)絡(luò)分簇算法綜述[J];計(jì)算機(jī)科學(xué);2017年02期

2 周曉斐;;改進(jìn)粒子群算法優(yōu)化低功耗自適應(yīng)集簇分層的路由算法[J];激光雜志;2014年12期

3 郭劍;孫力娟;許文君;王汝傳;肖甫;;基于移動(dòng)sink的無(wú)線傳感器網(wǎng)絡(luò)數(shù)據(jù)采集方案[J];通信學(xué)報(bào);2012年09期

4 蔣暢江;石為人;唐賢倫;王平;向敏;;能量均衡的無(wú)線傳感器網(wǎng)絡(luò)非均勻分簇路由協(xié)議[J];軟件學(xué)報(bào);2012年05期

5 凡高娟;郭拯危;;無(wú)線傳感器網(wǎng)絡(luò)節(jié)點(diǎn)部署研究進(jìn)展[J];傳感器與微系統(tǒng);2012年04期

6 胡旺;張?chǎng)?;一種基于進(jìn)化過(guò)程學(xué)習(xí)的粒子群優(yōu)化算法[J];計(jì)算機(jī)科學(xué);2012年04期

7 廖卓凡;王建新;梁俊斌;;無(wú)線傳感器網(wǎng)絡(luò)中節(jié)點(diǎn)的動(dòng)態(tài)部署[J];計(jì)算機(jī)科學(xué);2011年10期

8 張超群;鄭建國(guó);王翔;;蜂群算法研究綜述[J];計(jì)算機(jī)應(yīng)用研究;2011年09期

9 蘇兵;黃冠發(fā);;基于粒子群優(yōu)化的WSN非均勻分簇路由算法[J];計(jì)算機(jī)應(yīng)用;2011年09期

10 趙成林;毛松;譚虎;;無(wú)線傳感器網(wǎng)絡(luò)能量均衡分簇路由協(xié)議[J];無(wú)線電工程;2011年03期

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

1 劉禮;無(wú)線傳感器網(wǎng)絡(luò)節(jié)能問(wèn)題及相關(guān)的圖論問(wèn)題[D];蘭州大學(xué);2008年

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

1 彭們;粒子群算法在組合優(yōu)化問(wèn)題上的應(yīng)用研究[D];西安理工大學(xué);2009年

2 劉志強(qiáng);基于無(wú)線傳感器網(wǎng)絡(luò)的倉(cāng)庫(kù)環(huán)境監(jiān)測(cè)系統(tǒng)設(shè)計(jì)與實(shí)現(xiàn)[D];國(guó)防科學(xué)技術(shù)大學(xué);2008年

，

本文編號(hào)：2283865