An Enhanced Virtual Force Algorithm for Diverse k-Coverage Deployment of 3D Underwater Wireless Sensor Networks

Area of Science:

• Wireless Sensor Networks
• Edge Computing
• Underwater Sensor Networks

Background:

• Wireless Sensor Networks (WSNs) combined with edge computing enable new applications.
• 3D Underwater Wireless Sensor Networks (UWSNs) are a significant research area.
• Network coverage is crucial for UWSN information acquisition, environment perception, and survivability.

Purpose of the Study:

• To determine the minimal sensor nodes for diverse k-coverage in UWSNs.
• To propose an algorithm for uneven regional coverage optimization based on k-coverage requirements.
• To enhance the deployment strategy for UWSNs.

Main Methods:

• Investigated the minimal sensor node requirement for diverse k-coverage.
• Proposed the k-Equivalent Radius enhanced Virtual Force Algorithm (k-ERVFA).
• Conducted theoretical analysis and simulation experiments.

Main Results:

• The proposed k-ERVFA algorithm achieves effective uneven regional coverage optimization.
• Demonstrated superior coverage rates in high k-coverage sub-regions.
• Achieved desirable diverse k-coverage deployment.

Conclusions:

• k-ERVFA provides an effective solution for diverse k-coverage in 3D UWSNs.
• The algorithm shows robustness in sensor-sparse and time-variant scenarios.
• Validated through theoretical analysis and simulations.