本文選題：移動無線傳感器網(wǎng)絡 + 中垂線法�。� 參考：《中國礦業(yè)大學》2017年碩士論文

【摘要】：移動節(jié)點定位問題是無線傳感器網(wǎng)絡的研究熱點之一,它利用少量位置已知節(jié)點,按照某種機制對未知節(jié)點進行定位�，F(xiàn)有算法存在僅適用于靜止節(jié)點、測距方法受環(huán)境影響大、定位精度低等問題,隨著無線傳感器網(wǎng)絡技術的進步和完善,越來越多場合需要定位技術的支撐,因此對移動無線傳感器網(wǎng)絡技術的研究有重要理論意義和應用價值。現(xiàn)有移動節(jié)點定位算法充分利用節(jié)點的移動性減小定位復雜度和硬件代價,可是忽略了一些潛在定位信息,濾波條件少,導致定位時間長、定位精度低。為了解決這個問題,本文提出一種基于信號強度差異的移動節(jié)點定位算法(NMCL),充分提取潛在的可能位置信息,利用中垂線法和近似三角形內(nèi)點測法對區(qū)域進行劃分,縮小未知節(jié)點可能存在的位置區(qū)域,從而提高定位精度。此外,針對NMCL算法中始終以未知節(jié)點移動最大速度作為固定的采樣半徑,導致預測階段采樣面積過大,定位精度低的問題,本文還提出一種基于信號強度差異的速度自適應改進算法(INMCL),根據(jù)這一時刻和上一時刻未知節(jié)點接收到的信號強度差異,計算未知節(jié)點單位時間內(nèi)移動的特征距離,再將特征距離轉(zhuǎn)化為物理距離,作為預測時采樣區(qū)域的半徑,從而根據(jù)節(jié)點移動速度實時變化采樣面積,提高定位精度。大量的仿真模擬表明,NMCL算法和INMCL算法較現(xiàn)有移動算法在定位速度較大、錨節(jié)點密度較低、通信不規(guī)則度強等情況下,定位精度有很大的提高。
[Abstract]:Mobile node localization is one of the research hotspots in wireless sensor networks. It uses a small number of known nodes to locate unknown nodes according to some mechanism. The existing algorithms are only applicable to stationary nodes, ranging methods are greatly affected by the environment, low positioning accuracy and other problems. With the progress and improvement of wireless sensor network technology, more and more occasions need the support of location technology. Therefore, the research of mobile wireless sensor network technology has important theoretical significance and application value. The existing mobile node localization algorithms make full use of the mobility of the nodes to reduce the localization complexity and hardware cost, but ignore some potential location information, so the filtering conditions are less, resulting in long localization time and low positioning accuracy. In order to solve this problem, a mobile node location algorithm based on signal intensity difference is proposed in this paper, which can fully extract the potential position information, and divide the region by using the method of mid-vertical line and the method of approximate triangle point measurement. The location of unknown nodes may be reduced to improve the positioning accuracy. In addition, in the NMCL algorithm, the maximum velocity of unknown nodes is always taken as the fixed sampling radius, which leads to the problem that the sampling area is too large and the positioning accuracy is low in the prediction stage. This paper also presents an improved speed adaptive algorithm based on signal strength difference. According to the difference of signal strength between the unknown nodes at this time and the previous moment, the characteristic distance of the unknown node moving in unit time is calculated. Then the feature distance is transformed into physical distance, which is the radius of the sampling area during prediction, and the sampling area is changed in real time according to the moving speed of the node, and the positioning accuracy is improved. A large number of simulations show that the localization accuracy of NMCL algorithm and INMCL algorithm is much higher than that of the existing algorithms under the conditions of higher localization speed, lower anchor node density and stronger communication irregularity.
【學位授予單位】：中國礦業(yè)大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：TP212.9;TN929.5

【參考文獻】

相關期刊論文 前10條

1 趙軍輝;趙聰;;無線傳感網(wǎng)中NLoS環(huán)境下的ToA/AoA改進混合定位算法(英文)[J];中國通信;2011年08期

2 劉云浩;楊錚;王小平;簡麗榮;;Location,Localization,and Localizability[J];Journal of Computer Science & Technology;2010年02期

3 王沁;于鋒;張曉彤;王建國;;一種基于能量衰減特征的無線傳感器網(wǎng)絡定位算法[J];小型微型計算機系統(tǒng);2009年06期

4 魏葉華;李仁發(fā);陳洪龍;;無線傳感器網(wǎng)絡中的一種二階段定位算法[J];小型微型計算機系統(tǒng);2009年02期

5 陳和康;周水庚;;一種Beacon協(xié)助的傳感器網(wǎng)絡定位方法[J];計算機應用與軟件;2009年02期

6 汪煬;黃劉生;肖明軍;徐宏力;;一種基于RSSI校驗的無線傳感器網(wǎng)絡節(jié)點定位算法[J];小型微型計算機系統(tǒng);2009年01期

7 黃學青;房鼎益;;基于鄰居篩選的質(zhì)心迭代定位算法[J];杭州電子科技大學學報;2008年06期

8 汪煬;黃劉生;吳俊敏;徐宏力;;一種基于Monte Carlo的移動傳感網(wǎng)絡精確定位算法[J];小型微型計算機系統(tǒng);2008年09期

9 陳鴻龍;李鴻斌;王智;;基于TDoA測距的傳感器網(wǎng)絡安全定位研究[J];通信學報;2008年08期

10 曹曉梅;何欣;陳貴海;;傳感器節(jié)點定位系統(tǒng)攻防機制研究[J];計算機科學;2008年07期

，

本文編號：2013818