A Distributed and Energy-Efficient Algorithm for Event K-Coverage in Underwater Sensor Networks.

Area of Science:

• Computer Science
• Network Engineering
• Wireless Sensor Networks

Background:

• Existing event K-coverage algorithms suffer from imbalanced energy consumption and network load.
• Greedy approaches for node selection neglect residual energy and multi-event node assignments, impacting network efficiency.

Purpose of the Study:

• To propose a distributed and energy-efficient event K-coverage algorithm (DEEKA) for wireless sensor networks.
• To enhance network lifetime and service quality by optimizing energy consumption and load balancing.

Main Methods:

• DEEKA employs a competitive mechanism for management node selection based on candidate nodes, residual energy, and distance.
• It incorporates probability estimation for neighbor node selection considering distance, energy levels, and event load.
• An optimization model using expected energy consumption and residual energy variance is solved with NSGA-II and TOPSIS.

Main Results:

• DEEKA effectively balances network energy consumption compared to on-demand variable sensing K-coverage algorithms.
• The proposed algorithm reduces overall network energy usage, leading to an extended network lifetime.
• DEEKA maintains optimal service quality throughout the prolonged network operation.

Conclusions:

• DEEKA offers a robust solution for energy-efficient K-coverage in dynamic event scenarios, particularly in challenging environments like underwater networks.
• The algorithm's consideration of residual energy and multi-event node selection significantly improves network sustainability.
• DEEKA demonstrates superior performance in balancing energy consumption and extending network longevity.