Using Clustering Information for Sensor Network Localization
Using Clustering Information for Sensor Network Localization
复制标题
DOI：
10.1007/11502593_11
复制
发表时间：
2005-06
期刊：
影响因子：
--
通讯作者：
Haowen Chan;Mark Luk;A. Perrig
中科院分区：
文献类型：
--
作者：
Haowen Chan;Mark Luk;A. Perrig
传感器网络定位仍然是一个重要的研究挑战。定位的目标是为传感器网络中的每个节点分配地理坐标。传感器网络系统的定位方案应使用廉价的现成硬件，可扩展到大型网络，并且在部署区域存在不规则和障碍的情况下也能实现良好的准确性。我们提出了一种新的定位方法，可以满足所有这些期望的属性。传感器网络聚类算法的最新发展导致了分布式算法产生高度规则的聚类。我们建议利用这种规律来通知我们的定位算法。我们的方法的主要优点是，我们的协议只需要三个随机放置的节点，知道它们的地理坐标，并且不需要任何测距或定位设备（即，不需要信号强度测量，超声波测距或定向天线）。到目前为止，只有DV-Hop定位机制在相同的假设下工作。我们表明，我们提出的方法在某些情况下可能优于DV-Hop，特别是当部署区域存在较大障碍物时，或者当部署区域没有障碍物但锚点数量有限时。
Sensor network localization continues to be an important research challenge. The goal of localization is to assign geographic coordinates to each node in the sensor network. Localization schemes for sensor network systems should work with inexpensive off-the-shelf hardware, scale to large networks, and also achieve good accuracy in the presence of irregularities and obstacles in the deployment area.We present a novel approach for localization that can satisfy all of these desired properties. Recent developments in sensor network clustering algorithms have resulted in distributed algorithms that produce highly regular clusters. We propose to make use of this regularity to inform our localization algorithm. The main advantages of our approach are that our protocol requires only three randomly-placed nodes that know their geographic coordinates, and does not require any ranging or positioning equipment (i.e., no signal strength measurement, ultrasound ranging, or directional antennas are needed). So far, only the DV-Hop localization mechanism worked with the same assumptions [1]. We show that our proposed approach may outperform DV-Hop in certain scenarios, in particular when there exist large obstacles in the deployment field, or when the deployment area is free of obstacles but the number of anchors is limited.