Breadth-first search-based single-phase algorithms for bridge detection in wireless sensor networks.

Area of Science:

• Computer Science
• Network Engineering
• Distributed Systems

Background:

• Wireless sensor networks (WSNs) are vital for monitoring harsh environments.
• Multi-hop communication is common in WSNs due to limited node transmission range.
• Network connectivity is crucial, and bridges (critical edges) must be identified to maintain it.

Purpose of the Study:

• To propose novel, energy-efficient, and distributed algorithms for bridge detection in WSNs.
• To integrate bridge detection seamlessly with existing routing protocols like Breadth-First Search (BFS).
• To minimize resource consumption, particularly energy, in battery-powered sensor nodes.

Main Methods:

• Development of two distributed bridge detection algorithms for WSNs.
• Algorithm 1: An extension of Milic's algorithm optimized for reduced message length.
• Algorithm 2: A novel approach utilizing ancestral knowledge for bridge identification.
• Integration with Breadth-First Search (BFS) for efficient routing and detection.
• Analysis of correctness, message, time, space, and computational complexities.
• Validation through testbed experiments and extensive simulations.

Main Results:

• The proposed algorithms achieve energy-efficient and distributed bridge detection.
• Significant reduction in resource consumption compared to existing methods.
• Energy savings up to 5.5 times were demonstrated.
• Algorithms are proven correct and analyzed for their complexity.

Conclusions:

• The developed algorithms effectively detect bridges in WSNs while conserving energy.
• These methods are suitable for deployment in resource-constrained WSN environments.
• The findings highlight the practical importance of energy-efficient network management in WSNs.