Network Localizability with Link or Node Losses

Date

2010

Authors

Yu, Changbin (Brad)
Dasgupta, Soura
Anderson, Brian

Journal Title

Journal ISSN

Volume Title

Publisher

Institute of Electrical and Electronics Engineers (IEEE Inc)

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.

Description

Keywords

Keywords: Graph rigidity theory; Localizability; Range-based; Sensor network localization; Sufficient conditions; Theoretical result; Robustness (control systems); Sensor networks; Space shuttles; Rigidity Network localizability; Rigidity theory; Sensor network localization

Citation

Source

IEEE Conference on Decision and Control 2010 Proceedings

Type

Conference paper

Book Title

Entity type

Access Statement

License Rights

DOI

10.1109/CDC.2010.5716939

Restricted until

2037-12-31