【摘要】：針對無線傳感器網(wǎng)絡(luò)全節(jié)點定位求精問題展開研究,應(yīng)用自組織映射算法進行定位求精,提出一種優(yōu)化領(lǐng)域函數(shù),實現(xiàn)快速收斂的雙向調(diào)整定位算法.利用傳感器節(jié)點作為神經(jīng)元節(jié)點,通過節(jié)點間距離相關(guān)度建立自組織神經(jīng)元網(wǎng)絡(luò),通過雙向調(diào)整鄰域函數(shù)實現(xiàn)算法對節(jié)點間距與測量距離誤差的正負(fù)性的適應(yīng)能力,達(dá)到收斂性、高定位精度性、快速性要求,最終實現(xiàn)傳感器網(wǎng)絡(luò)的自組織定位.應(yīng)用MATLAB仿真對本文提出的算法與單向調(diào)整算法進行比較,本文提出的算法較大地提高了算法的收斂性和定位精度,較好地反映傳感器節(jié)點的拓?fù)浣Y(jié)構(gòu),且穩(wěn)定性好.
[Abstract]:In order to solve the problem of all-node location refinement in wireless sensor networks (WSN), the self-organizing mapping algorithm is applied to the localization refinement, and an optimized domain function is proposed to realize the fast convergence bidirectional adjustment localization algorithm. The sensor node is used as the neuron node, the self-organizing neural network is established by the distance correlation between the nodes, and the adaptive ability of the algorithm to the positivity of the distance between the nodes and the measurement distance error is realized by bidirectional adjustment of the neighborhood function. To achieve convergence, high positioning accuracy, fast requirements, and finally achieve the sensor network self-organization localization. The proposed algorithm is compared with the unidirectional adjustment algorithm by using MATLAB simulation. The proposed algorithm greatly improves the convergence and positioning accuracy of the algorithm, and reflects the topology structure of the sensor node well, and has good stability.
【作者單位】： 三峽大學(xué)計算機與信息學(xué)院;三峽大學(xué)智能視覺與圖像信息研究所;
【基金】：湖北省自然科學(xué)基金項目(2012FFC09701)資助 水電工程智能視覺監(jiān)測湖北省重點實驗室開放基金項目(2014KLA05)資助
【分類號】：TP212.9;TN929.5

【相似文獻】

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

1 閉樂鵬,鄭志蘊,宋瀚濤,陸玉昌;改進的鄰域支持向量解算法[J];北京理工大學(xué)學(xué)報;2005年11期

2 ;[J];;年期

相關(guān)會議論文 前1條

1 王凌;鄭大鐘;;基于不同鄰域函數(shù)的模擬退火算法性能研究[A];第十九屆中國控制會議論文集（二）[C];2000年

，

本文編號：2423992