首页> 外文学位 >SALAM: A scalable anchor-free localization algorithm for wireless sensor networks.
【24h】

SALAM: A scalable anchor-free localization algorithm for wireless sensor networks.

机译:SALAM:一种用于无线传感器网络的可扩展的无锚定位算法。

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

摘要

In this dissertation, we present SALAM, a scalable anchor-free protocol for localization in wireless sensor networks. SALAM can determine the positions of sensor nodes without any infrastructure support. We assume that each node has the capability to estimate distances to its corresponding neighbors, that are within its transmission range. SALAM allows to trade the accuracy of the estimated position against node transmission range and/or computational power. The application layer can choose from a whole range of different options, to estimate the sensor node's positions with different accuracy while conserving battery power.; Scalability is achieved by dividing the network into overlapping multi-hop clusters each with its own cluster head node. Each cluster head is responsible for building a local relative map corresponding to its cluster using intra-cluster node's range measurements. To obtain the global relative topology of the network, the cluster head nodes collaboratively combine their local maps using simple matrix transformations.; In order for two cluster heads to perform a matrix transformation, there must be at least three boundary nodes that belongs to both clusters (i.e. the two clusters are overlapping with degree ≥ 3). We formulate the overlapping multi-hop clustering problem and present a randomized distributed heuristic algorithm for solving the problem. We evaluate the performance of the proposed algorithm through analytical analysis and simulation.; A major problem with multi-hop relative location estimation is the error accumulated in the node position as it becomes multi-hop away from the cluster head node. We analyze different sources of error and develop techniques to avoid these errors. We also show how the local coordinate system (LCS) affects the accuracy and propose different heuristics to select the LCS.; Simulation results show that SALAM achieves precise localization of sensors. We show that our approach is scalable in terms of communication overhead regardless of the network size. In addition, we capture the impact of different parameters on the accuracy of the estimated node's positions. The results also show that SALAM is able to achieve accuracy better than the current ad-hoc localization algorithms.
机译:在本文中,我们提出了SALAM,一种可扩展的无锚协议,用于无线传感器网络中的定位。 SALAM无需任何基础架构支持即可确定传感器节点的位置。我们假设每个节点都有能力估计到其相应邻居的距离,该距离在其传输范围之内。 SALAM允许将估计位置的精度与节点传输范围和/或计算能力进行权衡。应用层可以从整个范围的不同选项中进行选择,以在节省电池电量的同时以不同的精度估算传感器节点的位置。通过将网络划分为重叠的多跳群集(每个群集都有自己的群集头节点)来实现可伸缩性。每个群集头负责使用群集内节点的范围测量来构建与其群集相对应的本地相对图。为了获得网络的全局相对拓扑,群集头节点使用简单的矩阵转换来协作地组合其本地地图。为了使两个簇头执行矩阵变换,必须至少有两个属于两个簇的边界节点(即两个簇的度数≥3重叠)。我们提出了重叠的多跳聚类问题,并提出了一种解决该问题的随机分布式启发式算法。我们通过分析和仿真评估了该算法的性能。多跳相对位置估计的主要问题是,随着节点距离簇头节点变多跳,节点位置中累积的误差。我们分析了错误的不同来源,并开发了避免这些错误的技术。我们还展示了局部坐标系(LCS)如何影响准确性,并提出了不同的启发式方法来选择LCS。仿真结果表明,SALAM实现了传感器的精确定位。我们表明,无论网络大小如何,我们的方法在通信开销方面都是可扩展的。此外,我们捕获了不同参数对估计节点位置准确性的影响。结果还表明,SALAM的精度要优于当前的临时定位算法。

著录项

  • 作者单位

    University of Maryland, College Park.;

  • 授予单位 University of Maryland, College Park.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2006
  • 页码 192 p.
  • 总页数 192
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号