本文選題：無線傳感器網(wǎng)絡(luò) + 數(shù)據(jù)匯聚��； 參考：《東北大學(xué)》2014年碩士論文

【摘要】：無線傳感器網(wǎng)絡(luò)(WSN)由部署在監(jiān)測區(qū)域的大量微型傳感器節(jié)點(diǎn)組成,并通過無線通信方式形成的一種多跳自組織的網(wǎng)絡(luò)系統(tǒng),它能夠采集監(jiān)測區(qū)域數(shù)據(jù),并通過匯聚節(jié)點(diǎn)將數(shù)據(jù)傳送至客戶端,從而達(dá)到對目標(biāo)區(qū)域監(jiān)測的目的。由于無線傳感器節(jié)點(diǎn)能量嚴(yán)重受限,因此如何降低網(wǎng)絡(luò)能耗,提高網(wǎng)絡(luò)的生存周期已成為無線傳感器網(wǎng)絡(luò)研究的熱點(diǎn)。研究表明,無線傳感器網(wǎng)絡(luò)數(shù)據(jù)匯聚算法對網(wǎng)絡(luò)性能有很大影響,設(shè)計有效的數(shù)據(jù)匯聚算法可以延長網(wǎng)絡(luò)生存周期。本文針對無線傳感器網(wǎng)絡(luò)數(shù)據(jù)匯聚算法展開深入的研究,在分析了現(xiàn)有匯聚算法優(yōu)缺點(diǎn)的基礎(chǔ)上,針對網(wǎng)絡(luò)能耗不均衡的問題,從靜止無線傳感器網(wǎng)絡(luò)和基于移動sink的無線傳感器網(wǎng)絡(luò)兩方面進(jìn)行了研究：(1)針對靜止的無線傳感器網(wǎng)絡(luò),提出了一種能量有效的分簇數(shù)據(jù)匯聚路由算法LEACH-EM。該算法在簇首選舉時,將能量因素、網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)作為選擇簇首的依據(jù),并加入對閩值公式的約束,使選出的簇首更合理且在數(shù)輪之后閾值不會過低：在簇形成階段,對節(jié)點(diǎn)加入簇的方式進(jìn)行分析,節(jié)點(diǎn)選擇使網(wǎng)絡(luò)通信能耗最小的簇頭加入；在簇間數(shù)據(jù)傳輸階段,提出一種改進(jìn)權(quán)值的數(shù)據(jù)匯聚樹的形成方法,通過多跳數(shù)據(jù)傳輸來均衡網(wǎng)絡(luò)能耗。(2)針對基于移動sink的無線傳感器網(wǎng)絡(luò),提出了基于RP節(jié)點(diǎn)的數(shù)據(jù)匯聚算法DCRP。該算法可以分為RP (Rendezvous Point)節(jié)點(diǎn)選舉、網(wǎng)格內(nèi)數(shù)據(jù)匯聚和移動sink路徑優(yōu)化三個階段。由于RP節(jié)點(diǎn)的位置直接影響移動sink的路徑,所以在RP節(jié)點(diǎn)選舉階段,通過劃分網(wǎng)格并根據(jù)節(jié)點(diǎn)能量和網(wǎng)絡(luò)拓?fù)溥x擇RP節(jié)點(diǎn),使選舉出的RP節(jié)點(diǎn)數(shù)量合理且盡量靠攏；在網(wǎng)格內(nèi)數(shù)據(jù)匯聚階段,針對RP節(jié)點(diǎn)的位置特點(diǎn),設(shè)計二級簇結(jié)構(gòu),減少遠(yuǎn)距離節(jié)點(diǎn)在網(wǎng)格內(nèi)的數(shù)據(jù)傳輸能耗；最后利用模擬退火算法計算出遍歷RP節(jié)點(diǎn)的最優(yōu)路徑,并將TSP問題轉(zhuǎn)化為TSPN問題進(jìn)一步縮短移動sink的數(shù)據(jù)收集時間。仿真結(jié)果表明,本文提出的針對靜止無線傳感器網(wǎng)絡(luò)的數(shù)據(jù)匯聚路由算法能夠較好的延長網(wǎng)絡(luò)生存周期,針對基于移動sink的無線傳感器網(wǎng)絡(luò)提出的算法能夠在均衡網(wǎng)絡(luò)能耗的前提下,縮短網(wǎng)絡(luò)延時。
[Abstract]:WSNs are composed of a large number of micro-sensor nodes deployed in the monitoring area, and a multi-hop self-organizing network system is formed by wireless communication. WSNs can collect and monitor regional data. The data is transmitted to the client through the convergent node to achieve the purpose of monitoring the target area. As the energy of wireless sensor nodes is severely limited, how to reduce network energy consumption and improve the lifetime of wireless sensor networks has become a hot topic in wireless sensor networks. The research shows that the data aggregation algorithm of wireless sensor networks has a great impact on the performance of the network, and the design of an effective data aggregation algorithm can prolong the lifetime of the network. Based on the analysis of the advantages and disadvantages of the existing convergence algorithms, this paper aims at the problem of uneven energy consumption in wireless sensor networks. This paper studies static wireless sensor networks and wireless sensor networks based on mobile sink. For static wireless sensor networks, an energy-efficient clustering data aggregation routing algorithm, LEACH-EM, is proposed. When the cluster head is elected, the energy factor and the network topology are taken as the basis of the cluster head selection, and the constraint on the threshold formula is added to make the selected cluster head more reasonable and the threshold value is not too low after several rounds: in the cluster formation stage, After analyzing the way that nodes join the cluster, the node selects the cluster head which makes the network communication energy consumption minimum. In the phase of data transmission between clusters, a method of data aggregation tree with improved weights is proposed. For wireless sensor networks based on mobile sink, a data aggregation algorithm based on RP nodes is proposed. The algorithm can be divided into three stages: Rendezvous Point node election, data aggregation in grid and mobile sink path optimization. As the location of RP nodes directly affects the path of mobile sink, in the election phase of RP nodes, the number of selected RP nodes is reasonable and as close as possible by dividing grids and selecting RP nodes according to node energy and network topology. In the phase of data convergence in the grid, according to the location characteristics of RP nodes, the secondary cluster structure is designed to reduce the data transmission energy consumption of remote nodes in the grid. Finally, the optimal path of traversing RP nodes is calculated by simulated annealing algorithm. The tsp problem is transformed into the tsp problem and the data collection time of mobile sink is further shortened. Simulation results show that the proposed data aggregation routing algorithm for static wireless sensor networks can extend the lifetime of the network. The proposed algorithm for wireless sensor networks based on mobile sink can shorten the network delay on the premise of equalizing network energy consumption.
【學(xué)位授予單位】：東北大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TN929.5;TP212.9

【相似文獻(xiàn)】

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

1 ;專題討論[J];新聞研究導(dǎo)刊;2013年05期

2 陳德禮;郭江鴻;;基于位置信息的分簇傳感網(wǎng)數(shù)據(jù)匯聚方案[J];嘉應(yīng)學(xué)院學(xué)報;2013年11期

3 郭江鴻;張海峰;劉志宏;;基于簇分割的無線傳感網(wǎng)數(shù)據(jù)匯聚方案[J];計算機(jī)工程與設(shè)計;2013年07期

4 郭江鴻;陳德禮;劉志宏;;無線傳感器網(wǎng)絡(luò)簇內(nèi)數(shù)據(jù)匯聚方法[J];微電子學(xué)與計算機(jī);2013年09期

5 郭江鴻;馬建峰;;安全透明的無線傳感器網(wǎng)絡(luò)數(shù)據(jù)匯聚方案[J];通信學(xué)報;2012年10期

6 張建明;廖建勇;周四望;歐陽竟成;;傳感器網(wǎng)絡(luò)中可擴(kuò)展性好的數(shù)據(jù)匯聚與認(rèn)證協(xié)議[J];計算機(jī)工程與應(yīng)用;2006年20期

7 張建明;祝恩;周四望;歐陽竟成;;無線傳感器網(wǎng)絡(luò)中一種安全的數(shù)據(jù)匯聚與認(rèn)證協(xié)議[J];計算機(jī)工程與應(yīng)用;2006年31期

8 羅紅;楊放春;劉永和;;傳感器網(wǎng)絡(luò)中分布式數(shù)據(jù)匯聚路由算法[J];北京郵電大學(xué)學(xué)報;2007年01期

9 郭江鴻;羅予東;劉志宏;;基于概率傳輸?shù)臒o線傳感網(wǎng)數(shù)據(jù)匯聚方案[J];計算機(jī)應(yīng)用;2013年07期

10 劉嘉新;郎紅;李小明;;無線傳感器網(wǎng)絡(luò)山洪監(jiān)測數(shù)據(jù)匯聚平臺[J];自動化技術(shù)與應(yīng)用;2013年06期

相關(guān)會議論文 前1條

1 夏娜;徐普君;蔣建國;唐媚;李敦;錢浩偉;;無線傳感器網(wǎng)絡(luò)中基于聯(lián)盟的數(shù)據(jù)匯聚路由策略[A];全國第19屆計算機(jī)技術(shù)與應(yīng)用（CACIS）學(xué)術(shù)會議論文集（下冊）[C];2008年

相關(guān)重要報紙文章 前1條

1 ;向路由器高端挺進(jìn)[N];計算機(jī)世界;2005年

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

1 羅紅;無線傳感器網(wǎng)絡(luò)數(shù)據(jù)匯聚路由問題的研究[D];北京郵電大學(xué);2007年

2 曾波;面向數(shù)據(jù)匯聚傳感網(wǎng)絡(luò)的TDMA鏈路調(diào)度技術(shù)研究[D];浙江大學(xué);2013年

3 李爍;WSAN中時延約束的協(xié)作數(shù)據(jù)匯聚能效優(yōu)化研究[D];中南大學(xué);2014年

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

1 封靜嫻;無線傳感器網(wǎng)絡(luò)數(shù)據(jù)匯聚關(guān)鍵技術(shù)的研究[D];東北大學(xué);2014年

2 張寶藝;CPS中數(shù)據(jù)匯聚與分發(fā)機(jī)制研究[D];東北大學(xué);2014年

3 魏娟;無線傳感器網(wǎng)絡(luò)數(shù)據(jù)匯聚協(xié)議的研究[D];山東大學(xué);2009年

4 唐媚;WSN中基于聯(lián)盟的協(xié)同數(shù)據(jù)匯聚機(jī)制[D];合肥工業(yè)大學(xué);2010年

5 陳凱;無線傳感器網(wǎng)絡(luò)中能量有效的安全數(shù)據(jù)匯聚方法研究[D];湖南大學(xué);2007年

6 夏懷楠;支持跨域數(shù)據(jù)匯聚的關(guān)系數(shù)據(jù)訪問服務(wù)研究[D];山東科技大學(xué);2010年

，

本文編號：2044991