Coverage Optimization in Wireless Sensor Networks by Detecting and Healing Uncovered Area Through Iterative Sensor Deployment: A Computational Geometry Based Approach

Achievement of optimal area coverage is a significant challenge in Wireless Sensor Networks (WSNs) influenced by factors such as the limited range of sensors, energy constraints and the dynamic nature of environments.Random deployment strategies for sensor nodes often result in coverage holes or redundant nodes.This study primarily focuses on identifying uncovered areas (coverage holes) within a specific region and devising a strategy to ensure maximum coverage with minimal overlap among newly deployed sensor nodes.The proposed work introduces an iterative approach, based on Computational Geometry to enhance coverage by detecting and healing uncovered area.The positions of new sensor nodes are determined by evaluating line intersections in uncovered areas, specifically those passing through the midpoints of uncovered arcs.This methodology ensures the effective placement of new nodes while minimizing redundancy.The process is repeated till the time no further progress in coverage can be attained.Simulation results demonstrate that this method effectively identifies uncovered areas and significantly improves coverage, making it a practical solution for optimizing two-dimensional area coverage in applications such as wireless sensor networks and geometric problem-solving.