本文選題：無線傳感器網(wǎng)絡(luò) + 節(jié)點(diǎn)定位�。� 參考：《哈爾濱工程大學(xué)》2014年碩士論文

【摘要】：當(dāng)今信息技術(shù)發(fā)展迅速,為無線傳感器網(wǎng)絡(luò)(WSN,wireless sensor network)的發(fā)展創(chuàng)造了良好的環(huán)境。傳感器網(wǎng)絡(luò)有著廣泛的應(yīng)用,并存在大量的研究,WSN已慢慢融入到人類生活的各個方面,在其眾多的研究中,節(jié)點(diǎn)定位是基礎(chǔ)。在用靜態(tài)錨節(jié)點(diǎn)定位時需要的錨節(jié)點(diǎn)密度較大,而錨節(jié)點(diǎn)的成本較一般傳感器節(jié)點(diǎn)高,在其完成節(jié)點(diǎn)定位后,通常處于閑置狀態(tài),不能被充分利用,因此,現(xiàn)在國內(nèi)外很多學(xué)者開始研究基于移動錨節(jié)點(diǎn)的WSN定位算法。錨節(jié)點(diǎn)的移動方式有兩種:基于靜態(tài)路徑的移動和基于動態(tài)路徑的移動。在學(xué)習(xí)、研究和總結(jié)已有的定位算法的基礎(chǔ)上,基于現(xiàn)有算法的缺點(diǎn)和不足,提出兩種新的基于移動錨節(jié)點(diǎn)WSN定位算法:基于正六邊形的遞增式的定位算法(Incremental Localization Algorithm based on hexagon,ILAH)和基于分簇的移動錨節(jié)點(diǎn)定位算法(Mobile anchor node Localization Algorithm based on Clustering,CMLA), 這兩個算法主要用來解決現(xiàn)有基于靜態(tài)路徑和基于動態(tài)路徑的定位算法中存在的共線問題,并克服現(xiàn)有算法通過引入輔助設(shè)備來解決共線問題的缺點(diǎn),二者定位時需要的基本技術(shù)相同,但是二者的適用范圍有所不同。本文主要研究工作有:首先對現(xiàn)有的WSN節(jié)點(diǎn)定位技術(shù)學(xué)習(xí)、研究和分析;對節(jié)點(diǎn)定位方法進(jìn)行詳細(xì)的介紹,并對其進(jìn)行分類、分析和對比,總結(jié)各種方法的適用范圍和不足。然后介紹了與基于移動錨節(jié)點(diǎn)定位相關(guān)的技術(shù),總結(jié)現(xiàn)有的基于移動錨節(jié)點(diǎn)的路徑規(guī)劃方法,為后續(xù)的研究奠定了理論基礎(chǔ)。最后重點(diǎn)研究了 ILAH算法和CMLA算法,本文的算法的實現(xiàn)都是通過matlab仿真實現(xiàn)的,ILAH定位算法是錨節(jié)點(diǎn)基于靜態(tài)路徑的規(guī)劃方法,錨節(jié)點(diǎn)沿著規(guī)劃好的路徑移動,通過仿真實驗可知該方法的定位精度及區(qū)域覆蓋率都比較高,該方法解決了傳統(tǒng)方法引入的錨節(jié)點(diǎn)共線問題,該方法的移動路徑較傳統(tǒng)的移動模型小;CMLA定位算法是基于錨節(jié)點(diǎn)動態(tài)路徑規(guī)劃的定位算法,可以根據(jù)網(wǎng)絡(luò)的實時需求改變錨節(jié)點(diǎn)的移動路徑,所以其實用性強(qiáng),通過仿真實驗可知該方法的定位誤差較小,定位覆蓋率高,且有效的解決了錨節(jié)點(diǎn)共線問題。
[Abstract]:Nowadays, the rapid development of information technology has created a good environment for the development of wireless sensor network. Sensor networks (WSN) have been widely used, and a large number of research has been gradually integrated into all aspects of human life. In many of its research, node location is the basis. The density of anchor nodes is higher when static anchor nodes are located, and the cost of anchor nodes is higher than that of normal sensor nodes. After the node positioning is completed, it is usually idle and can not be fully utilized. Now many scholars at home and abroad have begun to study the WSN localization algorithm based on mobile anchor nodes. There are two ways of moving anchor nodes: static path based movement and dynamic path based movement. On the basis of learning, researching and summarizing the existing localization algorithms, based on the shortcomings and shortcomings of the existing algorithms, Two new WSN localization algorithms based on mobile anchor nodes are proposed: incremental Localization Algorithm based on hexagonizing ILAH based on hexagonal algorithm and mobile anchor node Localization Algorithm based on clustering algorithm based on clustering. To solve the collinear problem existing in the existing static path and dynamic path based localization algorithms, It also overcomes the shortcomings of the existing algorithms to solve the collinear problem by introducing auxiliary equipment. The basic technology required by them is the same, but their scope of application is different. The main research work of this paper is as follows: firstly, the existing WSN node location technology is studied, studied and analyzed; the node location methods are introduced in detail, classified, analyzed and compared, and the applicable scope and shortcomings of various methods are summarized. Then the technologies related to the location of mobile anchor nodes are introduced, and the existing path planning methods based on mobile anchor nodes are summarized, which lays a theoretical foundation for further research. In the end, ILAH algorithm and CMLA algorithm are studied. In this paper, the implementation of the algorithm is realized by matlab simulation. The algorithm is based on the static path planning method of anchor node, and the anchor node moves along the planned path. The simulation results show that the location accuracy and area coverage of this method are high. The method solves the collinear problem of anchor nodes introduced by traditional methods. The moving path of this method is smaller than that of the traditional mobile model. It is based on the dynamic path planning of anchor node. It can change the moving path of anchor node according to the real time demand of network, so its practicability is strong. The simulation results show that the location error of this method is small, the location coverage is high, and the collinear problem of anchor node is solved effectively.
【學(xué)位授予單位】：哈爾濱工程大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TP212.9;TN929.5

【參考文獻(xiàn)】

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

1 朱劍;趙海;徐久強(qiáng);李大舟;;無線傳感器網(wǎng)絡(luò)中的定位模型[J];軟件學(xué)報;2011年07期

2 沙超;王汝傳;孫力娟;黃海平;;無線傳感器網(wǎng)絡(luò)中一種信標(biāo)節(jié)點(diǎn)可遷移的協(xié)作定位方法[J];電子學(xué)報;2010年11期

3 劉輝亞;徐建波;;無線傳感器網(wǎng)絡(luò)節(jié)點(diǎn)定位的移動信標(biāo)節(jié)點(diǎn)路徑規(guī)劃[J];傳感技術(shù)學(xué)報;2010年06期

4 盧翔;涂時亮;陳章龍;;對無線傳感器網(wǎng)絡(luò)定位算法的比較和分析[J];計算機(jī)應(yīng)用與軟件;2009年12期

5 姚忠孝;俞立;董齊芬;;基于移動信標(biāo)的DV-Hop無線傳感網(wǎng)絡(luò)定位算法[J];傳感技術(shù)學(xué)報;2009年10期

6 李洪峻;卜彥龍;薛晗;李迅;馬宏緒;;面向無線傳感器網(wǎng)絡(luò)節(jié)點(diǎn)定位的移動錨節(jié)點(diǎn)路徑規(guī)劃[J];計算機(jī)研究與發(fā)展;2009年01期

7 季檢;石勝飛;李建中;;一種適用于無線傳感器網(wǎng)絡(luò)的健壯的有序定位算法[J];計算機(jī)研究與發(fā)展;2008年01期

8 余義斌;曹長修;李昌兵;;基于權(quán)重重心法的傳感器網(wǎng)絡(luò)節(jié)點(diǎn)定位[J];計算機(jī)仿真;2007年06期

9 張潔穎;孫懋珩;王俠;;基于RSSI和LQI的動態(tài)距離估計算法[J];電子測量技術(shù);2007年02期

10 宋杰;程家興;許中衛(wèi);周瑛;;一種改進(jìn)的貪婪式覆蓋算法[J];計算機(jī)技術(shù)與發(fā)展;2006年08期

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

1 任麗婕;無線傳感器網(wǎng)絡(luò)中節(jié)點(diǎn)部署優(yōu)化算法研究[D];中國海洋大學(xué);2009年

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

1 何小敏;基于移動錨節(jié)點(diǎn)的無線傳感器網(wǎng)絡(luò)定位算法研究[D];重慶大學(xué);2012年

2 陳子琦;基于移動錨節(jié)點(diǎn)的WSN節(jié)點(diǎn)定位研究[D];長沙理工大學(xué);2012年

3 施進(jìn);基于三邊測量法的無線傳感器網(wǎng)絡(luò)定位技術(shù)的研究[D];哈爾濱工程大學(xué);2012年

4 陳紅陽;基于測距技術(shù)的無線傳感器網(wǎng)絡(luò)定位技術(shù)研究[D];西南交通大學(xué);2006年

，

本文編號：1780325