ABSTRACT
The use of underground wireless sensor networks is becoming increasingly popular, in the terrains and areas where human intervention or reach is difficult. They play a very crucial role in observing the conditions of the areas far from human reach. Unfortunately, the biggest problem they suffer from is the presence of holes in the network, which often obstructs its efficient functioning. Therefore, these holes need to be detected and recovered in an efficient way. By applying various techniques like Voronoi diagram and taking a cue from available algorithms from wireless sensor network and wireless underground sensor network, both, for hole detection, we have tried to propose an algorithm for hole detection. The intended algorithm is able sto detect holes in a scenario where the nodes will be dispersed randomly. An efficiency analysis of the same has been carried out after the implementation.
