本文選題：節(jié)點定位 + 凹凸節(jié)點�。� 參考：《電子科技大學》2014年碩士論文

【摘要】：隨著近年來無線傳感器網(wǎng)絡在軍事及民用的應用越來越廣泛,人們越來越關(guān)注無線傳感器網(wǎng)絡在各方面的研究。其中節(jié)點定位技術(shù)是傳感器網(wǎng)絡應用的關(guān)鍵支撐技術(shù)之一,針對節(jié)點定位技術(shù)的研究面也越來越廣,從二維平面定位到三維表面定位,從固定錨節(jié)點到移動錨節(jié)點的定位研究。其中,三維表面定位最接近無線傳感器網(wǎng)絡的實際應用,然而國內(nèi)外對其的研究相對比較少,并且缺乏考慮到實際的復雜地形如凹凸表面對其定位誤差和節(jié)點定位率的影響。本文在二維定位算法的基礎(chǔ)上提出了三維表面定位的復雜地形對節(jié)點定位的影響,主要有凹凸地形對節(jié)點定位精度和節(jié)點定位率的影響,以及錨節(jié)點的分布不均勻?qū)?jié)點定位和節(jié)點能耗的影響。針對這些問題,本文首先提出了三維表面凹凸分解的分層定位算法,該算法首先將網(wǎng)絡基于高度分層,從而減小在應用場景比較大時減小節(jié)點定位誤差的迭代,然后在每層內(nèi)根據(jù)凹凸節(jié)點劃分子網(wǎng),將凹凸度相近并相鄰的節(jié)點劃分到一個子網(wǎng)內(nèi),在每個子網(wǎng)內(nèi)定位出節(jié)點的坐標,最后合并。該算法在定位誤差和定位率方面都比其余的算法有所改進,不過計算復雜度和能耗方面提高很小。所以本文又提出了基于關(guān)鍵節(jié)點的移動路徑規(guī)劃定位算法,該算法是在三維表面凹凸分解定位算法的基礎(chǔ)上進行了改進,主要包含以下幾方面:(1)該算法將網(wǎng)絡中的節(jié)點映射到一個平面上,通過分辨是否有部分區(qū)域重合來判斷網(wǎng)絡是否需要分割,如果有重合將網(wǎng)絡劃分成多個子網(wǎng),從而提高節(jié)點的定位率。(2)該算法根據(jù)凹凸節(jié)點的定義在子網(wǎng)內(nèi)找出所有凹凸節(jié)點定義為關(guān)鍵節(jié)點,并使用移動錨節(jié)點定位出關(guān)鍵節(jié)點并作為已知節(jié)點,然后利用這些已知節(jié)點定位其余的未知節(jié)點,避免凹凸節(jié)點對定位誤差的影響。(3)算法采用移動錨節(jié)點替換固定錨節(jié)點,可以適應各種復雜的地形,避免了錨節(jié)點密度不夠或者分布不均勻?qū)е碌墓?jié)點不可被定位和定位誤差迭代較大的情況。本文在最后通過實驗證明兩個算法在定位誤差,定位率和節(jié)點能耗方面都有較大的改進,并且后者比前者在各方面都有明顯的提升。
[Abstract]:With the application of wireless sensor networks in military and civilian applications, more and more attention has been paid to the research of wireless sensor networks. The node location technology is one of the key supporting technologies in sensor network application. The research area of node location technology is more and more extensive, from two-dimensional plane positioning to three-dimensional surface positioning, from fixed anchor node to mobile anchor node location research. Among them, 3D surface localization is most close to the practical application of wireless sensor networks, but the research on it is relatively few at home and abroad, and lack of consideration of the actual complex terrain such as concave and convex surface on its positioning error and node localization rate. In this paper, based on the two-dimensional localization algorithm, the influence of the complex terrain of 3D surface location on node location is proposed, including the effect of concave and convex terrain on node location accuracy and node localization rate. And the influence of uneven distribution of anchor nodes on node location and node energy consumption. To solve these problems, this paper first proposes a layered localization algorithm based on three dimensional surface concavity and convex decomposition. Firstly, the network is based on high stratification, which reduces the iteration of node localization error when the application scene is large. Then the subnets are divided into subnets according to the concave and convex nodes in each layer, and the adjacent nodes with similar concave and convex degrees are divided into a subnet, and the coordinates of the nodes are located in each subnet, and finally the nodes are merged. The algorithm improves the localization error and localization rate compared with the other algorithms, but the computational complexity and energy consumption are little improved. Therefore, this paper proposes a mobile path planning and location algorithm based on key nodes, which is improved on the basis of 3D surface concavity and convex decomposition localization algorithm. It mainly includes the following aspects: (1) the algorithm maps the nodes in the network to a plane, and determines whether the network needs to be divided by distinguishing whether there is a partial area overlap. If there is overlap, the network is divided into several subnets. In order to improve the localization rate of nodes. (2) according to the definition of concave and convex nodes, the algorithm finds out that all concave and convex nodes are defined as key nodes in the subnet, and uses mobile anchor nodes to locate the key nodes and take them as known nodes. Then using these known nodes to locate the remaining unknown nodes to avoid the impact of concave and convex nodes on the positioning error. (3) the algorithm uses mobile anchor nodes to replace fixed anchor nodes, which can adapt to various complex terrain. It avoids the problem that the node can not be located and the error iteration is large due to the lack of anchor node density or the uneven distribution. At the end of this paper, it is proved by experiments that the two algorithms have great improvement in location error, localization rate and node energy consumption, and the latter has obvious improvement over the former in all aspects.
【學位授予單位】：電子科技大學
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：TN929.5;TP212.9

【參考文獻】

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

1 李娟;王珂;盧長剛;;Bounding Cube:一種無線傳感器網(wǎng)絡節(jié)點三維定位算法[J];中國海洋大學學報(自然科學版);2009年06期

，

本文編號：2056835