首页> 外文期刊>Ad hoc networks >A modified Manhattan distance with application for localization algorithms in ad-hoc WSNs
【24h】

A modified Manhattan distance with application for localization algorithms in ad-hoc WSNs

机译:修改后的曼哈顿距离及其在特殊WSN中的定位算法应用

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

摘要

Building an efficient node localization system in wireless sensor networks is facing several challenges. For example, calculating the square root consumes computational resources and utilizing flooding techniques to broadcast nodes location wastes bandwidth and energy. Reducing computational complexity and communication overhead is essential in order to reduce power consumption, extend the life time of the battery operated nodes, and improve the performance of the limited computational resources of these sensor nodes. To that end, we propose a novel modified Manhattan distance norm and employ it in a previous localization system so-called TALS (Trigonometric Ad-hoc Localization System), such that we optimize TALS. Furthermore, an analysis and an extensive simulation for the optimized TALS (OTALS) is presented showing its cost, accuracy, and efficiency, thus deducing the impact of its parameters on performance. Our novel similarity measure formula can be used in many other domains such as clustering and classification. However, we present its efficiency only for a particular problem in this work. Thus, the major contribution of this work can be summarized as follows: (1) Proposing and employing a novel modified Manhattan distance norm in the TALS localization process. (2) Analyzing and simulating of OTALS showing its computational cost and accuracy and comparing them with other related work. (3) Studying the impacts of different parameters like anchor density, node density, noisy measurements, transmission range, and non-convex network areas. (4) Extending our previous joint work, TALS, to consider base anchors to be located in positions other than the origin and analyzing this work to illustrate the possibility of selecting a wrong quadrant at the first iteration and how this problem is overcome. Through mathematical analysis and intensive simulation, OTALS proved to be iterative, distributed, and computationally simple. It presented superior performance compared to other localization techniques. (C) 2015 Elsevier B.V. All rights reserved.
机译:在无线传感器网络中建立高效的节点定位系统面临着若干挑战。例如,计算平方根会消耗计算资源,而使用洪泛技术来广播节点位置会浪费带宽和能量。为了降低功耗,延长电池供电节点的使用寿命并提高这些传感器节点有限的计算资源的性能,降低计算复杂性和通信开销至关重要。为此,我们提出了一种新颖的修改后的曼哈顿距离范数,并将其应用于以前的本地化系统(称为TALS(三角自组织定位系统))中,从而优化了TALS。此外,对优化的TALS(OTALS)进行了分析和广泛的仿真,显示了其成本,准确性和效率,从而推论了其参数对性能的影响。我们新颖的相似性度量公式可用于许多其他领域,例如聚类和分类。但是,我们仅针对此工作中的特定问题提出其效率。因此,这项工作的主要贡献可以概括如下:(1)在TALS本地化过程中提出并采用了一种新颖的修正曼哈顿距离范数。 (2)对OTALS进行分析和仿真,显示其计算成本和准确性,并将其与其他相关工作进行比较。 (3)研究不同参数的影响,例如锚点密度,节点密度,噪声测量,传输范围和非凸网络区域。 (4)扩展我们之前的联合工作TALS,以考虑将基本锚定位置定位在原点以外的位置,并分析此工作以说明在第一次迭代中选择错误象限的可能性以及如何解决此问题。通过数学分析和深入的模拟,OTALS被证明是迭代,分布式和计算简单的。与其他本地化技术相比,它具有更高的性能。 (C)2015 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号