无线传感器网络节点三维定位的翻转模糊检测

Flip Ambiguity Detection for Three-Dimensional Node Localization in Wireless Sensor Networks

为了解决基于测距的无线传感器网络节点三维定位中可能会发生翻转模糊的问题,本文提出并证明了节点三维定位的翻转模糊检测问题,可以等价为判断是否存在一个平面和所有参考节点的测距误差球都相交的问题(Existence of Intersecting Plane,EIP).为了求解EIP问题,本文进一步提出了公切面法(Common Tangent Plane,CTP)和正交投影法(Orthogonal Projection,OP)两种求解方法.CTP方法采用的是边界检测原理,OP方法则将EIP问题转化为一个角度计算问题,并用坐标变换的方式来求解.经过理论分析和大量的仿真证明,CTP方法虽然具有较好的检测效果,但是计算复杂度太大;而OP方法在几乎获得与CTP方法相同的检测结果的情况下,能够大大降低求解EIP问题的计算复杂度.

To detect flip ambiguity for range-based three-dimensional node localization in wireless sensor networks,we have proposed and proved that flip ambiguity detection for three-dimensional node localization is equal to whether there is a plane intersecting with all range error spheres of the reference nodes,which is called the existence of intersecting plane（ EIP） problem. To solve EIP problem,we further have proposed two solving algorithms： common tangent plane algorithm（ CTP） and orthogonal projection algorithm（ OP）. CTP adopts the principle of boundary detection,while OP transforms EIP problem into an angle calculation problem and adopts a coordinate transformation method to solve the problem. The simulation experiments demonstrate that CTP has good detection results,but its computational complexity is too high; however,OP has almost the same detection results as CTP and has lower computational complexity.