Graph theoretic techniques in the analysis of uniquely localizable sensor networks
Graph theoretic techniques in the analysis of uniquely localizable sensor networks
复制标题
DOI：
10.4018/978-1-60566-396-8.ch006
复制
发表时间：
2009
影响因子：
--
通讯作者：
B. Jackson;T. Jordán
中科院分区：
文献类型：
--
作者：
B. Jackson;T. Jordán
在网络定位问题中，目标是通过只使用两两距离的部分信息(并通过计算某些节点的准确位置，称为锚点)来确定所有节点的位置。如果存在与给定数据一致的唯一位置集，则称该网络是唯一可本地化的。图论和组合刚性的最新结果使得刻画二维唯一可局部化网络成为可能。基于这些发展，扩展、相关的优化问题、算法和构造也变得容易处理。本章从图论家的观点出发，对这些新结果进行了详细的综述。
In the network localization problem the goal is to determine the location of all nodes by using only partial information on the pairwise distances (and by computing the exact location of some nodes, called anchors). The network is said to be uniquely localizable if there is a unique set of locations consistent with the given data. Recent results from graph theory and combinatorial rigidity made it possible to characterize uniquely localizable networks in two dimensions. Based on these developments, extensions, related optimization problems, algorithms, and constructions also became tractable. This chapter gives a detailed survey of these new results from the graph theorist’s viewpoint.