首页> 外文期刊>Eurasip Journal on Wireless Communications and Networking >Research of localization algorithm based on weighted Voronoi diagrams for wireless sensor network
【24h】

Research of localization algorithm based on weighted Voronoi diagrams for wireless sensor network

机译:基于加权Voronoi图的无线传感器网络定位算法研究

获取原文
           

摘要

Wireless sensor network (WSN) is formed by a large number of cheap sensors, which are communicated by an ad hoc wireless network to collect information of sensed objects of a certain area. The acquired information is useful only when the locations of sensors and objects are known. Therefore, localization is one of the most important technologies of WSN. In this paper, weighted Voronoi diagram-based localization scheme (W-VBLS) is proposed to extend Voronoi diagram-based localization scheme (VBLS). In this scheme, firstly, a node estimates the distances according to the strength of its received signal strength indicator (RSSI) from neighbor beacons and divides three beacons into groups, whose distances are similar. Secondly, by a triangle, formed by the node and two beacons of a group, a weighted bisector can be calculated out. Thirdly, an estimated position of the node with the biggest RSSI value as weight can be calculated out by three bisectors of the same group. Finally, the position of the node is calculated out by the weighted average of all estimated positions. The simulation shows that compared with centroid and VBLS, W-VBLS has higher positioning accuracy and lower computation complexity.
机译:无线传感器网络(WSN)由大量廉价传感器组成,这些传感器通过自组织无线网络进行通信,以收集特定区域的感测对象的信息。仅当知道传感器和物体的位置时,获取的信息才有用。因此,本地化是WSN最重要的技术之一。本文提出了基于加权Voronoi图的定位方案(W-VBLS),以扩展基于Voronoi图的定位方案(VBLS)。在该方案中,首先,节点根据其从邻居信标接收到的信号强度指示符(RSSI)的强度来估计距离,并将三个信标划分为距离相似的组。其次,通过由节点和一组信标组成的三角形,可以算出加权平分线。第三,可以由同一组的三个等分线计算出RSSI值最大的节点的估计位置。最后,通过所有估计位置的加权平均值计算出节点的位置。仿真表明,与质心和VBLS相比,W-VBLS具有更高的定位精度和更低的计算复杂度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号