...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International journal of ad hoc and ubiquitous computing >A range-free localisation algorithm based on connectivity in wireless sensor networks
【24h】

A range-free localisation algorithm based on connectivity in wireless sensor networks

机译：无线传感器网络中基于连通性的无范围定位算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Sensor nodes' position is very important in many wireless sensor networks (WSNs) applications. In this paper, a novel range-free localisation algorithm based on connectivity (LAC) is proposed. By exploiting the probabilistic regulation in cluster-based deployment, the theoretical number of a sensor's neighbours from certain cluster is determined by distance between the sensor and the corresponding cluster head. So distances between sensors and cluster heads can be derived by minimising the deviation between the theoretical number of neighbour sensors and the measurement. Using the optimal distance to each cluster head, the position of each sensor can be estimated with maximum likelihood (ML) multilateration. Compared with some existing range-free algorithms, LAC performs better in terms of localisation accuracy, especially in beacon-less scenarios and reduces communication overhead and computation complexity to some extent. Extensive simulations are performed and the results are observed to be in good consistence with theoretical analysis.
机译：在许多无线传感器网络（WSN）应用中，传感器节点的位置非常重要。提出了一种新的基于连通性的无范围定位算法。通过利用基于群集的部署中的概率规则，来自特定群集的传感器邻居的理论数量由传感器和相应群集头之间的距离确定。因此，可以通过最小化相邻传感器的理论数量与测量值之间的偏差来得出传感器与簇头之间的距离。使用到每个簇头的最佳距离，可以最大似然（ML）多边估计每个传感器的位置。与某些现有的无范围算法相比，LAC在定位精度方面表现更好，尤其是在无信标的情况下，并且在一定程度上降低了通信开销和计算复杂性。进行了广泛的仿真，结果与理论分析非常吻合。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号