本文選題：無(wú)線傳感器網(wǎng)絡(luò) + 距離無(wú)關(guān)　； 參考：《南京郵電大學(xué)》2017年碩士論文

【摘要】：無(wú)線傳感器網(wǎng)絡(luò)的節(jié)點(diǎn)定位是應(yīng)用領(lǐng)域的重要技術(shù)支撐,是一種新型的數(shù)據(jù)采集技術(shù)。無(wú)線傳感器網(wǎng)絡(luò)是計(jì)算機(jī)、微電子、無(wú)線通信及無(wú)線網(wǎng)絡(luò)等多門學(xué)科的高度融合,應(yīng)用廣泛,例如森林火災(zāi)的定位、農(nóng)業(yè)生態(tài)環(huán)境數(shù)據(jù)收集、山區(qū)昆蟲的生活習(xí)性統(tǒng)計(jì)、工業(yè)控制、醫(yī)療和軍事救助等等,獲得節(jié)點(diǎn)位置是基本的應(yīng)用需求。根據(jù)目前國(guó)內(nèi)外學(xué)者的研究進(jìn)展,結(jié)合無(wú)線傳感器網(wǎng)絡(luò)的特有屬性,有針對(duì)性的對(duì)其中的節(jié)點(diǎn)定位技術(shù)展開討論。定位的原理不同,無(wú)線傳感器網(wǎng)絡(luò)定位算法分類也不同,可分為非測(cè)距(也稱距離無(wú)關(guān))的定位算法和基于測(cè)距(也稱基于距離的)的定位算法兩大類,非測(cè)距的定位算法比基于測(cè)距相關(guān)定位算法更具有應(yīng)用優(yōu)勢(shì)。所以距離無(wú)關(guān)的定位算法是本文研究重點(diǎn),主要內(nèi)容包括:(1)主要介紹幾種典型的距離無(wú)關(guān)的定位算法,并把算法涉及到的數(shù)學(xué)原理進(jìn)行了詳細(xì)介紹,簡(jiǎn)要分析了算法的優(yōu)點(diǎn)和缺點(diǎn),最后介紹相關(guān)算法的創(chuàng)新應(yīng)用。(2)DV-Hop定位算法的定位誤差還有改善空間,在現(xiàn)有研究的基礎(chǔ)上提出了一種平均跳距優(yōu)化的新型定位算法。改進(jìn)算法在節(jié)點(diǎn)間采用多通信半徑方法進(jìn)行通信和廣播,由此細(xì)化節(jié)點(diǎn)間的跳數(shù),計(jì)算未知節(jié)點(diǎn)平均跳距時(shí),首先把孤立節(jié)點(diǎn)剔除,然后對(duì)利用錨節(jié)點(diǎn)平均跳距得到的與未知節(jié)點(diǎn)的距離進(jìn)行加權(quán)歸一化處理,對(duì)未知節(jié)點(diǎn)的平均跳距引用加權(quán)因子,降低定位誤差。仿真結(jié)果顯示該算法有效地降低了DV-Hop算法的定位誤差。(3)對(duì)DV-Hop算法進(jìn)行進(jìn)一步引申,使其應(yīng)用到三維空間。針對(duì)3D-DV-Hop算法中由節(jié)點(diǎn)間跳數(shù)值引起的誤差問(wèn)題,使用雙通信半徑進(jìn)行修正,同二維平面相似,也可以用權(quán)值進(jìn)行距離修正,最后選取相關(guān)數(shù)學(xué)計(jì)算方法求得坐標(biāo),可采用最小二乘法。仿真實(shí)驗(yàn)表明改進(jìn)算法在三維空間也能夠具有較高的定位精度。
[Abstract]:Node location in wireless sensor networks (WSN) is an important technical support in application field, and it is a new data acquisition technology. Wireless sensor network (WSN) is a highly integrated science of computer, microelectronics, wireless communication and wireless network. It is widely used in many fields, such as forest fire location, agricultural ecological environment data collection, living habits statistics of insects in mountainous areas, etc. Industrial control, medical and military assistance and so on, access to node location is the basic application requirements. According to the research progress of domestic and foreign scholars at home and abroad, combined with the unique properties of wireless sensor networks, the node location technology is discussed. The principle of location is different, and the classification of wireless sensor network localization algorithm is also different. It can be divided into two categories: non-ranging (also called range-independent) and range-based (also called distance-based). The non-ranging localization algorithm has more advantages than the ranging-related localization algorithm. So the distance independent localization algorithm is the focus of this paper. The main contents include: 1) introduce several typical distance independent localization algorithms, and introduce the mathematical principle of the algorithm in detail. The advantages and disadvantages of the algorithm are briefly analyzed. Finally, the localization error of the DV-Hop localization algorithm is introduced. Based on the existing research, a new location algorithm for the optimization of average hopping distance is proposed. The improved algorithm uses the method of multi-communication radius to communicate and broadcast between nodes, which refines the number of hops between nodes, calculates the average hopping distance of unknown nodes, and removes the isolated nodes first. Then, the distance between the unknown node and the anchor node is normalized by using the average hopping distance of the anchor node, and the average hop distance of the unknown node is referenced by the weighting factor to reduce the positioning error. Simulation results show that the algorithm can effectively reduce the location error of the DV-Hop algorithm and further extend the DV-Hop algorithm to 3D space. In order to solve the error problem caused by the hopping between nodes in 3D-DV-Hop algorithm, the double communication radius is used to correct the error. Similar to the two-dimensional plane, the weight value can also be used to correct the distance. Finally, the coordinate is obtained by selecting the relevant mathematical calculation method. The least square method can be used. Simulation results show that the improved algorithm can also have high positioning accuracy in three-dimensional space.
【學(xué)位授予單位】：南京郵電大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TP212.9;TN929.5

【參考文獻(xiàn)】

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

1 李琳;趙可;林志貴;王鵬;;基于加權(quán)的三維DV-Hop定位算法[J];控制工程;2015年04期

2 李娟;劉禹;錢志鴻;盧長(zhǎng)剛;;基于雙通信半徑的傳感器網(wǎng)絡(luò)DV-Hop定位算法[J];吉林大學(xué)學(xué)報(bào)(工學(xué)版);2014年02期

3 張愛(ài)清;葉新榮;胡海峰;丁緒星;;基于RSSI每跳分級(jí)和跳距修正的DV-HOP改進(jìn)算法[J];儀器儀表學(xué)報(bào);2012年11期

4 朱敏;劉昊霖;張志宏;易宗銳;;一種基于DV-HOP改進(jìn)的無(wú)線傳感器網(wǎng)絡(luò)定位算法[J];四川大學(xué)學(xué)報(bào)(工程科學(xué)版);2012年01期

5 彭宇;王丹;;無(wú)線傳感器網(wǎng)絡(luò)定位技術(shù)綜述[J];電子測(cè)量與儀器學(xué)報(bào);2011年05期

6 馮秀芳;崔秀鋒;祈會(huì)波;;無(wú)線傳感器網(wǎng)絡(luò)中基于移動(dòng)錨節(jié)點(diǎn)的APIT的改進(jìn)定位算法[J];傳感技術(shù)學(xué)報(bào);2011年02期

7 史洪宇;燕莎;曹建忠;;無(wú)線傳感器網(wǎng)絡(luò)節(jié)點(diǎn)定位的混沌粒子群優(yōu)化算法[J];探測(cè)與控制學(xué)報(bào);2010年05期

8 李娟;王珂;李莉;盧長(zhǎng)剛;;基于錨圓交點(diǎn)加權(quán)質(zhì)心的無(wú)線傳感器網(wǎng)絡(luò)定位算法[J];吉林大學(xué)學(xué)報(bào)(工學(xué)版);2009年06期

9 姜志鵬;高隨祥;;無(wú)線傳感器網(wǎng)絡(luò)節(jié)點(diǎn)定位的同心圓改進(jìn)算法[J];計(jì)算機(jī)科學(xué);2009年10期

10 周勇;夏士雄;丁世飛;張磊;敖欣;;基于三角形重心掃描的改進(jìn)APIT無(wú)線傳感器網(wǎng)絡(luò)自定位算法[J];計(jì)算機(jī)研究與發(fā)展;2009年04期

，

本文編號(hào)：1886199