無線傳感器網(wǎng)絡(luò)中數(shù)據(jù)融合算法的研究
發(fā)布時(shí)間：2018-07-18 13:19
【摘要】：無線傳感器網(wǎng)絡(luò)在軍事、醫(yī)療、環(huán)境等諸多領(lǐng)域有著廣闊的應(yīng)用前景，因而受到越來越多的關(guān)注。無線傳感器網(wǎng)絡(luò)中節(jié)點(diǎn)能量受限，因此延長(zhǎng)網(wǎng)絡(luò)的生命周期成為首要考慮的問題。在網(wǎng)絡(luò)中，節(jié)點(diǎn)的能量主要消耗在數(shù)據(jù)采集、處理和傳輸三方面，其中傳輸消耗得最多；而數(shù)據(jù)融合正是一種減少數(shù)據(jù)通信量的技術(shù)，在節(jié)能方面效果顯著，現(xiàn)已經(jīng)成為無線傳感器網(wǎng)絡(luò)的一個(gè)研究熱點(diǎn)。 本文從現(xiàn)有的路由協(xié)議和數(shù)據(jù)融合算法著手研究，，提出了基于能量?jī)?yōu)化的可靠數(shù)據(jù)融合改進(jìn)算法（EORDA）。（1）針對(duì)分層路由協(xié)議中簇頭節(jié)點(diǎn)負(fù)載過重的問題，在簇的建立階段，運(yùn)用自適應(yīng)k均值算法分簇，并綜合考慮節(jié)點(diǎn)的位置、剩余能量及其可靠性選擇簇頭；在通信階段，簇頭將融合后的數(shù)據(jù)沿著蟻群算法找到的最優(yōu)路徑以多跳方式發(fā)送給基站；從而有效解決了均勻分簇以及簇頭靈活選擇通信方式的問題。（2）針對(duì)現(xiàn)有融合算法存在的容錯(cuò)性及通用性不強(qiáng)等問題，提出先依照節(jié)點(diǎn)信譽(yù)清洗原始數(shù)據(jù)，再運(yùn)用核主成分分析法提取數(shù)據(jù)的主要信息，然后發(fā)送給基站進(jìn)行決策分析，從而在確保數(shù)據(jù)融合可靠性的基礎(chǔ)上大幅降低了數(shù)據(jù)通信量。 仿真結(jié)果表明：在五種網(wǎng)絡(luò)場(chǎng)景中，該算法在均衡網(wǎng)絡(luò)能耗方面均取得了良好效果，能使網(wǎng)絡(luò)生命周期延長(zhǎng)至少24%；在四種融合方案中，該算法不僅使網(wǎng)絡(luò)中數(shù)據(jù)報(bào)個(gè)數(shù)大幅減少，而且使數(shù)據(jù)融合精度達(dá)到98%左右。
[Abstract]:Wireless sensor networks (WSN) have wide application prospects in military, medical, environmental and other fields, so more and more attention has been paid to wireless sensor networks. In wireless sensor networks (WSN), the energy of nodes is limited, so prolonging the lifetime of wireless sensor networks becomes the most important consideration. In the network, the energy of nodes is mainly consumed in three aspects: data acquisition, processing and transmission, among which transmission consumption is the most, and data fusion is a technology to reduce data traffic, which has remarkable effect in energy saving. Now it has become a research hotspot in wireless sensor networks. Based on the existing routing protocols and data fusion algorithms, an improved reliable data fusion algorithm based on energy optimization (Eorda). (1) is proposed in this paper, which aims at the problem of overloaded cluster head nodes in hierarchical routing protocols. The adaptive k-means algorithm is used to cluster and consider the location of nodes, residual energy and its reliability to select cluster heads. In the communication stage, the fused data is sent to the base station in a multi-hop way along the optimal path found by ant colony algorithm. Thus, the problem of uniform clustering and flexible selection of communication mode by cluster heads is solved effectively. (2) aiming at the problems of fault tolerance and universality of existing fusion algorithms, it is proposed that the original data should be washed according to the reputation of nodes first. Then the kernel principal component analysis (KPCA) is used to extract the main information of the data, and then send it to the base station for decision analysis, thus greatly reducing the data traffic on the basis of ensuring the reliability of the data fusion. The simulation results show that the proposed algorithm achieves good results in balancing network energy consumption in five network scenarios, and can prolong the network life cycle by at least 24%. The algorithm not only reduces the number of Datagram in the network, but also makes the data fusion accuracy about 98%.
【學(xué)位授予單位】：西安電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP212.9;TN929.5
[Abstract]:Wireless sensor networks (WSN) have wide application prospects in military, medical, environmental and other fields, so more and more attention has been paid to wireless sensor networks. In wireless sensor networks (WSN), the energy of nodes is limited, so prolonging the lifetime of wireless sensor networks becomes the most important consideration. In the network, the energy of nodes is mainly consumed in three aspects: data acquisition, processing and transmission, among which transmission consumption is the most, and data fusion is a technology to reduce data traffic, which has remarkable effect in energy saving. Now it has become a research hotspot in wireless sensor networks. Based on the existing routing protocols and data fusion algorithms, an improved reliable data fusion algorithm based on energy optimization (Eorda). (1) is proposed in this paper, which aims at the problem of overloaded cluster head nodes in hierarchical routing protocols. The adaptive k-means algorithm is used to cluster and consider the location of nodes, residual energy and its reliability to select cluster heads. In the communication stage, the fused data is sent to the base station in a multi-hop way along the optimal path found by ant colony algorithm. Thus, the problem of uniform clustering and flexible selection of communication mode by cluster heads is solved effectively. (2) aiming at the problems of fault tolerance and universality of existing fusion algorithms, it is proposed that the original data should be washed according to the reputation of nodes first. Then the kernel principal component analysis (KPCA) is used to extract the main information of the data, and then send it to the base station for decision analysis, thus greatly reducing the data traffic on the basis of ensuring the reliability of the data fusion. The simulation results show that the proposed algorithm achieves good results in balancing network energy consumption in five network scenarios, and can prolong the network life cycle by at least 24%. The algorithm not only reduces the number of Datagram in the network, but also makes the data fusion accuracy about 98%.
【學(xué)位授予單位】：西安電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP212.9;TN929.5
【參考文獻(xiàn)】
相關(guān)期刊論文 前10條
1 孫其博;劉杰;黎
本文編號(hào)：2132021
本文鏈接：http://sikaile.net/kejilunwen/wltx/2132021.html
最近更新
教材專著
