基于通信轮的无线传感器网络分布式定位
Distributed Localization of Wireless Sensor Network Using Communication Wheel
摘要:
我们研究网络定位问题,即,研究了无线传感器网络中节点位置的确定问题。在任意部署的网络中,网络的所有节点的位置可能不是唯一确定的。众所周知,即使网络对应于唯一解,也没有多项式时间算法可以在最坏情况下解决这个问题,除非RP = NP。因此,我们感兴趣的算法,有效地局部网络。一种广泛使用的技术,可以有效地定位网络的唯一可定位的部分是三边测量:从三个锚点(具有已知位置的节点)开始,顺序定位具有至少三个本地化邻居的节点。然而,对于初始三个锚点的不同选择,三边测量的性能可以显著不同。在本文中,我们提出了一个分布式的本地化计划,保证本地化的节点的理论表征。特别是,我们提出的分布式算法开始定位从一个强内部节点,并提供了由强内部节点诱导的子图是连接的,它定位的网络中的所有节点,除了一些边界节点和孤立的弱内部节点。
英文摘要:
We study the network localization problem, i.e., the problem of determining node positions of a wireless sensor network modeled as a unit disk graph. In an arbitrarily deployed network, positions of all nodes of the network may not be uniquely determined. It is known that even if the network corresponds to a unique solution, no polynomial-time algorithm can solve this problem in the worst case, unless RP = NP. So we are interested in algorithms that efficiently localize the network partially. A widely used technique that can efficiently localize a uniquely localizable portion of the network is trilateration: starting from three anchors (nodes with known positions), nodes having at least three localized neighbors are sequentially localized. However, the performance of trilateration can substantially differ for different choices of the initial three anchors. In this paper, we propose a distributed localization scheme with a theoretical characterization of nodes that are guaranteed to be localized. In particular, our proposed distributed algorithm starts localization from a strongly interior node and provided that the subgraph induced by the strongly interior nodes is connected, it localizes all nodes of the network except some boundary nodes and isolated weakly interior nodes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。