基于边框定界的wsn分布式全搜索定位算法boundingboxbased.pdfVIP

第33 卷第Z2 期 通 信 学 报 Vol.33 No. Z2 2012 年11 月 Journal on Communications November 2012 doi:10.3969/j.issn.1000-436x.2012.z2.017 基于边框定界的WSN 分布式全搜索定位算法 姚英彪，曾嵘，易志强 (杭州电子科技大学通信工程学院，浙江 杭州 310018 ） 摘 要：提出一种基于边框定界的WSN 分布式全搜索定位算法。该算法通过节点测距得到邻居节点的坐标和距 离信息，然后通过边框定界方法确定节点存在的位置区域，最后将位置区域网格化，并用全搜索方法在该区域搜 索最佳估计点，最佳估计点的坐标即为节点的定位坐标。该算法应用到网络时需运行多轮，通过逐步求精得到节 点的定位坐标。仿真实验表明该算法达到当前其他复杂定位算法的性能。 关键词：无线传感器网络；边框定界；定位算法；全搜索 TP393 A 1000-436X(2012)Z2-0135-06 中图分类号： 文献标识码： 文章编号： Bounding box based distributed search localization algorithm for WSN YAO Ying-biao, ZENG Rong, YI Zhi-qiang (College of Telecommunication Engineering, Hangzhou Dianzi University, Hangzhou 310018, China) Abstract: A bounding box based distributed full search localization algorithm for WSN (wireless sensor networks) was proposed. Firstly, the coordinates and distances of neighbor nodes were obtained by ranging. Secondly, the possible node position area was determined based on bounding box method. Finally, the area was meshed and the full search method was employed to search the best estimation point, whose coordinates are the node’s localization coordinates. In real WSN, the algorithm need run several rounds to obtain node’s localization coordinates by stepwise refinement. Simulation results show that the proposed algorithm achieves the comparable performance with other up-to-date complex localization algorithms. Key words: wireless sensor networks; bounding box; localization algorithm; full search