Rigidity, computation, and randomization in network localization
Rigidity, computation, and randomization in network localization
复制标题
DOI：
10.1109/infcom.2004.1354686
复制
发表时间：
2004-03
期刊：
影响因子：
--
通讯作者：
T. Eren;D. Goldenberg;W. Whiteley;Y. Yang;A. Morse;B. Anderson;P. Belhumeur
中科院分区：
文献类型：
--
作者：
T. Eren;D. Goldenberg;W. Whiteley;Y. Yang;A. Morse;B. Anderson;P. Belhumeur
我们为网络定位问题提供了理论基础，其中一些节点知道自己的位置，而其他节点通过测量到邻居的距离来确定自己的位置。我们构造基图来建模网络局部化，并应用图刚性理论来测试唯一可局部化的条件和构造唯一可局部化的网络。我们进一步研究了网络局部化的计算复杂性，并研究了一类可以有效计算网络局部化的根图。最后，我们讨论了传感器随机放置的传感器网络中的定位问题。
We provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors. We construct grounded graphs to model network localization and apply graph rigidity theory to test the conditions for unique localizability and to construct uniquely localizable networks. We further study the computational complexity of network localization and investigate a subclass of grounded graphs where localization can be computed efficiently. We conclude with a discussion of localization in sensor networks where the sensors are placed randomly.