本文選題：無(wú)線傳感器網(wǎng)絡(luò) + DV-hop定位算法��； 參考：《南京大學(xué)》2014年碩士論文

【摘要】：無(wú)線傳感器網(wǎng)絡(luò)(Wireless Sensor Networks, WSN)由大量廉價(jià)的微型傳感器節(jié)點(diǎn)組成,節(jié)點(diǎn)之間通過(guò)無(wú)線通信方式形成多跳自組織網(wǎng)絡(luò)。無(wú)線傳感器網(wǎng)絡(luò)在許多領(lǐng)域有廣泛的應(yīng)用,網(wǎng)絡(luò)中節(jié)點(diǎn)的定位技術(shù)是無(wú)線傳感器網(wǎng)絡(luò)研究的眾多關(guān)鍵性問(wèn)題之一,本文將圍繞定位問(wèn)題做進(jìn)一步的分析和研究。無(wú)線傳感器網(wǎng)絡(luò)中的節(jié)點(diǎn)分為兩種：信標(biāo)節(jié)點(diǎn)和未知節(jié)點(diǎn)。已知自身坐標(biāo)信息的節(jié)點(diǎn)稱為信標(biāo)節(jié)點(diǎn)；未知節(jié)點(diǎn)需通過(guò)網(wǎng)絡(luò)的連通性、節(jié)點(diǎn)間的距離等信息進(jìn)行自身定位,獲得自身坐標(biāo)信息。目前已存在多種定位算法,這些算法可依據(jù)不同的標(biāo)準(zhǔn)進(jìn)行分類,如可分為基于測(cè)距的定位算法和基于非測(cè)距的定位算法。在多種定位算法中,本文重點(diǎn)分析了DV-hop定位算法,該算法屬于非測(cè)距算法中的一種典型算法。非測(cè)距算法不直接計(jì)算節(jié)點(diǎn)間的距離,而是依據(jù)節(jié)點(diǎn)間的跳數(shù)、跳距信息估算節(jié)點(diǎn)間的距離,再對(duì)未知節(jié)點(diǎn)進(jìn)行自定位。算法由于無(wú)需直接測(cè)量距離信息,降低了對(duì)節(jié)點(diǎn)硬件的要求,節(jié)約了網(wǎng)絡(luò)成本,但是定位精度不高。本文在對(duì)DV-hop定位算法分析的過(guò)程中,做了大量仿真實(shí)驗(yàn),以平均定位誤差或定位精度作為算法評(píng)價(jià)標(biāo)準(zhǔn),分析仿真結(jié)果,并提出改進(jìn)思路：在跳數(shù)信息不變的情況下,通過(guò)優(yōu)化跳距信息提高算法的定位精度。兩種改進(jìn)算法分別為：DV-hop-NMean定位算法和DV-hop-NHs定位算法。DV-hop-NMean定位算法通過(guò)取一些特定值的均值作為跳距優(yōu)化信息,DV-hop-NHs定位算法則是通過(guò)對(duì)兩個(gè)特定值的加權(quán)作為跳距優(yōu)化�？紤]到實(shí)驗(yàn)的可靠性,在相同仿真環(huán)境條件下,對(duì)原DV-hop定位算法和改進(jìn)定位算法分別作大量實(shí)驗(yàn),將多次實(shí)驗(yàn)定位精度的平均值作比較,證明改進(jìn)算法的可行性。兩種改進(jìn)算法從定位精度看,均優(yōu)于原算法,定位誤差可達(dá)到6.6米,降低了15厘米左右。進(jìn)一步對(duì)估計(jì)的未知節(jié)點(diǎn)坐標(biāo)做優(yōu)化,采用節(jié)點(diǎn)坐標(biāo)計(jì)算方法中的極小極大定位算法思想,分別對(duì)原DV-hop定位算法和兩種改進(jìn)定位算法做優(yōu)化,通過(guò)大量仿真實(shí)驗(yàn),將優(yōu)化前后定位精度值作對(duì)比,發(fā)現(xiàn)在通信半徑為20米不變的情況下,定位精度可以提高近1米,證明了優(yōu)化算法的有效性。相關(guān)研究對(duì)無(wú)線傳感器網(wǎng)絡(luò)的定位技術(shù)及應(yīng)用有借鑒意義。
[Abstract]:Wireless Sensor Networks (WSNs) are composed of a large number of cheap micro sensor nodes, which form multi-hop ad hoc networks through wireless communication.Wireless sensor networks (WSN) have been widely used in many fields. Node localization is one of the key problems in wireless sensor networks (WSN).There are two kinds of nodes in wireless sensor networks: beacon nodes and unknown nodes.The nodes that know their coordinate information are called beacon nodes, and the unknown nodes need to locate themselves through the network connectivity and the distance between nodes to obtain their own coordinate information.At present, there are many localization algorithms, which can be classified according to different criteria, such as location algorithm based on ranging and location algorithm based on non-ranging.Among various localization algorithms, this paper focuses on the analysis of DV-hop localization algorithm, which is a typical non-ranging algorithm.The non-ranging algorithm does not directly calculate the distance between nodes, but estimates the distance between nodes according to the hops between nodes and the information of hops, and then self-locates the unknown nodes.Because the algorithm does not need to measure the distance information directly, it reduces the requirement of node hardware and saves the network cost, but the positioning accuracy is not high.During the analysis of DV-hop localization algorithm, a lot of simulation experiments have been done in this paper. The average positioning error or positioning accuracy is taken as the evaluation standard of the algorithm, and the simulation results are analyzed, and the improved thinking is put forward: under the condition of invariant hops information,The location accuracy of the algorithm is improved by optimizing the hopping information.The two improved algorithms are respectively the DV-hop-NMean location algorithm and the DV-hop-NHs localization algorithm .DV-hop-NMean localization algorithm. The DV-hop-NMean localization algorithm takes the mean value of some specific values as the hopping optimization information and the DV-hop-NHs localization algorithm is optimized by weighting the two specific values as the hopping distance optimization.Considering the reliability of the experiment, a large number of experiments have been done on the original DV-hop localization algorithm and the improved localization algorithm under the same simulation environment. The average value of the multiple experiments' positioning accuracy has been compared, and the feasibility of the improved algorithm has been proved.The two improved algorithms are superior to the original algorithm in terms of positioning accuracy, and the positioning error can reach 6.6 meters, which is about 15 cm lower than that of the original algorithm.Furthermore, the unknown node coordinates are optimized and the original DV-hop location algorithm and two improved localization algorithms are optimized by using the idea of minimax localization algorithm in the node coordinate calculation method, and a large number of simulation experiments are carried out.By comparing the positioning precision values before and after optimization, it is found that the positioning accuracy can be improved by nearly 1 meter when the communication radius is 20 m constant, which proves the effectiveness of the optimization algorithm.The related research has the reference significance to the wireless sensor network localization technology and the application.
【學(xué)位授予單位】：南京大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TN929.5;TP212.9

【參考文獻(xiàn)】

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

1 鐘智;具有移動(dòng)節(jié)點(diǎn)的無(wú)線傳感器網(wǎng)絡(luò)定位算法和數(shù)據(jù)收集協(xié)議研究[D];中南大學(xué);2012年

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

1 牛福軍;無(wú)線傳感器網(wǎng)絡(luò)DV-Hop定位算法研究[D];吉林大學(xué);2011年

，

本文編號(hào)：1762038