电子学报 ›› 2015, Vol. 43 ›› Issue (6): 1218-1223.DOI: 10.3969/j.issn.0372-2112.2015.06.027

• 科研通信 • 上一篇    下一篇

一种判断无线网络节点定位翻转模糊的新方法

刘伟, 董恩清, 张德敬, 宋洋, 钱鹏, 郑清彬   

  1. 山东大学(威海)机电与信息工程学院, 山东威海 264209
  • 收稿日期:2013-11-13 修回日期:2014-04-17 出版日期:2015-06-25
    • 通讯作者:
    • 董恩清
    • 作者简介:
    • 刘 伟 男,1979年出生于山东兖州.2009年于昆明理工大学获得硕士学位,2010年起于山东大学攻读博士学位,主要研究方向为无线传感器网络节点定位技术. E-mail:lwsdjnyz@163.com
    • 基金资助:
    • 国家自然科学基金 (No.81371635); 高等学校博士学科点专项科研基金 (No.20120131110062); 山东省科技发展计划项目 (No.2013GGX10104)

A New Flip Ambiguity Detection Algorithm in Wireless Networks Node Localization

LIU Wei, DONG En-qing, ZHANG De-jing, SONG Yang, QIAN Peng, ZHENG Qing-bin   

  1. School of Mechanical, Electrical & Information Engineering, Shandong University, Weihai, Shandong 264209, China
  • Received:2013-11-13 Revised:2014-04-17 Online:2015-06-25 Published:2015-06-25

摘要:

为了解决基于测距的无线网络节点定位中可能会发生翻转模糊的问题.已经有研究者证明了将节点翻转模糊问题等价为判断是否存在一条直线和所有参考节点的测距误差圆都相交的问题(Existence of Intersecting Line,EIL).在测距误差圆半径相等的情况下,EIL问题可采用凸包方法,其计算复杂度较低;而在测距误差圆半径不等的情况下,采用公切线翻转模糊检测法的计算复杂度较高.为了解决EIL问题中测距误差圆半径不等时计算复杂度较高的缺陷,本文采用正交投影方法证明了EIL问题的实质是判断是否存在一条直线,使任意两个测距误差圆在这条直线的正交投影线段有重叠,这条直线与EIL问题中的直线相垂直.根据该证明,文中提出了一种基于正交投影的节点翻转模糊检测方法.该方法通过简单的坐标变换就能代替EIL问题中求解公切线的复杂计算过程.仿真结果表明,本文提出的基于正交投影的翻转模糊检测方法和Wang提出的公切线翻转模糊检测方法相比,大大降低了计算复杂度,但检测结果和平均定位误差是等价的.

关键词: 无线网络, 节点定位, 翻转模糊, 正交投影

Abstract:

To detect flip ambiguity in range-based wireless network node localization, some researchers proposed that the flip ambiguity detection is equal to determine whether there is a straight line intersecting with all range error circles of the reference nodes.It is called the existence of intersecting line (EIL) problem.To solve the EIL problem under equal radii, a convex hull algorithm with low computational complexity was proposed.However, for unequal radii, a common tangent algorithm (CTA) has high computational complexity.In order to address the high computational complexity of CTA, we prove that the EIL problem is equal to determine whether there is a straight line, which enables any two circles to have overlapping orthogonal projection onto the line.According to this proof, we propose an orthogonal projection algorithm (OPA) to detect nodes flip ambiguities with unequal radii.The algorithm uses the coordinate transformation to simplify the computation process.The simulation results demonstrate that OPA and CTA have exactly the same detection results, but the computational complexity is greatly reduced.

Key words: wireless networks, node localization, flip ambiguity, orthogonal projection

中图分类号: