Conference proceeding
Network localizability with link or node losses
49th IEEE Conference on Decision and Control (CDC), pp.402-407
12/2010
DOI: 10.1109/CDC.2010.5716939
Abstract
The ability to localize a sensor network is important for its deployment. A theoretical result exists defining necessary and sufficient conditions for network unique localizability (for inter-sensor range-based localization); it has its roots in Graph Rigidity Theory where sensors and links/measurements are modelled as vertices and edges of a graph, respectively. However, critical missions do require a level of robustness for localizability, ensuring that localizability is retained in the event of link (edge) losses and/or sensor (vertex) losses. This work characterizes this robustness through a novel notion of redundant localizability, which is backed by redundant rigidity. Analogously to two well-known types of result for rigidity characterization, similar results are developed for edge redundant rigidity; they are supplemented by rather fewer results dealing with vertex redundant rigidity. These preliminary results may shed a light for any further study of redundant localizability.
Details
- Title: Subtitle
- Network localizability with link or node losses
- Creators
- Changbin Yu - Australian National UniversitySoura Dasgupta - University of IowaBrian D O Anderson - Australian National University
- Resource Type
- Conference proceeding
- Publication Details
- 49th IEEE Conference on Decision and Control (CDC), pp.402-407
- Publisher
- IEEE
- DOI
- 10.1109/CDC.2010.5716939
- ISSN
- 0191-2216
- Language
- English
- Date published
- 12/2010
- Academic Unit
- Electrical and Computer Engineering
- Record Identifier
- 9984197170702771
Metrics
9 Record Views