發(fā)布時(shí)間：2018-03-21 13:32

  本文選題：多輪分簇　切入點(diǎn)：分組　出處：《安徽理工大學(xué)》2017年碩士論文　論文類(lèi)型：學(xué)位論文

【摘要】：無(wú)線(xiàn)傳感器網(wǎng)絡(luò)近些年獲得了很多關(guān)注,它們具有開(kāi)發(fā)大量效益可觀(guān)的應(yīng)用的潛力,其已經(jīng)可以用于諸如災(zāi)難管理,智能監(jiān)視和邊界安全等多個(gè)領(lǐng)域。在這些應(yīng)用中,需要無(wú)人值守并且獨(dú)立工作的傳感器節(jié)點(diǎn)的集合。無(wú)線(xiàn)傳感器網(wǎng)絡(luò)中最大的缺陷是節(jié)點(diǎn)能量不足,可生存性是衡量網(wǎng)絡(luò)服務(wù)質(zhì)量的主要性能。分簇是在可生存性的前提下,為實(shí)現(xiàn)更好地利用節(jié)點(diǎn)的重要技術(shù),這也有助于在網(wǎng)絡(luò)中獲得更好的負(fù)載分布。本文針對(duì)分簇算法及數(shù)據(jù)傳輸協(xié)議進(jìn)行了優(yōu)化,主要工作如下:(1)針對(duì)LEACH算法中簇頭能量消耗過(guò)快的缺陷,提出一種基于分組的無(wú)線(xiàn)傳感網(wǎng)可生存性多輪分簇算法LEACH-G,在分簇過(guò)程中采用分組的策略,利用信標(biāo)節(jié)點(diǎn)signpost,在簇頭選出之前承擔(dān)通信任務(wù),均衡整個(gè)網(wǎng)絡(luò)能耗,并在簇頭選取閾值中引入節(jié)點(diǎn)與基站之間的距離以及能量參數(shù),可以降低10%-15%的網(wǎng)絡(luò)能耗。(2)針對(duì)無(wú)線(xiàn)傳感器網(wǎng)絡(luò)分簇后數(shù)據(jù)在傳輸過(guò)程中易丟失以及傳輸路徑的缺陷,提出了一種基于分組的無(wú)線(xiàn)傳感網(wǎng)可生存性數(shù)據(jù)傳輸協(xié)議GCDT。通過(guò)計(jì)算數(shù)據(jù)包可達(dá)概率,將原始數(shù)據(jù)包分組,對(duì)數(shù)據(jù)進(jìn)行加密設(shè)計(jì),保證數(shù)據(jù)在傳輸前的完整性;建立簇頭與基站間的多路徑,并對(duì)多路徑進(jìn)行優(yōu)化設(shè)計(jì),確保分組數(shù)據(jù)包的可靠傳輸。與目前的可生存路由相比,GCDT協(xié)議的丟包率可降低約15%～28%,有效的提高數(shù)據(jù)傳輸?shù)目煽啃院途W(wǎng)絡(luò)可生存性。(3)為了評(píng)估所提協(xié)議的性能,利用MATLAB7.0在相同條件下仿真所提協(xié)議與已提出的可生存路由協(xié)議,根據(jù)已有的標(biāo)準(zhǔn)數(shù)據(jù)設(shè)置傳感器節(jié)點(diǎn)個(gè)數(shù)及仿真實(shí)驗(yàn)場(chǎng)景參數(shù)(如節(jié)點(diǎn)數(shù)量、節(jié)點(diǎn)初始能量節(jié)點(diǎn)信息比特?cái)?shù)等)。從網(wǎng)絡(luò)生存時(shí)間、丟包率和平均能耗等方面仿真對(duì)比算法性能及效果,從而驗(yàn)證無(wú)線(xiàn)傳感網(wǎng)分簇、數(shù)據(jù)傳輸及降低能耗的研究方案。
[Abstract]:In recent years, wireless sensor networks have received a lot of attention, they have developed a large number of benefits are considerable application potential, it can already be used in many fields such as disaster management, intelligent monitoring and border security. In these applications, sensor nodes need unattended and independent work. The biggest flaw in the wireless sensor network node energy shortage, survivability is the main performance measure of the quality of network service. The cluster is in the premise of survivability, in order to achieve better utilization of important technology nodes, which also helps to get better in the network load distribution. This paper optimized clustering algorithm and data transmission protocol. The main work is as follows: (1) the energy of cluster head LEACH algorithm consumes excessive defects, put forward a kind of wireless sensor network based on packet survivability multiple clustering algorithm LEACH-G, in The grouping strategy uses the clustering process, the beacon node signpost, undertake communication tasks in the cluster head selected before the balanced energy consumption of the whole network, and the cluster head selection is introduced between the node and the base station distance and energy parameter threshold, 10%-15% can reduce the energy consumption of the network. (2) aiming at the defects of the clustered wireless sensor networks after the data in the transmission process is easy to lose and the transmission path, a wireless sensor network based on packet survivability data transmission protocol GCDT. by calculating the packet to probability, the original data packet, data encryption design, ensure data integrity in the transmission before; establishing multi path cluster head and base station between, and to optimize the path design, ensure the reliable transmission of data packet. And the survivable routing protocol, GCDT packet loss rate can be reduced from about 15% to 28%, effectively. The reliability and survivability of high data transmission. (3) to evaluate the performance of the proposed protocol, using MATLAB7.0 simulation under the same conditions, the proposed protocol and proposed survivable routing protocol, according to the standard data set the number of sensor nodes and simulation scene parameters (such as the number of nodes, the initial node the node energy information bits etc.). The survival time of the network packet loss rate and average energy consumption and other aspects of simulation performance and effect, in order to verify the wireless sensor network clustering, scheme of data transmission and reduce energy consumption.

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

【參考文獻(xiàn)】

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

1 HUANGFU Wei;ZHANG ZhongShan;CHAI XiaoMeng;LONG KePing;;Survivability-oriented optimal node density for randomly deployed wireless sensor networks[J];Science China(Information Sciences);2014年02期

2 孫彥清;彭艦;劉唐;陳曉海;;基于動(dòng)態(tài)分區(qū)的無(wú)線(xiàn)傳感器網(wǎng)絡(luò)非均勻成簇路由協(xié)議[J];通信學(xué)報(bào);2014年01期

3 曹建玲;陳永超;任智;李晴陽(yáng);;基于多輪分簇的無(wú)線(xiàn)傳感器網(wǎng)絡(luò)路由協(xié)議[J];計(jì)算機(jī)科學(xué);2013年07期

4 李洪兵;熊慶宇;石為人;;無(wú)線(xiàn)傳感器網(wǎng)絡(luò)非均勻等級(jí)分簇拓?fù)浣Y(jié)構(gòu)研究[J];計(jì)算機(jī)科學(xué);2013年02期

5 李坤;黃開(kāi)枝;吉江;馮濤;靳彥青;;基于系統(tǒng)平均性能增益最大化的基站群協(xié)同分簇方案[J];通信學(xué)報(bào);2012年11期

6 張擎;柴喬林;;基于簇頭冗余的WSN不等規(guī)模分簇路由[J];計(jì)算機(jī)工程;2011年14期

7 陳慶章;趙小敏;陳曉瑩;;提高無(wú)線(xiàn)傳感器網(wǎng)絡(luò)能效的雙輪成簇協(xié)議設(shè)計(jì)[J];軟件學(xué)報(bào);2010年11期

8 劉琳;于海斌;;異構(gòu)無(wú)線(xiàn)傳感器網(wǎng)絡(luò)中簇首的優(yōu)化部署策略[J];通信學(xué)報(bào);2010年10期

9 王超;馬建峰;朱建明;;網(wǎng)絡(luò)系統(tǒng)的可生存性研究綜述[J];網(wǎng)絡(luò)安全技術(shù)與應(yīng)用;2006年06期

10 卿利;朱清新;王明文;;異構(gòu)傳感器網(wǎng)絡(luò)的分布式能量有效成簇算法[J];軟件學(xué)報(bào);2006年03期

，

本文編號(hào)：1644065