On the deployment of a connected sensor network for confident information coverage

Area of Science:

• Computer Science
• Electrical Engineering
• Network Engineering

Background:

• Wireless sensor networks (WSNs) rely on coverage and connectivity for performance.
• Existing sensor placement methods often use simplistic coverage models.

Purpose of the Study:

• To address the sensor placement problem in WSNs for optimal coverage and connectivity.
• To introduce and evaluate a novel confident information coverage model.

Main Methods:

• Discretizing the sensing field using a grid approach.
• Formulating sensor placement as a constrained optimization problem.
• Developing two heuristic algorithms: Connected Cover Formation (CCF) and Cover Formation and Relay Placement with Redundancy Removal (CFRP-RR).

Main Results:

• Both CCF and CFRP-RR algorithms provide effective approximate solutions for sensor placement.
• Simulation results demonstrate the algorithms' effectiveness in achieving coverage and connectivity.
• The CCF algorithm shows slightly superior performance compared to CFRP-RR.

Conclusions:

• The proposed confident information coverage model enhances WSN performance metrics.
• Heuristic algorithms like CCF are viable for solving complex sensor placement problems.
• Optimized sensor placement is crucial for reliable and efficient WSN operation.