基于凸規(guī)劃的無線傳感器網絡定位算法研究
發(fā)布時間：2019-03-29 21:05
【摘要】：無線傳感器網絡(Wireless Sensor Networks,WSN)是一種集數(shù)據收集、融合、處理、傳輸?shù)裙δ苡谝惑w的網絡系統(tǒng)。作為物聯(lián)網的基礎和重要組成部分,他觸及到了軟硬件技術、計算機網絡及通信技術等多門學科領域。在軍事、醫(yī)療、環(huán)境監(jiān)測、森林火災、空間探測等無線傳感器的網絡應用中,不僅需要采集數(shù)據,往往還需要精確確定數(shù)據的位置信息。因此,節(jié)點定位技術在無線傳感器中占據著十分重要、不可或缺的地位。在實際的環(huán)境中,常常會遇到不規(guī)則的網絡拓撲、復雜的傳播環(huán)境、不均勻的節(jié)點部署等問題,這對定位算法的性能提出了更高的要求。本文對已有定位算法進行了研究分析,甄別已有算法的不足,對研究的凸規(guī)劃定位算法做了詳細的分析,并提出了改進算法。本文的主要工作如下:(1)分析了目前國內外凸規(guī)劃定位算法的研究現(xiàn)狀,指出了凸規(guī)劃定位算法中研究的不足。針對經典的RSSI-Convex算法,分析了該算法的基本原理、算法過程、以及存在的問題。(2)在對RSSI-Convex算法的分析中發(fā)現(xiàn)其對RSSI的條件利用不夠充分,經過論證后,提出了基于RSSI所成圓的改進算法。該算法對原始算法的改進如下:針對未知節(jié)點通信半徑內僅有一個信標節(jié)點的情況,不在一味地用信標節(jié)點坐標代替未知節(jié)點坐標。改進算法利用了物理中轉變參考系的思想,達到了縮減未知節(jié)點未知區(qū)域的目的;針對未知節(jié)點通信半徑內有一個以上信標節(jié)點的情況,利用RSSI所成的圓來進一步縮小由RSSI-Convex所確定的未知節(jié)點的未知區(qū)域,達到了提高定位精度的目的。實驗結果表明,在對RSSI充分利用的條件下就可以提高節(jié)點的定位精度。(3)在RSSI-Convex凸規(guī)劃的算法基礎上,結合查閱的大量文獻,提出了改進算法。算法通過引入變角的概念,對RSSI-Convex算法進行了大膽的改進:用扇形取代圓,用變角來進一步縮小未知節(jié)點的未知區(qū)域,達到提高定位精度的目的;通過概率均分的思想將未知節(jié)點合理的限定在角平分線上,使得未知節(jié)點的求解過程進一步簡化。實驗結果表明,改進算法比原算法具有更高的定位精度,并可以較好的改善所存在的問題。對比兩個改進算法可以看出,基于動態(tài)角度劃分的改進算法,其算法曲線較為平緩,可以滿足信標節(jié)點密度低而對精度要求高的領域,如軍事、醫(yī)療等。而基于接收信號強度的改進算法可以在不增加成本的前提下,提供更高的節(jié)點精度,使得在環(huán)境監(jiān)測、森林火災等領域得到的信息來源的準確性更高。
[Abstract]:Wireless sensor network (Wireless Sensor Networks,WSN) is a data collection, fusion, processing, transmission and other functions in one network system. As the foundation and important part of the Internet of things, he touched on many subject fields such as hardware and software technology, computer network and communication technology. In the application of wireless sensors, such as military, medical, environmental monitoring, forest fire, space detection and other wireless sensor applications, it is necessary not only to collect data, but also to accurately determine the location information of the data. Therefore, node positioning technology plays a very important and indispensable role in wireless sensors. In the actual environment, irregular network topology, complex propagation environment, uneven node deployment and other problems are often encountered, which put forward higher requirements for the performance of the localization algorithm. In this paper, the existing localization algorithms are studied and analyzed, the shortcomings of the existing algorithms are identified, and the convex programming localization algorithm is analyzed in detail, and an improved algorithm is proposed. The main work of this paper is as follows: (1) the present research status of convex programming localization algorithm at home and abroad is analyzed, and the deficiency of the research on convex programming localization algorithm is pointed out. In view of the classical RSSI-Convex algorithm, the basic principle, algorithm process and existing problems of the algorithm are analyzed. (2) in the analysis of the RSSI-Convex algorithm, it is found that the condition of RSSI is not sufficiently utilized. An improved algorithm for circle formation based on RSSI is proposed. The improvement of the original algorithm is as follows: for the case that there is only one beacon node in the communication radius of the unknown node, the beacon node coordinates are not always used to replace the unknown node coordinates. The improved algorithm makes use of the idea of changing reference system in physics and achieves the purpose of reducing the unknown region of unknown nodes. Aiming at the case that there is more than one beacon node in the communication radius of the unknown node, the unknown area of the unknown node determined by the RSSI-Convex is further reduced by using the circle formed by the RSSI, and the accuracy of the location is improved. The experimental results show that the localization accuracy of nodes can be improved by fully utilizing RSSI. (3) based on the algorithm of RSSI-Convex convex programming, an improved algorithm is proposed based on a large number of references. By introducing the concept of variable angle, the RSSI-Convex algorithm is improved boldly: the sector is used to replace the circle, and the variable angle is used to further reduce the unknown region of the unknown node so as to improve the positioning accuracy; The unknown node is reasonably limited to the angular bisection line by the idea of equal probability, which further simplifies the solving process of the unknown node. The experimental results show that the improved algorithm has higher positioning accuracy than the original algorithm and can improve the existing problems. Compared with the two improved algorithms, it can be seen that the improved algorithm based on dynamic angle partition has a smooth curve, which can meet the requirements of low density of beacon nodes and high precision, such as military and medical treatment. The improved algorithm based on the received signal strength can provide higher node accuracy without increasing the cost, which makes the accuracy of information sources in environmental monitoring, forest fire and other fields more accurate.
【學位授予單位】：廣西師范大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：TP212.9;TN929.5
本文編號：2449884
[Abstract]:Wireless sensor network (Wireless Sensor Networks,WSN) is a data collection, fusion, processing, transmission and other functions in one network system. As the foundation and important part of the Internet of things, he touched on many subject fields such as hardware and software technology, computer network and communication technology. In the application of wireless sensors, such as military, medical, environmental monitoring, forest fire, space detection and other wireless sensor applications, it is necessary not only to collect data, but also to accurately determine the location information of the data. Therefore, node positioning technology plays a very important and indispensable role in wireless sensors. In the actual environment, irregular network topology, complex propagation environment, uneven node deployment and other problems are often encountered, which put forward higher requirements for the performance of the localization algorithm. In this paper, the existing localization algorithms are studied and analyzed, the shortcomings of the existing algorithms are identified, and the convex programming localization algorithm is analyzed in detail, and an improved algorithm is proposed. The main work of this paper is as follows: (1) the present research status of convex programming localization algorithm at home and abroad is analyzed, and the deficiency of the research on convex programming localization algorithm is pointed out. In view of the classical RSSI-Convex algorithm, the basic principle, algorithm process and existing problems of the algorithm are analyzed. (2) in the analysis of the RSSI-Convex algorithm, it is found that the condition of RSSI is not sufficiently utilized. An improved algorithm for circle formation based on RSSI is proposed. The improvement of the original algorithm is as follows: for the case that there is only one beacon node in the communication radius of the unknown node, the beacon node coordinates are not always used to replace the unknown node coordinates. The improved algorithm makes use of the idea of changing reference system in physics and achieves the purpose of reducing the unknown region of unknown nodes. Aiming at the case that there is more than one beacon node in the communication radius of the unknown node, the unknown area of the unknown node determined by the RSSI-Convex is further reduced by using the circle formed by the RSSI, and the accuracy of the location is improved. The experimental results show that the localization accuracy of nodes can be improved by fully utilizing RSSI. (3) based on the algorithm of RSSI-Convex convex programming, an improved algorithm is proposed based on a large number of references. By introducing the concept of variable angle, the RSSI-Convex algorithm is improved boldly: the sector is used to replace the circle, and the variable angle is used to further reduce the unknown region of the unknown node so as to improve the positioning accuracy; The unknown node is reasonably limited to the angular bisection line by the idea of equal probability, which further simplifies the solving process of the unknown node. The experimental results show that the improved algorithm has higher positioning accuracy than the original algorithm and can improve the existing problems. Compared with the two improved algorithms, it can be seen that the improved algorithm based on dynamic angle partition has a smooth curve, which can meet the requirements of low density of beacon nodes and high precision, such as military and medical treatment. The improved algorithm based on the received signal strength can provide higher node accuracy without increasing the cost, which makes the accuracy of information sources in environmental monitoring, forest fire and other fields more accurate.
【學位授予單位】：廣西師范大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：TP212.9;TN929.5
【相似文獻】
相關期刊論文 前7條
1 翟傳翠;;帶約束凸規(guī)劃的算法及收斂性分析[J];無線互聯(lián)科技;2014年01期
2 吳福祥;二次凸規(guī)劃的迭代解[J];北京化工學院學報(自然科學版);1993年02期
3 向滿天;羅嗣力;戴美思;;無線傳感器網絡中一種改進的凸規(guī)劃定位算法[J];傳感技術學報;2014年08期
4 徐義紅,劉三陽;非光滑準不變凸規(guī)劃的最優(yōu)性條件與對偶定理[J];西安電子科技大學學報;2002年05期
5 陳文華;凸規(guī)劃與離散系統(tǒng)H_∞輸出控制[J];控制理論與應用;1996年05期
6 汪定偉;線性規(guī)劃的無約束凸規(guī)劃算法的計算實現(xiàn)[J];數(shù)值計算與計算機應用;1995年04期
7 盧新明,趙茂先;對于凸規(guī)劃橢球方法的一個修正及其在線性規(guī)劃中的應用[J];數(shù)值計算與計算機應用;1993年04期
相關會議論文 前2條
1 陳修素;;關于E-凸規(guī)劃的一些注記[A];2001年全國數(shù)學規(guī)劃及運籌研討會論文集[C];2001年
2 胡清潔;梁遠信;簡金寶;;一類新的廣義凸函數(shù)及相應凸規(guī)劃的最優(yōu)性條件與對偶[A];中國運籌學會第七屆學術交流會論文集（上卷）[C];2004年
相關碩士學位論文 前2條
1 任騰飛;基于凸規(guī)劃的無線傳感器網絡定位算法研究[D];廣西師范大學;2017年
2 鄒臘英;幾類非線性凸規(guī)劃的性質及算法研究[D];江西師范大學;2008年
，本文編號：2449884
本文鏈接：http://www.wukwdryxk.cn/kejilunwen/xinxigongchenglunwen/2449884.html
