传感器网络的可定位性条件(英文)  

Localizability exploration of sensor network

作　　者：刁英斐[1] 付敏跃[2,3] 张焕水[1] 

机构地区：[1]山东大学控制科学与工程学院,山东济南250061 [2]浙江大学控制科学与工程学系,浙江杭州310027 [3]纽卡斯尔大学电气工程与计算机科学学院

出　　处：《控制理论与应用》2013年第5期625-631,共7页Control Theory & Applications

基　　金：supported by the National Natural Science Foundation of China(Nos.61134001,61120106011,61203029);the Taishan Scholar Construction Engineering by Shandong Government

摘　　要：针对两个节点集合,提出了一组可定位性条件.可定位性条件包含两部分:两个集合之间需要的连接边的数目,以及如何布置这些连接边.本文将每组节点和它们的内部连接边刻画成一个距离图.两个节点集合之间的可定位性判定等同于两个融合图的全局刚性测试.针对两个融合图的可定位性,给出了一系列的充要条件.We propose a group of localizable conditions for two sets of nodes. The localizable conditions need to answer two questions： how many edges and where these edges are placed between two sets of nodes. Here, each set of nodes and their internal connections are modeled as a distance graph. The localizability exploration between two sets of nodes is characterized by the global rigidity test of two merging graphs. A series of necessary and sufficient conditions on the localizability of two merging graphs is given.

关 键 词：传感器网络 定位算法 图论 

分 类 号：TN929.5[电子电信—通信与信息系统] TP212.9[电子电信—信息与通信工程]