【摘要】：無線傳感器網(wǎng)絡(luò)節(jié)點(diǎn)定位算法是其應(yīng)用中的關(guān)鍵基礎(chǔ)性技術(shù)。無線傳感器網(wǎng)絡(luò)具有節(jié)點(diǎn)大規(guī)模隨機(jī)分布、資源有限和應(yīng)用環(huán)境復(fù)雜等特點(diǎn),給兼容性能與功耗的節(jié)點(diǎn)定位算法帶來了挑戰(zhàn)。本文基于非測距定位技術(shù),研究含有空洞的2D/3D無線傳感器網(wǎng)絡(luò)節(jié)點(diǎn)定位算法,以擴(kuò)展無線傳感器網(wǎng)絡(luò)的應(yīng)用方法。本文主要工作如下:(1)介紹了無線傳感器網(wǎng)絡(luò)定位算法和路由協(xié)議的研究現(xiàn)狀;對(duì)現(xiàn)有節(jié)點(diǎn)定位方法進(jìn)行了分類;分析討論了典型基于非測距節(jié)點(diǎn)定位算法對(duì)存在空洞的2D/3D傳感器網(wǎng)絡(luò)的實(shí)際應(yīng)用限制。(2)提出了一種基于鏈路相關(guān)性的覆蓋優(yōu)先和能量均衡機(jī)會(huì)式泛洪路由算法(CCEP)�；诠�(jié)點(diǎn)相對(duì)覆蓋和剩余能量大小作為分配轉(zhuǎn)發(fā)節(jié)點(diǎn)的順序,依據(jù)鏈路相關(guān)性對(duì)轉(zhuǎn)發(fā)子集ACK聚合。通過逐個(gè)增加轉(zhuǎn)發(fā)節(jié)點(diǎn),估算轉(zhuǎn)發(fā)節(jié)點(diǎn)信息傳輸預(yù)期可靠性,并統(tǒng)計(jì)ACK得到實(shí)時(shí)可靠性,動(dòng)態(tài)比較評(píng)判確定出最小轉(zhuǎn)發(fā)節(jié)點(diǎn)子集與重傳次數(shù)。仿真實(shí)驗(yàn)驗(yàn)證,本算法在滿足目標(biāo)可靠性同時(shí),有效減小了網(wǎng)絡(luò)通信負(fù)載,降低了節(jié)點(diǎn)能耗,促進(jìn)網(wǎng)絡(luò)節(jié)點(diǎn)剩余能量均衡,進(jìn)而延長了網(wǎng)絡(luò)生命周期。(3)提出了一種基于最短路徑置信度的節(jié)點(diǎn)間最佳距離估計(jì)算法(ODESPC)。通過識(shí)別泛洪路由算法生成的最短路徑樹中各級(jí)子樹的網(wǎng)絡(luò)空洞邊緣特殊節(jié)點(diǎn),利用網(wǎng)絡(luò)連通性和特殊節(jié)點(diǎn),計(jì)算出最短路徑置信度,提高了節(jié)點(diǎn)間距離估計(jì)精度。仿真實(shí)驗(yàn)結(jié)果表明,本算法能對(duì)含有空洞的網(wǎng)絡(luò)節(jié)點(diǎn)進(jìn)行定位估計(jì),提高了網(wǎng)絡(luò)節(jié)點(diǎn)定位覆蓋率。(4)提出了一種基于最佳距離估計(jì)和粒子群優(yōu)化的非測距定位算法(PSO-LAODE)。在ODESPC算法的基礎(chǔ)上,基于加權(quán)平均法進(jìn)行節(jié)點(diǎn)間平均跳距修正,基于改進(jìn)的粒子群算法對(duì)坐標(biāo)計(jì)算的結(jié)果進(jìn)行優(yōu)化,完成未知節(jié)點(diǎn)的定位。仿真實(shí)驗(yàn)分析了信標(biāo)節(jié)點(diǎn)數(shù)量對(duì)算法定位精度的影響,并且將PSO-LAODE算法與典型的DV-Hop算法進(jìn)行了比較分析。結(jié)果表明,PSO-LAODE算法在信標(biāo)節(jié)點(diǎn)較少時(shí)也能夠達(dá)到較高的定位覆蓋率和精度。可以適用于含有空洞的較大規(guī)模2D/3D無線傳感器網(wǎng)絡(luò)節(jié)點(diǎn)定位應(yīng)用。
[Abstract]:Node location algorithm in wireless sensor networks is the key basic technology in its application. Wireless sensor networks (WSN) are characterized by large scale random distribution of nodes, limited resources and complex application environments, which bring challenges to node localization algorithms with compatible performance and power consumption. Based on the non-ranging localization technology, this paper studies the node localization algorithm of 2D/3D wireless sensor networks with holes in order to extend the application method of wireless sensor networks. The main work of this paper is as follows: (1) the research status of wireless sensor network localization algorithms and routing protocols is introduced, and the existing node location methods are classified. This paper analyzes and discusses the practical application limitation of typical location algorithm based on non-ranging nodes to 2D/3D sensor networks with holes. (2) A coverage priority and energy balance opportunistic flooding based on link correlation is proposed. Routing algorithm (CCEP). Based on the relative coverage of the nodes and the residual energy as the order of allocating the forwarding nodes, the ACK of the forwarding subset is aggregated according to the link correlation. By increasing the forwarding nodes one by one, the expected reliability of the forwarding node information transmission is estimated, and the real-time reliability is obtained by statistical ACK. The minimal subset of forwarding nodes and the number of retransmissions are determined by dynamic comparison and evaluation. Simulation results show that the proposed algorithm can effectively reduce the network communication load, reduce the energy consumption of the nodes and promote the balance of the residual energy of the network nodes at the same time that the reliability of the target is satisfied. Furthermore, the network life cycle is prolonged. (3) an optimal distance estimation algorithm (ODESPC).) based on the shortest path confidence is proposed. By identifying the special nodes in the subtree of the shortest path tree generated by the flooding routing algorithm, the network connectivity and special nodes are used to calculate the confidence of the shortest path, and the accuracy of the distance estimation between nodes is improved. The simulation results show that the algorithm can estimate the location of network nodes with holes. The network node location coverage is improved. (4) A non-ranging localization algorithm (PSO-LAODE) based on optimal range estimation and particle swarm optimization is proposed. On the basis of ODESPC algorithm, the average hopping distance between nodes is modified based on weighted average method, and the results of coordinate calculation are optimized based on improved particle swarm optimization algorithm to locate unknown nodes. The effect of the number of beacon nodes on the localization accuracy of the algorithm is analyzed by simulation, and the PSO-LAODE algorithm is compared with the typical DV-Hop algorithm. The results show that the PSO-LAODE algorithm can achieve high localization coverage and accuracy when there are fewer beacon nodes. It can be used in large scale 2D/3D wireless sensor network node localization applications with holes.
【學(xué)位授予單位】：合肥工業(yè)大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TP212.9;TN929.5

【參考文獻(xiàn)】

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

1 趙晗;黃少卿;;基于改進(jìn)蟻群算法的無線傳感器網(wǎng)絡(luò)最小跳數(shù)路由選擇方法[J];電信科學(xué);2016年03期

2 蔣銳;楊震;;基于質(zhì)心迭代估計(jì)的無線傳感器網(wǎng)絡(luò)節(jié)點(diǎn)定位算法[J];物理學(xué)報(bào);2016年03期

3 王其華;郭戈;;無線傳感器網(wǎng)絡(luò)中基于雙支持向量回歸的分布式定位算法[J];中南大學(xué)學(xué)報(bào)(自然科學(xué)版);2015年08期

4 杜楊洋;毛永毅;;基于多功率移動(dòng)錨節(jié)點(diǎn)WSN智能定位算法[J];電子技術(shù)應(yīng)用;2015年06期

5 楊友華;孫麗華;向滿天;;基于質(zhì)點(diǎn)彈簧模型的無線傳感器網(wǎng)絡(luò)非測距定位算法[J];傳感技術(shù)學(xué)報(bào);2015年06期

6 黨小超;李芬芳;郝占軍;;基于移動(dòng)錨節(jié)點(diǎn)的模糊信息三維定位算法[J];計(jì)算機(jī)工程;2015年05期

7 趙繼軍;谷志群;薛亮;李志華;關(guān)新平;;WSN中層次型拓?fù)淇刂婆c網(wǎng)絡(luò)資源配置聯(lián)合設(shè)計(jì)方法[J];自動(dòng)化學(xué)報(bào);2015年03期

8 蘇金樹;郭文忠;余朝龍;陳國龍;;負(fù)載均衡感知的無線傳感器網(wǎng)絡(luò)容錯(cuò)分簇算法[J];計(jì)算機(jī)學(xué)報(bào);2014年02期

9 龔淼;馮友兵;卞建秀;;基于移動(dòng)錨節(jié)點(diǎn)的WSN節(jié)點(diǎn)定位方法[J];計(jì)算機(jī)科學(xué);2013年S2期

10 趙雁航;錢志鴻;尚小航;程超;;基于跳距修正粒子群優(yōu)化的WSN定位算法[J];通信學(xué)報(bào);2013年09期

，

本文編號(hào)：2352046