首页> 美国卫生研究院文献>Sensors (Basel Switzerland) >Ranging in an Underwater Medium with Multiple Isogradient Sound Speed Profile Layers
【2h】

Ranging in an Underwater Medium with Multiple Isogradient Sound Speed Profile Layers

机译:在具有多个等梯度声速剖面的水下介质中测距

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

In this paper, we analyze the problem of acoustic ranging between sensor nodes in an underwater environment. The underwater medium is assumed to be composed of multiple isogradient sound speed profile (SSP) layers where in each layer the sound speed is linearly related to the depth. Furthermore, each sensor node is able to measure its depth and can exchange this information with other nodes. Under these assumptions, we first show how the problem of underwater localization can be converted to the traditional range-based terrestrial localization problem when the depth information of the nodes is known a priori. Second, we relate the pair-wise time of flight (ToF) measurements between the nodes to their positions. Next, based on this relation, we propose a novel ranging algorithm for an underwater medium. The proposed ranging algorithm considers reflections from the seabed and sea surface. We will show that even without any reflections, the transmitted signal may travel through more than one path between two given nodes. The proposed algorithm analyzes them and selects the fastest one (first arrival path) based on the measured ToF and the nodes’ depth measurements. Finally, in order to evaluate the performance of the proposed algorithm we run several simulations and compare the results with other existing algorithms.
机译:在本文中,我们分析了水下环境中传感器节点之间的声学​​测距问题。假定水下介质由多个等梯度声速剖面(SSP)层组成,其中在每一层中,声速与深度呈线性关系。此外,每个传感器节点都能够测量其深度,并可以与其他节点交换此信息。在这些假设下,我们首先展示了在先验已知节点深度信息的情况下,如何将水下定位问题转换为传统的基于距离的地面定位问题。其次,我们将节点之间的成对飞行时间(ToF)测量与它们的位置相关联。接下来,基于这种关系,我们提出了一种新颖的水下介质测距算法。提出的测距算法考虑了来自海床和海面的反射。我们将显示,即使没有任何反射,所传输的信号也可能会通过两个给定节点之间的多条路径传播。所提出的算法将对它们进行分析,并根据测得的ToF和节点的深度测量结果选择最快的一条(第一到达路径)。最后,为了评估所提出算法的性能,我们进行了几次仿真,并将结果与​​其他现有算法进行了比较。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号