2012 | OriginalPaper | Buchkapitel
On Barrier Resilience of Sensor Networks
verfasst von : Kuan-Chieh Robert Tseng, David Kirkpatrick
Erschienen in: Algorithms for Sensor Systems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Various notions of coverage have been introduced as basic quality-of-service measures for wireless sensor networks. One natural measure of coverage is referred to as
resilience
: given a starting region
S
and a target region
T
, the resilience a sensor configuration with respect to
S
and
T
is the minimum number of sensors that need to be deactivated before an
S
−
T
path can exist that does not cross any active sensor region. We demonstrate that determining resilience of a network of unit-line-segment sensors is NP-hard. Furthermore, we can extend our proof to show that the resilience problem remains NP-hard for other types of non-symmetric sensor coverage regions.