Modified Bron–Kerbosch-Based Sensor Deployment Algorithm for Target Coverage in Wireless Sensor Networks

The growing adoption ofWireless Sensor Network (WSN) technologies has highlighted several critical factors that are vital for their efficiency and functionality. Optimal sensor node deployment emerges as a critical factor that significantly impacts the performance and overall effectiveness of the network. To address these challenges, a new deployment algorithm is proposed that substantially reduce the number of sensor requirement to ensure maximum coverage based on the geometric relationship between the targets. This paper proposes a novel Modified Bron-Kerbosch based Sensor Deployment(MBK-SD) algorithm that partition the vertex set as maximal clique and an iterative circle intersection method is introduced to find the optimal sensor placement. Theorem is proven that a central point exists within a specified distance R from all vertices forming a circle with radius R. The experimental results demonstrate that the proposed algorithm requires minimum number of sensors compared to Vertex Coloring based Optimal Sensor Placement(VC-OSP) and achieves better coverage compared to the Artificial Bee Colony (ABC) algorithm and Firefly Algorithm(FA). Statistical analysis is conducted for the proposed algorithm in comparison with ABC and FA. The results demonstrate the significance of the proposed algorithm over ABC and FA.