首页> 外文期刊>ACM transactions on sensor networks >Distributed Algorithm for Node Localization in Wireless Ad-Hoc Networks
【24h】

Distributed Algorithm for Node Localization in Wireless Ad-Hoc Networks

机译:无线Ad-Hoc网络中的节点定位分布式算法

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

摘要

We present a distributed algorithm for node localization based on the Gauss-Newton method. In this algorithm, each node updates its own location estimate using the pairwise distance measurements and the local information it receives from the neighboring nodes. Once the location estimate is updated, the sensor node broadcasts the updated estimate to all the neighboring nodes. A distributed and scalable local scheduling algorithm for updating nodes in the network is presented to avoid the use of the global coordinator or a routing loop. We analytically show that the proposed distributed algorithm converges under certain practical assumptions of the network. The performance of the algorithm is evaluated using both simulation and experimental results. Quantitative comparisons among different distributed algorithms are also presented.
机译:我们提出了一种基于高斯-牛顿法的分布式节点定位算法。在这种算法中,每个节点使用成对的距离测量值和从相邻节点接收到的本地信息来更新自己的位置估计。一旦位置估计被更新,则传感器节点将更新的估计广播到所有相邻节点。为了避免使用全局协调器或路由循环,提出了一种用于更新网络中节点的分布式可伸缩本地调度算法。我们分析地表明,所提出的分布式算法在网络的某些实际假设下收敛。使用仿真和实验结果评估算法的性能。还提出了不同分布式算法之间的定量比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号