本文選題：多Sink無(wú)線傳感器網(wǎng)絡(luò)　切入點(diǎn)：數(shù)據(jù)匯集　出處：《福州大學(xué)》2014年碩士論文

【摘要】：集成了數(shù)字電子技術(shù)、微機(jī)電系統(tǒng)和無(wú)線通信技術(shù)而形成的無(wú)線傳感器網(wǎng)絡(luò)是一種獲取信息和處理信息的新技術(shù)。無(wú)線傳感器網(wǎng)絡(luò)是由具有感知能力、計(jì)算能力和通信能力的微型傳感器節(jié)點(diǎn)所組成,在軍事國(guó)防、環(huán)境監(jiān)控和醫(yī)療健康等領(lǐng)域展現(xiàn)了廣闊的應(yīng)用前景。隨著傳感器網(wǎng)絡(luò)規(guī)模的擴(kuò)大,多個(gè)Sink節(jié)點(diǎn)環(huán)境下的研究越來(lái)越得到重視。無(wú)線傳感器網(wǎng)絡(luò)中節(jié)點(diǎn)的密集分布,使得相鄰節(jié)點(diǎn)感知到的數(shù)據(jù)存在相關(guān)性。為減少數(shù)據(jù)的冗余傳輸,網(wǎng)內(nèi)數(shù)據(jù)匯集被提出并成為無(wú)線傳感器網(wǎng)絡(luò)的一項(xiàng)重要技術(shù)。在實(shí)時(shí)的應(yīng)用中,為保證數(shù)據(jù)匯集的時(shí)效性,端到端時(shí)延是一項(xiàng)重要的性能指標(biāo)�，F(xiàn)有基于樹(shù)形結(jié)構(gòu)的匯集調(diào)度都是按照先構(gòu)造匯集樹(shù),再為節(jié)點(diǎn)分配時(shí)隙這兩階段來(lái)實(shí)現(xiàn),并不能充分利用時(shí)隙,導(dǎo)致匯集時(shí)延較大。此外,現(xiàn)有的大部分匯集工作都是針對(duì)可靠通信環(huán)境展開(kāi),在更符合實(shí)際的不可靠通信環(huán)境下研究能量有效的數(shù)據(jù)匯集在能量受限的傳感器網(wǎng)絡(luò)中顯得更有意義。基于上述考慮,本文研究了最小時(shí)延數(shù)據(jù)匯集調(diào)度問(wèn)題和不可靠通信環(huán)境下最大化網(wǎng)絡(luò)生命期的數(shù)據(jù)匯集問(wèn)題。(1)研究了最小時(shí)延數(shù)據(jù)匯集調(diào)度問(wèn)題,提出了分層的匯集調(diào)度算法,能夠有效降低網(wǎng)絡(luò)的數(shù)據(jù)匯集時(shí)延。本文利用廣度優(yōu)先搜索對(duì)傳感器網(wǎng)絡(luò)的節(jié)點(diǎn)進(jìn)行分層。然后,文中根據(jù)分配的時(shí)隙序號(hào)和該時(shí)隙的最大化利用逐層地為節(jié)點(diǎn)選擇父節(jié)點(diǎn)�；诖�,本文分別提出了基于極大獨(dú)立集和不采用獨(dú)立集以進(jìn)一步擴(kuò)展父節(jié)點(diǎn)選擇范圍的匯集調(diào)度算法,并從理論上對(duì)算法的性能進(jìn)行分析。實(shí)驗(yàn)結(jié)果表明,本文所提出的算法能夠充分利用時(shí)隙,以低時(shí)延進(jìn)行匯集調(diào)度。(2)研究了不可靠通信環(huán)境下最大化網(wǎng)絡(luò)生命期的數(shù)據(jù)匯集問(wèn)題,提出樹(shù)形結(jié)構(gòu)的匯集算法和有向無(wú)環(huán)圖的匯集算法,能夠有效延長(zhǎng)網(wǎng)絡(luò)生命期。本文首先分析了相鄰節(jié)點(diǎn)之間的通信,給出了為保證節(jié)點(diǎn)間成功通信所消耗的平均能量最小時(shí)的最優(yōu)發(fā)送半徑,并分析了如何為傳感器節(jié)點(diǎn)選擇Sink節(jié)點(diǎn)的問(wèn)題。在此基礎(chǔ)上,本文以均衡節(jié)點(diǎn)的能量消耗為導(dǎo)向,依據(jù)節(jié)點(diǎn)的剩余能量和通信代價(jià),提出了基于樹(shù)形拓?fù)涞膮R集算法,以及可以提高數(shù)據(jù)接收概率的有向無(wú)環(huán)圖匯集算法。實(shí)驗(yàn)結(jié)果表明,本文提出的算法在網(wǎng)絡(luò)生命期上能取得較優(yōu)的性能。
[Abstract]:The integration of digital electronic technology, wireless sensor network, MEMS and wireless communication technology which is a new technology of acquiring and processing information. Wireless sensor network is composed of micro sensor nodes with sensing capability, computation and communication capabilities of the group, military defense, environmental monitoring and medical and health fields show a broad application prospects. With the expansion of the scale of sensor networks, multiple Sink nodes environment gets more and more attention. The dense distribution of nodes in wireless sensor networks, a correlation exists between the adjacent nodes to sense data. In order to reduce the data redundancy, data collection is proposed and become an important technology in wireless sensor networks. In real-time applications, in order to ensure the timeliness of data collection, the end-to-end delay is an important performance index of the existing base. In the aggregation tree structure are first constructed in accordance with the collection of trees, to the two stage to assign time slots to nodes to achieve, and can not make full use of time slots, resulting in pooled delay. In addition, most of the existing collection of work are based on the reliable communication environment, with unreliable communication environment in the practical research data energy efficient collection of more significance in energy constrained sensor networks. Based on the above considerations, this paper studies the minimum delay of data collection scheduling problem and unreliable number to maximize the network lifetime communication environment according to the collection of problems. (1) the minimum delay of data collection scheduling problem, put forward a hierarchical collection scheduling algorithm that can effectively reduce the network delay of data collection. This paper uses the breadth first search nodes to the sensor network layer. Then, according to the assigned time slot sequence Layer select the parent node to the node with the maximum number and time slot. Based on this, this paper proposes a maximal independent set and the independent set to further expand the scope of the collection of the parent node selection algorithm based on scheduling, and analyze the performance of the algorithm theoretically. Experimental results show that the proposed the algorithm can make full use of time slots, pooled scheduling with low delay. (2) study is not reliable to maximize the network lifetime data communication environment together, put together the tree structure and algorithm of acyclic graph collection algorithm, can effectively prolong the life time of the network. This paper analyzes the communication between adjacent nodes the proposed to ensure the inter node average energy consumption of the most successful communication hours of optimal transmission radius, and analyzes how to choose Sink sensor node node problem. On the basis of In this paper, in order to balance the node energy consumption oriented, based on the residual energy of nodes and the communication cost, is proposed based on tree topology aggregation algorithm, and can improve the data receiving probability of the directed acyclic graph collection algorithm. The experimental results show that the proposed algorithm can achieve better performance on Network lifetime.

【學(xué)位授予單位】：福州大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類(lèi)號(hào)】：TN929.5;TP212.9

【相似文獻(xiàn)】

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

1 唐云建;石為人;易軍;王燕霞;;面向WSN數(shù)據(jù)匯集應(yīng)用的動(dòng)態(tài)負(fù)載均衡算法[J];計(jì)算機(jī)工程與應(yīng)用;2011年06期

2 唐云建;石為人;易軍;王燕霞;;基于蟻群優(yōu)化的WSN負(fù)載均衡數(shù)據(jù)匯集算法[J];高技術(shù)通訊;2010年08期

3 蘇海濱;王彥超;于步亞;;省網(wǎng)小水電管理技術(shù)支持系統(tǒng)數(shù)據(jù)匯集平臺(tái)子系統(tǒng)的設(shè)計(jì)[J];自動(dòng)化應(yīng)用;2013年02期

4 朱藝華;袁婧;李燕君;彭靜;;分裂無(wú)線傳感器網(wǎng)絡(luò)基于消息擺渡的數(shù)據(jù)匯集策略[J];計(jì)算機(jī)研究與發(fā)展;2010年S2期

5 孫欽;張宏軍;劉耀勛;張睿;;軍事訓(xùn)練演習(xí)數(shù)據(jù)匯集與融合系統(tǒng)的設(shè)計(jì)與實(shí)現(xiàn)[J];指揮控制與仿真;2012年03期

6 譚明超;馮徑;舒曉村;王娟;;基于JMS的氣象數(shù)據(jù)匯集系統(tǒng)的研究與實(shí)現(xiàn)[J];計(jì)算機(jī)與信息技術(shù);2006年03期

7 劉玲;柴喬林;耿曉義;;考慮負(fù)載均衡的無(wú)線傳感器網(wǎng)絡(luò)數(shù)據(jù)匯集算法[J];計(jì)算機(jī)工程與應(yīng)用;2007年33期

8 石為人;唐云建;王燕霞;;基于擁塞控制的無(wú)線傳感器網(wǎng)絡(luò)數(shù)據(jù)匯集樹(shù)生成算法[J];自動(dòng)化學(xué)報(bào);2010年06期

9 韋啟森;貴在探索[J];上海微型計(jì)算機(jī);2000年Z2期

10 陳永燥;程紅舉;;多Sink無(wú)線傳感器網(wǎng)絡(luò)中最小時(shí)延數(shù)據(jù)匯集調(diào)度算法設(shè)計(jì)[J];小型微型計(jì)算機(jī)系統(tǒng);2014年04期

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

1 黃劍;王海員;石為人;唐云建;許磊;;基于蟻群優(yōu)化的能量均衡數(shù)據(jù)匯集算法[A];2010中國(guó)儀器儀表與測(cè)控技術(shù)大會(huì)論文集[C];2010年

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

1 艾德里安·愛(ài)莎 李沐 譯;黃金數(shù)據(jù)匯集:關(guān)于金價(jià)暴跌的歷史學(xué)觀點(diǎn)[N];中國(guó)黃金報(bào);2013年

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

1 唐云建;無(wú)線傳感器網(wǎng)絡(luò)負(fù)載均衡數(shù)據(jù)匯集算法研究[D];重慶大學(xué);2010年

2 李云鶴;基于壓縮網(wǎng)絡(luò)編碼的高能效WSN數(shù)據(jù)匯集方法研究[D];哈爾濱工業(yè)大學(xué);2014年

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

1 王曉暉;支持多源異構(gòu)流數(shù)據(jù)匯集的通信服務(wù)器設(shè)計(jì)與實(shí)現(xiàn)[D];北方工業(yè)大學(xué);2016年

2 王江山;多路高速數(shù)字信號(hào)傳輸與實(shí)時(shí)顯示系統(tǒng)設(shè)計(jì)與實(shí)現(xiàn)[D];東北大學(xué);2014年

3 李菲菲;三維無(wú)線傳感器網(wǎng)絡(luò)數(shù)據(jù)匯集問(wèn)題的研究[D];福州大學(xué);2013年

4 陳永燥;多Sink環(huán)境下的無(wú)線傳感器網(wǎng)絡(luò)數(shù)據(jù)匯集問(wèn)題的研究[D];福州大學(xué);2014年

5 曹張治;空間環(huán)境科學(xué)數(shù)據(jù)匯集及關(guān)鍵技術(shù)研究[D];中國(guó)地質(zhì)大學(xué)（北京）;2010年

6 王曉升;基于閃存陣列的數(shù)據(jù)匯集系統(tǒng)的設(shè)計(jì)與實(shí)現(xiàn)[D];中北大學(xué);2014年

7 雷姝潔;基于Tuxedo的水利數(shù)據(jù)匯集探析[D];南昌大學(xué);2009年

8 程峰;子午工程數(shù)據(jù)匯集子系統(tǒng)的設(shè)計(jì)與實(shí)現(xiàn)[D];中國(guó)地質(zhì)大學(xué)（北京）;2009年

，

本文編號(hào)：1663316