In this paper, WHD (Wireless Hole Detection) algorithm hasbeen presented to detect and calculate the accurate holes area in the wirelesssensor networks, while the network nodes operate on limited battery energy.
Oneof the main challenges of these networks is the reduction of their consumedcommunication time and computational power. The WHD offers the advantage ofsmall transmission distances for most of the sensor nodes. This concept leadsto increase the network lifetime, decrease communication overheads and improvethe quality of the network. The basic concept of the proposed WHD algorithm dependson dividing the WSN area into a number of similar cells by using the concept ofgrid algorithm, then WHD works on each cell individually by storing each cell’scoordinates positions and finds the nearest number sensor nodes (depends on theapplication) to each coordinate, then begins to cut each cell into number oftriangles by drawing lines between each coordinate and the selected number ofsensor nodes. Then WHD algorithm calculates the area of the formed triangles ineach cell to get the holes area in this cell.
Then collects the total holesareas in every cell to calculate the total holes area in the ROI. Since the energy consumptionis mainly caused by communication, so less sensor nodes are used to calculatethe holes area, this leads to the minimal communication cost for neighborhooddiscovery and control information exchange between sensor nodes and basestation node. Also the amount of aggregated data by the HN are the minimal dueto the minimal use of sensor nodes in each cell. For the above achievements theaverage energy consumption, Communication overhead and average holes discoverytime decreases, so the network life time increases accordingly.In order to evaluate the performance of the proposed WHD algorithm,we compare its performance results with those obtained from PD and VCHDA algorithmsin terms of average energy consumption and average time discovery time.
Basedon these comparisons, we found that the results of the WHD algorithm is moreefficient and increases the network life time. In the future work, we will try torecover these holes with less mobile nodes.