arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1308.6464cs.DC
收藏

无线传感器网络的可定位性:超越车轮延伸

Localizability of Wireless Sensor Networks: Beyond Wheel Extension

Buddhadeb Sau, Krishnendu Mukhopadhyaya

摘要:

如果网络中所有节点的位置都可以被唯一地计算出来,则网络被称为可局部化的。如果一个网络是可局部化的,并且具有一般的平面结构,则节点的位置可以在有限时间内唯一地计算。因此,识别可本地化网络是一项重要功能。如果在一个地方可以得到关于网络的完整信息,那么可以在多项式时间内测试可定位性。在分布式环境中,三边测量排序(在实际应用中很流行)和轮扩展(一类特定的本地化网络)嵌入平面的网络可以通过现有的技术来识别。我们提出了一种分布式的技术,有效地确定了一个更大的类的本地化网络。本课程涵盖三边测量和车轮扩展。实际上,精确的距离几乎是不可能的或昂贵的。该算法仅基于连通性信息。它不需要距离信息。

英文摘要:

A network is called localizable if the positions of all the nodes of the network can be computed uniquely. If a network is localizable and embedded in plane with generic configuration, the positions of the nodes may be computed uniquely in finite time. Therefore, identifying localizable networks is an important function. If the complete information about the network is available at a single place, localizability can be tested in polynomial time. In a distributed environment, networks with trilateration orderings (popular in real applications) and wheel extensions (a specific class of localizable networks) embedded in plane can be identified by existing techniques. We propose a distributed technique which efficiently identifies a larger class of localizable networks. This class covers both trilateration and wheel extensions. In reality, exact distance is almost impossible or costly. The proposed algorithm based only on connectivity information. It requires no distance information.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑