Recovery from multiple simultaneous failures in wireless sensor networks using minimum Steiner tree (Q666113): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Distributed Recovery from Network Partitioning in Movable Sensor/Actor Networks via Controlled Mobility / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fault-tolerant and efficient data propagation in wireless sensor networks using local, additional network information / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Steiner tree problem with minimum number of Steiner points and bounded edge-length / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Relay Node Placement in Wireless Sensor Networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tighter Bounds for Graph Steiner Tree Approximation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Localized Algorithm for Restoring Internode Connectivity in Networks of Moveable Sensors / rank | |||
Normal rank | |||
Latest revision as of 00:02, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recovery from multiple simultaneous failures in wireless sensor networks using minimum Steiner tree |
scientific article |
Statements
Recovery from multiple simultaneous failures in wireless sensor networks using minimum Steiner tree (English)
0 references
7 March 2012
0 references
connectivity restoration
0 references
wireless sensor networks
0 references
network partitions
0 references
relay node placement
0 references
minimum Steiner tree
0 references
0 references
0 references
