無線傳感器網(wǎng)絡定位系統(tǒng)中的基站布設算法
本文選題:基站布設 切入點:無線傳感器網(wǎng)絡定位系統(tǒng) 出處:《南京郵電大學》2017年碩士論文 論文類型:學位論文
【摘要】:基于無線傳感器網(wǎng)絡(Wireless Sesnor Network WSN)的定位系統(tǒng)的定位精度是制約其應用的一個瓶頸性難題,至今未見突破性進展。研究表明,定位系統(tǒng)的定位性能主要取決于正確的測量參數(shù)估計,定位算法選擇,目標節(jié)點和基站之間的幾何關系。對于給定的WSNs,定位性能僅僅跟定位方法選擇和基站布設有關。因此,可以通過研究新的基站布設算法來進一步改進無線傳感器網(wǎng)絡的定位性能。本文對WSN定位系統(tǒng)中基站布設方法進行研究,主要貢獻如下:(1)提出了單軌跡下最佳基站布設算法。以軌跡的平均幾何精度因子(Geometric Dilution Of Precision GDOP)最小作為最優(yōu)布設準則,將基站節(jié)點布設問題轉化為最優(yōu)化問題,并利用下降迭代算法去求解建立的最優(yōu)化模型,最大限度地保證優(yōu)化過程的正確性和有效性。(2)提出了多軌跡下基于線性加權和的基站布設算法。為了考慮多軌跡的平均GDOP最優(yōu),采用判斷矩陣法去求各個軌跡的權重系數(shù),然后,多目標問題的求解可以利用評價函數(shù)法中的線性加權和法去求解,此時的問題就轉化成了單目標問題進行求解,由仿真結果可知,該算法適用于多軌跡有不同定位精度要求的場景。(3)提出了多軌跡下基于極大極小法的基站布設算法。多目標最優(yōu)化問題可以利用評價函數(shù)中的極大極小法去求解。由仿真結果可知,該算法同樣適用于多軌跡的情況。
[Abstract]:The positioning accuracy of wireless Sesnor Network WSN-based positioning system based on wireless sensor network is a bottleneck problem that restricts its application, but no breakthrough progress has been found. The research shows that the positioning performance of the positioning system mainly depends on the correct estimation of measurement parameters. Location algorithm selection, geometric relationship between target node and base station. For a given WSNs, location performance is only related to location method selection and base station placement. The location performance of wireless sensor networks can be further improved by studying new base station placement algorithms. In this paper, the method of base station placement in WSN positioning system is studied. The main contributions are as follows: (1) the algorithm of optimal base station placement under single locus is proposed. With the minimum of geometric Dilution of the locus as the optimal placement criterion, the node placement problem of the base station is transformed into an optimization problem. Using descent iterative algorithm to solve the established optimization model, the correctness and validity of the optimization process are guaranteed to the maximum extent. A base station placement algorithm based on linear weighted sum under multi-locus is proposed. In order to consider the average GDOP optimization of multi-locus, the algorithm is proposed. The judgment matrix method is used to calculate the weight coefficients of each locus. Then, the multi-objective problem can be solved by the linear weighted sum method in the evaluation function method, and then the problem is transformed into a single-objective problem to be solved. According to the simulation results, This algorithm is suitable for multi-locus scene with different positioning accuracy.) the algorithm of base station placement based on minimax method under multi-locus is proposed. The multi-objective optimization problem can be solved by using the minimax method in evaluation function. From the simulation results, The algorithm is also applicable to the case of multiple trajectories.
【學位授予單位】:南京郵電大學
【學位級別】:碩士
【學位授予年份】:2017
【分類號】:TP212.9;TN929.5
【參考文獻】
相關期刊論文 前10條
1 王沁;于鋒;張曉彤;王建國;;一種基于能量衰減特征的無線傳感器網(wǎng)絡定位算法[J];小型微型計算機系統(tǒng);2009年06期
2 陳和康;周水庚;;一種Beacon協(xié)助的傳感器網(wǎng)絡定位方法[J];計算機應用與軟件;2009年02期
3 汪煬;黃劉生;肖明軍;徐宏力;;一種基于RSSI校驗的無線傳感器網(wǎng)絡節(jié)點定位算法[J];小型微型計算機系統(tǒng);2009年01期
4 黃學青;房鼎益;;基于鄰居篩選的質心迭代定位算法[J];杭州電子科技大學學報;2008年06期
5 汪煬;黃劉生;吳俊敏;徐宏力;;一種基于Monte Carlo的移動傳感網(wǎng)絡精確定位算法[J];小型微型計算機系統(tǒng);2008年09期
6 陳鴻龍;李鴻斌;王智;;基于TDoA測距的傳感器網(wǎng)絡安全定位研究[J];通信學報;2008年08期
7 曹曉梅;何欣;陳貴海;;傳感器節(jié)點定位系統(tǒng)攻防機制研究[J];計算機科學;2008年07期
8 劉新華;李方敏;鄭鵬;;一種分布式的無線傳感器網(wǎng)絡Range-free節(jié)點定位算法[J];傳感技術學報;2008年01期
9 季檢;石勝飛;李建中;;一種適用于無線傳感器網(wǎng)絡的健壯的有序定位算法[J];計算機研究與發(fā)展;2008年01期
10 張文哲;李明祿;伍民友;;一種基于局部Voronoi圖的目標穿越算法[J];軟件學報;2007年05期
,本文編號:1606804
本文鏈接:http://sikaile.net/kejilunwen/xinxigongchenglunwen/1606804.html