2017 · 11 citations · 10 references
EngineeringComputer EngineeringElectrical EngineeringFault ToleranceFault-tolerant ComputingWireless CommunicationsNetwork ConnectivityNetwork OptimizationNetwork ReliabilityNetwork TopologySensor NetworksWireless Sensor NetworksMinimum Spanning Tree AlgorithmsMinimum Spanning Tree ProblemNetwork DeploymentNode RecoveryRelay NetworksSensor Node DeploymentSensor NodesVirtual Force Fields
Wireless sensor networks have been used extensively in a range of applications. Due to the harsh surroundings and their inherent vulnerability, these networks suffer from simultaneous nodes failure possibly causing the network to become partitioned into multiple disjoint segments. This paper proposes a Connecting via Virtual Force and Compromise Strategy (CVFCS) for recovering from this damage using relay nodes placement. Different from most existing restoration, it considers the segments as collections of sensor nodes, and not as some representative node. Firstly, the approach uses virtual forces to adjust existing nodes of damaged deployment for increasing coverage degree. Then it finds the proper triangular Steiner points or minimum spanning tree edges to achieve the optimal connecting all segments by using relay nodes. The simulation shows that the proposed CVFCS requires less relay nodes than other algorithms under the same damaged topology.
10
Approximations for Steiner Trees with Minimum Number of Steiner Points
Dong‐Hui Chen, Ding‐Zhu Du, Guohui Lin et al. · Journal of Global Optimization · 2000 · 138 citations
Approximations for Steiner trees with minimum number of Steiner points
Dong‐Hui Chen, Ding‐Zhu Du, Guohui Lin et al. · Theoretical Computer Science · 2001 · 67 citations