PSEUDO CODE OF ALGORITHM
BEGIN
Rs Radius of sensing node
N Number of nodes in WSN
Construct the DELAUNAY TRIANGULATION in WSN
K Compute the number of DELAUNAY TRIANGLE formed by above method
For each triangle L //L=[1:K]
Compute RC for this triangle
If RC > Rs
//Check whether obtuse triangle or not
If Obtuse triangle
//Check whether fully covered or not
If not fully covered
Store this triangle in hole table
END if
Else Store this triangle in hole table
END if
END if
Return boundaries of coverage holes
END