| 引用本文: | 刁英斐,付敏跃,张焕水.传感器网络的可定位性条件(英文)[J].控制理论与应用,2013,30(5):625~631.[点击复制] |
| DIAO Ying-fei,FU Min-yue,ZHANG Huan-shui.Localizability exploration of sensor network[J].Control Theory and Technology,2013,30(5):625~631.[点击复制] |
|
| 传感器网络的可定位性条件(英文) |
| Localizability exploration of sensor network |
| 摘要点击 2575 全文点击 1577 投稿时间：2012-05-21 修订日期：2012-10-15 |
| 查看全文 查看/发表评论 下载PDF阅读器 |
| DOI编号 10.7641/CTA.2013.12115 |
| 2013,30(5):625-631 |
| 中文关键词 传感器网络 定位算法 图论 |
| 英文关键词 sensor network localization graph theory |
| 基金项目 This work is supported by the National Natural Science Foundation of China (Nos. 61134001, 61120106011, 61203029), and 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. |