多通信半径与角度修正的凸规划改进定位算法

Optimized Convex Localization Algorithm Using Multiple Communication Radius and Angle Correction

凸规划定位算法是无线传感器网络中一种基于非测距的定位算法。针对传统凸规划定位算法中最后重叠区域较大和区域不规则所导致的定位精度不高的问题,提出了结合多通信半径与RSSI来缩小未知节点的所在区域和使用角度修正不规则区域的改进定位算法。改进算法首先在传统凸规划算法的基础上引入了多通信半径进行多次广播,缩小了未知节点的所在区域;然后利用RSSI细化区域;最后对获得的多边形区域进行角度修正处理,从而获得定位结果。实验结果表明,相比于原有算法,改进后的算法能有效地降低定位误差,提升定位精度。

The convex localization algorithm is a range-free positioning algorithm in wireless sensor networks.In order to solve the problem of low positioning accuracy caused by the large overlap area and the irregularity of the region in the traditional convex localization algorithm,an improved localization algorithm was proposed,which uses the combination of multiple communication radius and RSSI to reduce the unknown node area and use the angle to correct the irregular area.The improved algorithm introduces multiple communication radius to broadcast multiple times to refine the area where the unknown node on the basis of the traditional convex algorithm,and then uses the RSSI to reduce the area,and finally obtains the polygon region using the angle correction as the positioning result.The simulation results show that the improved algorithm can effectively reduce the positioning error and improve the positioning accuracy compared with the original algorithm.