复杂山体表面传感器网络定位算法

Localization Algorithm in Wireless Sensor Networks Over Complex Terrains

存在障碍物的复杂3D凹/凸不平表面网络中锚节点部署难且成本高的问题是一个挑战。针对这个问题,该文提出了一种新的基于网络拓扑分形的三角划分定位算法3DT-ST。该算法仅利用网络连通特性和特殊节点,进行三角划分和建模,在每一个三角区域上采用MDS-MAP方法建立起局部的相对位置地图,再通过整合每个三角子区域,建立起整个传感器网络的全局位置地图。实验结果表明,3DT-ST算法与目前使用的SV方法相比,定位精度提高,定位误差降低明显,且定位过程无需锚节点和迭代,仅通过节点间的连通性进行定位,提高了定位的精度、降低了计算开销的同时节省了部署成本。

In order to solve the problem that it is expensive and difficult to deploy anchor nodes on three-dimension（3D） complex concave/convex surface, a new triangulation localization algorithm （called 3DT-ST） which is based anchor free and applies to complex 3D terrain is presented. 3DT-ST only utilizes network connection and special nodes （SPN） to triangulate and model. It establishes local relative maps in every triangle areas, then combine triangle together to get global map of the network. Experiments show that when comparing with SV, 3DT-ST reduces the localization error clear, and localization is an iteration-free process with only the information of network connection. It improves the localization accuracy, lowers the localization error, and saves the cost of network deploying as well. It provides a new method on energy saving localization research over complex networks.