Fault-Tolerant Algorithms for Connectivity Restoration in Wireless Sensor Networks

Area of Science:

• Computer Science
• Network Engineering
• Wireless Communication

Background:

• Wireless Sensor Networks (WSNs) are vulnerable to large-scale failures in hostile environments, necessitating effective restoration strategies.
• Existing WSN restoration schemes often overlook critical factors like network coverage and topology quality, focusing solely on node count or fault tolerance.
• Timely restoration is crucial for maintaining WSN functionality after node failures.

Purpose of the Study:

• To develop novel algorithms for restoring faulty Wireless Sensor Networks (WSNs) that consider both network performance and restoration efficiency.
• To address the limitations of current restoration methods by incorporating network coverage and topology quality.
• To present two distinct algorithms, F2CRA and P3CRA, tailored for different restoration priorities.

Main Methods:

• Proposed the Full 2-Connectivity Restoration Algorithm (F2CRA) using a fan-shaped topology to minimize deployed nodes.
• Developed the Partial 3-Connectivity Restoration Algorithm (P3CRA) employing a dual-ring topology for enhanced fault tolerance.
• Evaluated algorithm performance against existing methods, focusing on fault tolerance, coverage, and load balancing.

Main Results:

• F2CRA effectively reduces the number of deployed nodes while ensuring network connectivity.
• P3CRA significantly improves the fault tolerance of the restored WSN.
• Both algorithms demonstrate superior fault-tolerant capabilities, increased coverage area, and better load balancing compared to conventional approaches.

Conclusions:

• F2CRA is optimal when minimizing restoration cost is the primary concern.
• P3CRA is the preferred choice when prioritizing overall network quality and resilience.
• The proposed algorithms offer a more comprehensive solution for WSN restoration, enhancing network robustness and efficiency.