@inproceedings{63275b798a5f4226bd023bbab0aceb4f,
title = "Network localizability with link or node losses",
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.",
keywords = "Network localizability, Rigidity theory, Sensor network localization",
author = "Changbin Yu and Soura Dasgupta and Anderson, \{Brian D.O.\}",
year = "2010",
doi = "10.1109/CDC.2010.5716939",
language = "English",
isbn = "9781424477456",
series = "Proceedings of the IEEE Conference on Decision and Control",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "402--407",
booktitle = "2010 49th IEEE Conference on Decision and Control, CDC 2010",
address = "United States",
note = "49th IEEE Conference on Decision and Control, CDC 2010 ; Conference date: 15-12-2010 Through 17-12-2010",
}