Connectivity restoration in a partitioned wireless sensor network with assured fault tolerance

@article{Lee2015ConnectivityRI,
  title={Connectivity restoration in a partitioned wireless sensor network with assured fault tolerance},
  author={Sookyoung Lee and Mohamed F. Younis and Meejeong Lee},
  journal={Ad Hoc Networks},
  year={2015},
  volume={24},
  pages={1-19}
}
Fault-Tolerant Algorithms for Connectivity Restoration in Wireless Sensor Networks
TLDR
Two algorithms named Full 2-Connectivity Restoration Algorithm (F2CRA) and Partial 3-Connectivities Restoration Al algorithm (P3CRA), which restore a faulty WSN in different aspects are presented, ensuring that the network has stronger fault-tolerant function, larger coverage area and better balanced load after the restoration.
A Novel Technique for Energy Optimization and Restoration of Connectivity in Wireless Sensor Networks
TLDR
A novel technique for different cases of nodes failure is proposed and the effectiveness of proposed algorithm has been proved by simulation results.
Relay Node Placement for Connectivity Restoration in Wireless Sensor Networks Using Genetic Algorithms
TLDR
Experimental results indicate that the proposed GA is capable of establishing network connectivity using a reasonable number of RNs compared to the best existing work.
CRVR: Connectivity Repairing in Wireless Sensor Networks with Void Regions
TLDR
This paper presents the protocol Connectivity Repairing in WSN with void regions, which selects a set of redundant nodes and classifies them according to their energy levels and creates a strengthening path to the center of their area.
Networks connectivity recovery method based on finite state machine
  • Ying Zhang, Guan Hao
  • Computer Science
    2017 29th Chinese Control And Decision Conference (CCDC)
  • 2017
TLDR
This paper proposes a Distributed Connectivity Recovery Method on Finite state machine (DCRMF), which firstly identifies whether a node is a critical node, and then update the connected dominating set, and if a failure node is critical, the nearest uncritical node will be relocated to replace the failure node.
Smart node relocation (SNR) and connectivity restoration mechanism for wireless sensor networks
TLDR
By performing extensive simulations, it is proved that SNR outperforms the existing approaches concerning multiple performance metrics including but not limited to the total number of packets transmitted, total distance moved for connectivity restoration, the percentage reduction in field coverage.
...
...

References

SHOWING 1-10 OF 37 REFERENCES
Topology Management Techniques for Tolerating Node Failure
TLDR
This chapter focuses on network topology management techniques for tolerating node failures in Wireless Sensor Networks, analyzes the effects of node failure on network connectivity in WSNs, categorizes recently published recovery schemes, and outlines related open issues.
Bio-Inspired Relay Node Placement Heuristics for Repairing Damaged Wireless Sensor Networks
TLDR
This paper investigates a strategy for recovering from large-scale damage through the placement of relay nodes (RNs) and promotes a novel approach that resembles a spider web, which achieves better sensor coverage and enables balanced distribution of traffic load among the employed relays as well.
Distributed Recovery from Network Partitioning in Movable Sensor/Actor Networks via Controlled Mobility
TLDR
The approach, namely, MDAPRA strives to provide a mutual exclusion mechanism in repositioning the nodes to restore connectivity and localize the scope of the recovery and minimize the overhead imposed on the nodes.
Fault-tolerant relay node placement in wireless sensor networks: formulation and approximation
  • Bin Hao, Han Tang, G. Xue
  • Computer Science
    2004 Workshop on High Performance Switching and Routing, 2004. HPSR.
  • 2004
TLDR
A polynomial time approximation algorithm is presented and it is proved the worst-case performance given by the algorithm is bounded within O(D log n) times of the size of an optimal solution, where n is the number of sensor nodes in the network, D is the diameter of the network formed by a sufficient set of possible positions for relay nodes.
Deploying sensor networks with guaranteed capacity and fault tolerance
TLDR
This work designs and analyzes the first algorithms that place an almost-minimum number of additional sensors to augment an existing network into a k-connected network, for any desired parameter k, and proves that the number ofAdditional sensors is within a constant factor of the absolute minimum for any fixed k.
Optimized Relay Placement to Federate Wireless Sensor Networks in environmental applications
TLDR
This paper proposes a grid-based deployment for relay nodes in which the relays are efficiently placed on the grid vertices to connect the disjointed WSN sectors, and designs an Optimized Relay Placement (ORP) approach that maximizes the disJointed sectors connectivity while maintaining cost constraints.
Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms
  • Weiyi Zhang, G. Xue, S. Misra
  • Computer Science
    IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications
  • 2007
TLDR
This paper studies four related fault-tolerant relay node placement problems and presents a polynomial time O(1)-approximation algorithm with a small approximation ratio for each of them.
On “Movement-Assisted Connectivity Restoration in Wireless Sensor and Actor Networks”
TLDR
This work presents a general actor relocation problem and proposes methods that will work correctly for several subsets of the problems and shows that the algorithms proposed will not work smoothly in all scenarios as claimed and gives counterexamples for some algorithms and theorems proposed.
...
...