首页> 外文期刊>Mathematical Problems in Engineering: Theory, Methods and Applications >EARP: Extended Area Multihop Node Localization Algorithm for Anisotropic Wireless Sensor Networks
【24h】

EARP: Extended Area Multihop Node Localization Algorithm for Anisotropic Wireless Sensor Networks

机译:EARP:面向各向异性无线传感器网络的扩展区域多跳节点定位算法

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Localization is one of the essential problems in the Internet of Things (IoT) and other wireless sensor applications. Most traditional range-free localization algorithms ignore the anisotropy factors, which are frequently observed in wireless sensor networks (WSNs) and result in low positioning precision. To mitigate the impact of anisotropy on localization, this paper proposes an extended area multihop node localization method. The proposed method classifies and discusses the boundaries of the concave area within the communication range of the node and then uses the maximum split communication distance of the node to identify and mark the boundary of the concave area. When the shortest communication path between the nodes is affected by the concave area, the boundary of the concave area is expanded to obtain the new shortest communication path, and the node distance is obtained by comparing the changes in the communication path. After a large number of simulation tests, it is shown that the calculation accuracy of this scheme is better than that of similar modern mainstream localization algorithms.
机译:定位是物联网 (IoT) 和其他无线传感器应用中的基本问题之一。大多数传统的无距离定位算法忽略了各向异性因素,这些因素在无线传感器网络(WSN)中经常出现,导致定位精度低。为了减轻各向异性对定位的影响,该文提出一种扩展区域多跳节点定位方法。该方法对节点通信范围内凹面区域的边界进行分类和讨论,然后利用节点的最大分割通信距离对凹面区域的边界进行识别和标记。当节点之间的最短通信路径受到凹面区域的影响时,扩大凹面区域的边界,得到新的最短通信路径,通过比较通信路径的变化来得到节点距离。经过大量的仿真测试表明,该方案的计算精度优于同类现代主流定位算法。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号