首页> 外文会议>2018 IEEE 4th Information Technology and Mechatronics Engineering Conference >A Node Localization Algorithm in WSNs Based on Iterative Estimation
【24h】

A Node Localization Algorithm in WSNs Based on Iterative Estimation

机译:基于迭代估计的无线传感器网络节点定位算法

获取原文
获取原文并翻译 | 示例

摘要

According to the application of range-free measurement for wireless sensor networks (WSNs), a novel localization algorithm of nodes in based on iterative centroid estimation is proposed in the paper. First, we derive the centroid of the plane enclosed by the current connected beacon nodes as well as the received signal strength (RSSI) between target and beacon nodes. Then, we replace the farthest beacon node from the target node with the centroid node we derive in order to narrow the area of the plane enclosed by the connected beacon nodes and improve the location accuracy through multiple iterations. Judging from the simulation results, the proposed algorithm presents decent results of all indications and is thus eligible for localization in WSNs.
机译:针对无线传感器网络(WSNs)无距离测量的应用,提出了一种基于迭代质心估计的节点定位新算法。首先,我们导出当前连接的信标节点所包围的平面的质心,以及目标和信标节点之间的接收信号强度(RSSI)。然后,我们用派生的质心节点替换距目标节点最远的信标节点,以缩小连接的信标节点所包围的平面区域并通过多次迭代提高定位精度。从仿真结果来看,所提出的算法可以显示所有适应症的结果,因此适合在WSN中进行定位。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号