首页> 外文会议>Workshop on Positioning, Navigation and Communication >Comparison of message passing algorithms for cooperative localization under NLOS conditions
【24h】

Comparison of message passing algorithms for cooperative localization under NLOS conditions

机译:NLOS条件下合作定位消息传递算法的比较

获取原文

摘要

For large wireless networks, there is a need for accurate localization in a distributed manner. Several algorithms have been developed in order to achieve this goal. However, comparing different algorithms is hard because of the use of different network topologies and measurement models. In this paper two promising message passing algorithms, called SPAWN and SLEEP, are compared in terms of accuracy, complexity, and network traffic. To enable a fair comparison, several alterations are made to SLEEP resulting in ASLEEP with reduced network traffic and the incorporation of reference nodes. Simulations, using measurement models from real ultra-wideband equipment, show that ASLEEP is able to achieve similar estimation quality as SPAWN at much lower complexity and network traffic.
机译:对于大型无线网络,需要以分布式方式精确定位。已经开发了几种算法以实现这一目标。然而,比较不同的算法由于使用不同的网络拓扑和测量模型而艰难。在本文中,在准确性,复杂性和网络流量方面比较了两个被称为产卵和睡眠的有前途的消息传递算法。为了实现公平的比较,睡眠地睡眠地睡眠,导致网络流量减少和参考节点的结合。模拟,使用真实超宽带设备的测量模型,表明睡着是能够实现类似的估计质量,以较低的复杂性和网络流量。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号