Recovery from multiple simultaneous failures in wireless sensor networks using minimum Steiner tree

DOI10.1016/J.JPDC.2009.12.004zbMath1233.68068OpenAlexW2074472645MaRDI QIDQ666113

Sookyoung Lee, Mohamed F. Younis

Publication date: 7 March 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2009.12.004

zbMATH Keywords

minimum Steiner treewireless sensor networksrelay node placementconnectivity restorationnetwork partitions

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (1)

Efficient data reporting in intelligent transportation systems

Cites Work

• Steiner tree problem with minimum number of Steiner points and bounded edge-length
• Fault-tolerant and efficient data propagation in wireless sensor networks using local, additional network information
• Relay Node Placement in Wireless Sensor Networks
• A Localized Algorithm for Restoring Internode Connectivity in Networks of Moveable Sensors
• Distributed Recovery from Network Partitioning in Movable Sensor/Actor Networks via Controlled Mobility
• Tighter Bounds for Graph Steiner Tree Approximation

This page was built for publication: Recovery from multiple simultaneous failures in wireless sensor networks using minimum Steiner tree