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

DOI10.1016/J.JPDC.2009.12.004MaRDI QIDQ666113zbMATH OpenOpenAlexFDO

Authors 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) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• Minimum power multicasting in wireless networks under probabilistic node failures
• scientific article; zbMATH DE number 1670672
• Improving construction for connected dominating set with Steiner tree in wireless sensor networks
• Distributed Minimum Spanning Tree Maintenance for Transient Node Failures
• Wireless multicasting under probabilistic node failures: a heuristic approach

Cites work

• 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
• Fault-tolerant and efficient data propagation in wireless sensor networks using local, additional network information
• Relay Node Placement in Wireless Sensor Networks
• Steiner tree problem with minimum number of Steiner points and bounded edge-length
• Tighter Bounds for Graph Steiner Tree Approximation

Cited in

(2)

• Efficient data reporting in intelligent transportation systems
• Nature-inspired donkey and smuggler algorithm for optimal data gathering in partitioned wireless sensor networks for restoring network connectivity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666113)