A Multi-Hop Cluster Routing Algorithm for Wireless Sensor Networks Targeting Narrow Space Monitoring

Area of Science:

• Engineering
• Computer Science
• Network Engineering

Background:

• Wireless sensor networks (WSNs) are crucial for monitoring elongated infrastructures like bridges and railways.
• Multi-hop routing in WSNs for narrow spaces demands high energy efficiency and network lifespan.
• Existing routing algorithms face challenges in optimizing energy consumption and extending network lifetime in these specific environments.

Purpose of the Study:

• To propose a novel Multi-hop Cluster Routing Algorithm based on an Improved Sparrow Search Algorithm (ISSAMC).
• To optimize multi-hop paths from cluster heads (CHs) to the base station in WSNs deployed in narrow spaces.
• To enhance the network stability period and overall lifespan of WSNs.

Main Methods:

• Implemented a non-uniform clustering mechanism considering node residual energy and distance to the base station.
• Developed a multi-objective fitness function to minimize total and variance in CH energy consumption with dynamic weight adjustment.
• Utilized an improved Sparrow Search Algorithm (SSA) with Sobol sequences, discrete encoding/decoding, and advanced crossover techniques for path optimization.

Main Results:

• The ISSAMC algorithm significantly improved the network stability period compared to existing algorithms (MH-LEACH, GAECH, BEBMCR, EBPSO).
• Demonstrated substantial increases in overall network lifetime, outperforming benchmark algorithms.
• Achieved high-quality multi-hop paths through optimized routing strategies.

Conclusions:

• The ISSAMC algorithm effectively addresses the energy efficiency and lifespan challenges in WSNs for narrow space infrastructure monitoring.
• The proposed routing strategy offers a significant improvement over existing methods, enhancing WSN performance.
• This research provides a valuable contribution to the field of WSNs for structural health monitoring applications.