- Title
- Localizability exploration of sensor network
- Creator
- Diao, Ying-fei; Fu, Min-yue; Zhang, Huan-shui
- Relation
- Kongzhi Lilun Yu Yingyong / Control Theory and Applications Vol. 30, Issue 5, p. 625-631
- Publisher
- Huanan Ligong Daxue / South China Unversity of Technology
- Resource Type
- journal article
- Date
- 2013
- Description
- 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 thelocalizability of two merging graphs is given.
- Subject
- sensor network; localization; graph theory
- Identifier
- http://hdl.handle.net/1959.13/1295123
- Identifier
- uon:18949
- Identifier
- ISSN:1000-8152
- Language
- eng
- Reviewed
- Hits: 1312
- Visitors: 1262
- Downloads: 1
| Thumbnail | File | Description | Size | Format |
|---|