本文選題：網(wǎng)絡(luò) + 節(jié)點定位��； 參考：《計算機仿真》2015年11期

【摘要】：在對網(wǎng)絡(luò)節(jié)點進行定位時,節(jié)點分布分散,產(chǎn)生的節(jié)點定位存在隨機性,采用傳統(tǒng)的方法時由于節(jié)點與質(zhì)心之間存在關(guān)聯(lián)性低,需要逐個遍歷網(wǎng)絡(luò)節(jié)點進行定位,導(dǎo)致定位時間長,精確度低,實用性弱。提出了一種改進RSSI算法的網(wǎng)絡(luò)節(jié)點快速定位方法。通過采樣的方式對網(wǎng)絡(luò)待定位節(jié)點的初始位置進行估計,利用RSSI算法將網(wǎng)絡(luò)固定節(jié)點間的距離和RSSI值作為依據(jù)計算網(wǎng)絡(luò)中所有待定位節(jié)點與固定節(jié)點之間的權(quán)值,定義網(wǎng)絡(luò)固定信標(biāo)節(jié)點與質(zhì)心位置的關(guān)系,在此基礎(chǔ)上對網(wǎng)絡(luò)固定節(jié)點的權(quán)值進行修正,進而精確地完成了對網(wǎng)絡(luò)節(jié)點快速定位算法的優(yōu)化。仿真結(jié)果證明,改進RSSI算法的網(wǎng)絡(luò)節(jié)點快速定位方法定位精確度高,適用性強。
[Abstract]:In the localization of network nodes, the nodes are scattered and the resulting nodes are random. Because of the low correlation between the nodes and the centroid, it is necessary to traverse the network nodes one by one. It leads to long positioning time, low accuracy and weak practicability. A fast location method for network nodes based on improved RSSI algorithm is proposed. The initial position of the nodes to be located in the network is estimated by sampling, and the distance between the fixed nodes and the RSSI value of the network are calculated by using RSSI algorithm as the weights between all the nodes to be located and the fixed nodes in the network. On the basis of defining the relationship between the fixed beacon nodes and the position of the center of mass, the weights of the fixed nodes in the network are modified, and the optimization of the fast location algorithm for the network nodes is accomplished accurately. The simulation results show that the fast localization method based on improved RSSI algorithm has high accuracy and good applicability.
【作者單位】： 重慶師范大學(xué)涉外商貿(mào)學(xué)院;
【分類號】：TN929.5;TP212.9

【參考文獻】

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

1 張廣峰;段其昌;劉政;;基于加強學(xué)習(xí)與聯(lián)想記憶粒子群優(yōu)化算法的節(jié)點定位[J];傳感器與微系統(tǒng);2013年03期

2 周亮;肖婷婷;李廣軍;;基于信賴域的無線傳感器網(wǎng)絡(luò)節(jié)點定位算法[J];電子科技大學(xué)學(xué)報;2014年05期

3 張亞麗;敖s，

本文編號：1855180